./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-32.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d4efba5d8035d5b89a6fee2af18255a7435db1834e066c2b81c99247161e78c7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:25:40,984 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:25:41,057 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 09:25:41,063 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:25:41,064 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:25:41,084 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:25:41,084 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:25:41,085 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:25:41,085 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:25:41,085 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:25:41,086 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:25:41,086 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:25:41,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:25:41,088 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:25:41,089 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:25:41,089 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:25:41,089 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:25:41,090 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:25:41,091 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 09:25:41,091 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:25:41,091 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:25:41,091 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:25:41,092 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:25:41,092 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:25:41,092 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:25:41,092 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:25:41,092 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:25:41,092 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:25:41,093 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:25:41,093 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:25:41,093 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:25:41,093 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:25:41,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:25:41,093 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:25:41,093 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:25:41,094 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:25:41,094 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 09:25:41,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 09:25:41,094 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:25:41,094 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:25:41,094 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:25:41,095 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:25:41,095 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d4efba5d8035d5b89a6fee2af18255a7435db1834e066c2b81c99247161e78c7 [2024-10-24 09:25:41,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:25:41,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:25:41,322 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:25:41,323 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:25:41,323 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:25:41,324 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-32.i [2024-10-24 09:25:42,541 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:25:42,716 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:25:42,717 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-32.i [2024-10-24 09:25:42,725 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9400a7bca/de6e283d0d734b5fa9edf95000aad6d5/FLAGdfde85a75 [2024-10-24 09:25:42,738 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9400a7bca/de6e283d0d734b5fa9edf95000aad6d5 [2024-10-24 09:25:42,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:25:42,741 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:25:42,741 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:25:42,742 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:25:42,745 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:25:42,746 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:25:42" (1/1) ... [2024-10-24 09:25:42,747 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bcf50c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:42, skipping insertion in model container [2024-10-24 09:25:42,747 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:25:42" (1/1) ... [2024-10-24 09:25:42,763 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:25:42,890 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-32.i[915,928] [2024-10-24 09:25:42,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:25:42,935 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:25:42,950 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-32.i[915,928] [2024-10-24 09:25:42,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:25:42,983 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:25:42,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:42 WrapperNode [2024-10-24 09:25:42,984 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:25:42,985 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:25:42,985 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:25:42,985 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:25:42,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:42" (1/1) ... [2024-10-24 09:25:42,999 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:42" (1/1) ... [2024-10-24 09:25:43,033 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 191 [2024-10-24 09:25:43,034 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:25:43,034 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:25:43,034 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:25:43,035 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:25:43,043 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:42" (1/1) ... [2024-10-24 09:25:43,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:42" (1/1) ... [2024-10-24 09:25:43,050 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:42" (1/1) ... [2024-10-24 09:25:43,064 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 09:25:43,065 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:42" (1/1) ... [2024-10-24 09:25:43,065 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:42" (1/1) ... [2024-10-24 09:25:43,071 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:42" (1/1) ... [2024-10-24 09:25:43,074 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:42" (1/1) ... [2024-10-24 09:25:43,076 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:42" (1/1) ... [2024-10-24 09:25:43,077 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:42" (1/1) ... [2024-10-24 09:25:43,080 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:25:43,081 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:25:43,081 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:25:43,081 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:25:43,082 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:42" (1/1) ... [2024-10-24 09:25:43,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:25:43,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:25:43,122 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 09:25:43,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 09:25:43,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:25:43,165 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:25:43,165 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:25:43,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 09:25:43,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:25:43,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:25:43,230 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:25:43,231 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:25:43,520 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2024-10-24 09:25:43,520 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:25:43,550 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:25:43,551 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:25:43,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:25:43 BoogieIcfgContainer [2024-10-24 09:25:43,551 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:25:43,555 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:25:43,555 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:25:43,558 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:25:43,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:25:42" (1/3) ... [2024-10-24 09:25:43,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aef4c9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:25:43, skipping insertion in model container [2024-10-24 09:25:43,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:42" (2/3) ... [2024-10-24 09:25:43,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aef4c9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:25:43, skipping insertion in model container [2024-10-24 09:25:43,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:25:43" (3/3) ... [2024-10-24 09:25:43,563 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-32.i [2024-10-24 09:25:43,581 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:25:43,582 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:25:43,637 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:25:43,642 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3c98e040, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:25:43,642 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:25:43,645 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 54 states have (on average 1.5) internal successors, (81), 55 states have internal predecessors, (81), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 09:25:43,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 09:25:43,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:25:43,656 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:25:43,657 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:25:43,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:25:43,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1304209682, now seen corresponding path program 1 times [2024-10-24 09:25:43,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:25:43,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742035029] [2024-10-24 09:25:43,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:25:43,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:25:43,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:43,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:25:43,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:43,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:25:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:43,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:25:43,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:43,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:25:43,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:43,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:25:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:43,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:25:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:43,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:25:43,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:43,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:25:43,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:43,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:25:43,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:43,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:25:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:43,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:25:43,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:43,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:25:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:43,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:25:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:43,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:25:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:43,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:25:43,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:43,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 09:25:43,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:43,987 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 09:25:43,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:25:43,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742035029] [2024-10-24 09:25:43,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742035029] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:25:43,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:25:43,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:25:43,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237021852] [2024-10-24 09:25:43,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:25:43,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:25:43,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:25:44,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:25:44,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:25:44,011 INFO L87 Difference]: Start difference. First operand has 73 states, 54 states have (on average 1.5) internal successors, (81), 55 states have internal predecessors, (81), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 09:25:44,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:25:44,041 INFO L93 Difference]: Finished difference Result 145 states and 241 transitions. [2024-10-24 09:25:44,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:25:44,044 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 106 [2024-10-24 09:25:44,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:25:44,050 INFO L225 Difference]: With dead ends: 145 [2024-10-24 09:25:44,050 INFO L226 Difference]: Without dead ends: 71 [2024-10-24 09:25:44,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:25:44,058 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:25:44,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:25:44,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-24 09:25:44,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-24 09:25:44,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 53 states have internal predecessors, (76), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 09:25:44,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 108 transitions. [2024-10-24 09:25:44,092 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 108 transitions. Word has length 106 [2024-10-24 09:25:44,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:25:44,092 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 108 transitions. [2024-10-24 09:25:44,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 09:25:44,094 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 108 transitions. [2024-10-24 09:25:44,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 09:25:44,096 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:25:44,096 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:25:44,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 09:25:44,097 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:25:44,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:25:44,097 INFO L85 PathProgramCache]: Analyzing trace with hash -726632722, now seen corresponding path program 1 times [2024-10-24 09:25:44,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:25:44,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378443326] [2024-10-24 09:25:44,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:25:44,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:25:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:44,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:25:44,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:44,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:25:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:44,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:25:44,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:44,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:25:44,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:44,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:25:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:44,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:25:44,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:44,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:25:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:44,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:25:44,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:44,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:25:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:44,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:25:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:44,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:25:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:44,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:25:44,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:44,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:25:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:44,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:25:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:44,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:25:44,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:44,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 09:25:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:44,482 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 09:25:44,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:25:44,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378443326] [2024-10-24 09:25:44,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378443326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:25:44,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:25:44,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 09:25:44,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395823431] [2024-10-24 09:25:44,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:25:44,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 09:25:44,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:25:44,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 09:25:44,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 09:25:44,488 INFO L87 Difference]: Start difference. First operand 71 states and 108 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 09:25:44,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:25:44,659 INFO L93 Difference]: Finished difference Result 246 states and 374 transitions. [2024-10-24 09:25:44,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 09:25:44,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 106 [2024-10-24 09:25:44,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:25:44,662 INFO L225 Difference]: With dead ends: 246 [2024-10-24 09:25:44,662 INFO L226 Difference]: Without dead ends: 176 [2024-10-24 09:25:44,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 09:25:44,664 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 137 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:25:44,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 348 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:25:44,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-10-24 09:25:44,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 139. [2024-10-24 09:25:44,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 104 states have (on average 1.4326923076923077) internal successors, (149), 104 states have internal predecessors, (149), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 09:25:44,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 213 transitions. [2024-10-24 09:25:44,703 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 213 transitions. Word has length 106 [2024-10-24 09:25:44,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:25:44,703 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 213 transitions. [2024-10-24 09:25:44,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 09:25:44,704 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 213 transitions. [2024-10-24 09:25:44,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 09:25:44,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:25:44,707 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:25:44,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 09:25:44,707 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:25:44,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:25:44,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1747701076, now seen corresponding path program 1 times [2024-10-24 09:25:44,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:25:44,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748861263] [2024-10-24 09:25:44,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:25:44,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:25:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:44,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:25:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:44,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:25:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:44,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:25:44,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:44,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:25:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:44,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:25:44,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:44,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:25:44,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:44,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:25:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:44,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:25:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:44,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:25:44,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:44,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:25:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:44,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:25:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:44,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:25:44,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:44,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:25:44,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:44,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:25:44,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:44,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:25:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:44,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 09:25:44,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:44,950 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 09:25:44,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:25:44,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748861263] [2024-10-24 09:25:44,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748861263] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:25:44,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:25:44,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 09:25:44,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988943029] [2024-10-24 09:25:44,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:25:44,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 09:25:44,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:25:44,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 09:25:44,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 09:25:44,953 INFO L87 Difference]: Start difference. First operand 139 states and 213 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 09:25:45,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:25:45,082 INFO L93 Difference]: Finished difference Result 393 states and 603 transitions. [2024-10-24 09:25:45,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 09:25:45,083 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 106 [2024-10-24 09:25:45,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:25:45,086 INFO L225 Difference]: With dead ends: 393 [2024-10-24 09:25:45,086 INFO L226 Difference]: Without dead ends: 255 [2024-10-24 09:25:45,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 09:25:45,091 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 121 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:25:45,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 383 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:25:45,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-10-24 09:25:45,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 185. [2024-10-24 09:25:45,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 133 states have (on average 1.413533834586466) internal successors, (188), 133 states have internal predecessors, (188), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 09:25:45,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 284 transitions. [2024-10-24 09:25:45,124 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 284 transitions. Word has length 106 [2024-10-24 09:25:45,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:25:45,124 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 284 transitions. [2024-10-24 09:25:45,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 09:25:45,125 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 284 transitions. [2024-10-24 09:25:45,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 09:25:45,127 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:25:45,127 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:25:45,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 09:25:45,127 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:25:45,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:25:45,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1312855375, now seen corresponding path program 1 times [2024-10-24 09:25:45,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:25:45,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319990852] [2024-10-24 09:25:45,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:25:45,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:25:45,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:45,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:25:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:45,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:25:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:45,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:25:45,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:45,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:25:45,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:45,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:25:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:45,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:25:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:45,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:25:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:45,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:25:45,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:45,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:25:45,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:45,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:25:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:45,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:25:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:45,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:25:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:45,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:25:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:45,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:25:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:45,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:25:45,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:45,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 09:25:45,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:45,313 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 09:25:45,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:25:45,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319990852] [2024-10-24 09:25:45,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319990852] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:25:45,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:25:45,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:25:45,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228496039] [2024-10-24 09:25:45,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:25:45,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:25:45,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:25:45,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:25:45,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:25:45,316 INFO L87 Difference]: Start difference. First operand 185 states and 284 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 09:25:45,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:25:45,366 INFO L93 Difference]: Finished difference Result 389 states and 599 transitions. [2024-10-24 09:25:45,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:25:45,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2024-10-24 09:25:45,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:25:45,369 INFO L225 Difference]: With dead ends: 389 [2024-10-24 09:25:45,370 INFO L226 Difference]: Without dead ends: 251 [2024-10-24 09:25:45,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:25:45,373 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 72 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:25:45,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 190 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:25:45,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-24 09:25:45,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2024-10-24 09:25:45,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 180 states have (on average 1.4) internal successors, (252), 180 states have internal predecessors, (252), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-24 09:25:45,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 380 transitions. [2024-10-24 09:25:45,409 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 380 transitions. Word has length 107 [2024-10-24 09:25:45,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:25:45,410 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 380 transitions. [2024-10-24 09:25:45,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 09:25:45,410 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 380 transitions. [2024-10-24 09:25:45,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 09:25:45,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:25:45,413 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:25:45,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 09:25:45,413 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:25:45,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:25:45,414 INFO L85 PathProgramCache]: Analyzing trace with hash 240859825, now seen corresponding path program 1 times [2024-10-24 09:25:45,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:25:45,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807281831] [2024-10-24 09:25:45,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:25:45,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:25:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:45,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:25:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:45,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:25:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:45,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:25:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:45,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:25:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:45,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:25:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:45,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:25:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:45,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:25:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:45,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:25:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:45,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:25:45,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:45,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:25:45,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:45,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:25:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:45,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:25:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:45,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:25:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:45,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:25:45,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:45,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:25:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:45,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 09:25:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:45,738 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 09:25:45,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:25:45,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807281831] [2024-10-24 09:25:45,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807281831] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:25:45,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:25:45,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 09:25:45,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000184049] [2024-10-24 09:25:45,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:25:45,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 09:25:45,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:25:45,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 09:25:45,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 09:25:45,740 INFO L87 Difference]: Start difference. First operand 249 states and 380 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 09:25:45,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:25:45,935 INFO L93 Difference]: Finished difference Result 589 states and 895 transitions. [2024-10-24 09:25:45,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 09:25:45,937 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2024-10-24 09:25:45,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:25:45,939 INFO L225 Difference]: With dead ends: 589 [2024-10-24 09:25:45,939 INFO L226 Difference]: Without dead ends: 383 [2024-10-24 09:25:45,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-24 09:25:45,942 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 128 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:25:45,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 453 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:25:45,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-10-24 09:25:45,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 343. [2024-10-24 09:25:45,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 274 states have (on average 1.4197080291970803) internal successors, (389), 274 states have internal predecessors, (389), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-24 09:25:45,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 517 transitions. [2024-10-24 09:25:45,967 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 517 transitions. Word has length 107 [2024-10-24 09:25:45,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:25:45,968 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 517 transitions. [2024-10-24 09:25:45,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 09:25:45,970 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 517 transitions. [2024-10-24 09:25:45,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 09:25:45,971 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:25:45,971 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:25:45,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 09:25:45,971 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:25:45,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:25:45,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1628909693, now seen corresponding path program 1 times [2024-10-24 09:25:45,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:25:45,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230677006] [2024-10-24 09:25:45,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:25:45,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:25:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:46,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:25:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:46,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:25:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:46,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:25:46,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:46,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:25:46,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:46,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:25:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:46,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:25:46,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:46,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:25:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:46,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:25:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:46,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:25:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:46,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:25:46,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:46,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:25:46,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:46,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:25:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:46,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:25:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:46,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:25:46,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:46,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:25:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:46,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 09:25:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:46,095 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 09:25:46,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:25:46,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230677006] [2024-10-24 09:25:46,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230677006] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:25:46,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:25:46,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 09:25:46,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251857120] [2024-10-24 09:25:46,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:25:46,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 09:25:46,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:25:46,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 09:25:46,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 09:25:46,097 INFO L87 Difference]: Start difference. First operand 343 states and 517 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 09:25:46,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:25:46,200 INFO L93 Difference]: Finished difference Result 718 states and 1080 transitions. [2024-10-24 09:25:46,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 09:25:46,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111 [2024-10-24 09:25:46,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:25:46,203 INFO L225 Difference]: With dead ends: 718 [2024-10-24 09:25:46,203 INFO L226 Difference]: Without dead ends: 431 [2024-10-24 09:25:46,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 09:25:46,204 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 86 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:25:46,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 386 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:25:46,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-10-24 09:25:46,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 383. [2024-10-24 09:25:46,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 314 states have (on average 1.4171974522292994) internal successors, (445), 314 states have internal predecessors, (445), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-24 09:25:46,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 573 transitions. [2024-10-24 09:25:46,219 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 573 transitions. Word has length 111 [2024-10-24 09:25:46,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:25:46,219 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 573 transitions. [2024-10-24 09:25:46,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 09:25:46,220 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 573 transitions. [2024-10-24 09:25:46,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-24 09:25:46,220 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:25:46,221 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:25:46,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 09:25:46,221 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:25:46,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:25:46,221 INFO L85 PathProgramCache]: Analyzing trace with hash 2017453221, now seen corresponding path program 1 times [2024-10-24 09:25:46,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:25:46,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649137118] [2024-10-24 09:25:46,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:25:46,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:25:46,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:47,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:25:47,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:47,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:25:47,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:47,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:25:47,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:47,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:25:47,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:47,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:25:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:47,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:25:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:47,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:25:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:47,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:25:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:47,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:25:47,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:47,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:25:47,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:47,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:25:47,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:47,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:25:47,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:47,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:25:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:47,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:25:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:47,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:25:47,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:47,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 09:25:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:47,288 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 09:25:47,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:25:47,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649137118] [2024-10-24 09:25:47,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649137118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:25:47,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:25:47,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 09:25:47,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462493110] [2024-10-24 09:25:47,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:25:47,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 09:25:47,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:25:47,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 09:25:47,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 09:25:47,289 INFO L87 Difference]: Start difference. First operand 383 states and 573 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 09:25:48,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:25:48,909 INFO L93 Difference]: Finished difference Result 864 states and 1288 transitions. [2024-10-24 09:25:48,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 09:25:48,910 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2024-10-24 09:25:48,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:25:48,913 INFO L225 Difference]: With dead ends: 864 [2024-10-24 09:25:48,913 INFO L226 Difference]: Without dead ends: 577 [2024-10-24 09:25:48,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-24 09:25:48,914 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 53 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 09:25:48,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 598 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 09:25:48,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2024-10-24 09:25:48,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 492. [2024-10-24 09:25:48,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 423 states have (on average 1.4160756501182032) internal successors, (599), 423 states have internal predecessors, (599), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-24 09:25:48,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 727 transitions. [2024-10-24 09:25:48,935 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 727 transitions. Word has length 112 [2024-10-24 09:25:48,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:25:48,936 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 727 transitions. [2024-10-24 09:25:48,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 09:25:48,936 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 727 transitions. [2024-10-24 09:25:48,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-24 09:25:48,937 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:25:48,937 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:25:48,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 09:25:48,937 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:25:48,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:25:48,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1430647207, now seen corresponding path program 1 times [2024-10-24 09:25:48,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:25:48,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685578749] [2024-10-24 09:25:48,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:25:48,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:25:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:50,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:25:50,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:50,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:25:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:50,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:25:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:50,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:25:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:50,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:25:50,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:50,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:25:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:50,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:25:50,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:50,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:25:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:50,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:25:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:50,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:25:50,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:50,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:25:50,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:50,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:25:50,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:50,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:25:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:50,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:25:50,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:50,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:25:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:50,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 09:25:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:50,206 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 09:25:50,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:25:50,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685578749] [2024-10-24 09:25:50,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685578749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:25:50,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:25:50,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 09:25:50,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714560782] [2024-10-24 09:25:50,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:25:50,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 09:25:50,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:25:50,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 09:25:50,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-24 09:25:50,208 INFO L87 Difference]: Start difference. First operand 492 states and 727 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 09:25:51,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:25:51,360 INFO L93 Difference]: Finished difference Result 1008 states and 1479 transitions. [2024-10-24 09:25:51,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 09:25:51,360 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2024-10-24 09:25:51,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:25:51,363 INFO L225 Difference]: With dead ends: 1008 [2024-10-24 09:25:51,363 INFO L226 Difference]: Without dead ends: 640 [2024-10-24 09:25:51,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2024-10-24 09:25:51,365 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 124 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 09:25:51,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 771 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 09:25:51,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2024-10-24 09:25:51,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 492. [2024-10-24 09:25:51,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 423 states have (on average 1.4160756501182032) internal successors, (599), 423 states have internal predecessors, (599), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-24 09:25:51,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 727 transitions. [2024-10-24 09:25:51,396 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 727 transitions. Word has length 112 [2024-10-24 09:25:51,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:25:51,397 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 727 transitions. [2024-10-24 09:25:51,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 09:25:51,397 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 727 transitions. [2024-10-24 09:25:51,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-24 09:25:51,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:25:51,399 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:25:51,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 09:25:51,399 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:25:51,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:25:51,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1319951810, now seen corresponding path program 1 times [2024-10-24 09:25:51,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:25:51,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098912332] [2024-10-24 09:25:51,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:25:51,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:25:51,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:51,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:25:51,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:51,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:25:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:51,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:25:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:51,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:25:51,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:51,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:25:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:51,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:25:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:51,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:25:51,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:51,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:25:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:51,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:25:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:51,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:25:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:51,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:25:51,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:51,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:25:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:51,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:25:51,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:51,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:25:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:51,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:25:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:51,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 09:25:51,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:51,657 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 09:25:51,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:25:51,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098912332] [2024-10-24 09:25:51,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098912332] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:25:51,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:25:51,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 09:25:51,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946097265] [2024-10-24 09:25:51,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:25:51,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 09:25:51,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:25:51,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 09:25:51,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 09:25:51,659 INFO L87 Difference]: Start difference. First operand 492 states and 727 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 09:25:51,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:25:51,837 INFO L93 Difference]: Finished difference Result 1149 states and 1703 transitions. [2024-10-24 09:25:51,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 09:25:51,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 113 [2024-10-24 09:25:51,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:25:51,840 INFO L225 Difference]: With dead ends: 1149 [2024-10-24 09:25:51,840 INFO L226 Difference]: Without dead ends: 773 [2024-10-24 09:25:51,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-24 09:25:51,842 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 161 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:25:51,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 351 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:25:51,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2024-10-24 09:25:51,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 746. [2024-10-24 09:25:51,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 650 states have (on average 1.3846153846153846) internal successors, (900), 653 states have internal predecessors, (900), 88 states have call successors, (88), 7 states have call predecessors, (88), 7 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-24 09:25:51,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1076 transitions. [2024-10-24 09:25:51,870 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1076 transitions. Word has length 113 [2024-10-24 09:25:51,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:25:51,870 INFO L471 AbstractCegarLoop]: Abstraction has 746 states and 1076 transitions. [2024-10-24 09:25:51,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 09:25:51,870 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1076 transitions. [2024-10-24 09:25:51,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-24 09:25:51,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:25:51,872 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:25:51,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 09:25:51,872 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:25:51,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:25:51,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1362429189, now seen corresponding path program 1 times [2024-10-24 09:25:51,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:25:51,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366469395] [2024-10-24 09:25:51,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:25:51,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:25:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:52,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:25:52,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:52,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:25:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:52,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:25:52,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:52,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:25:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:52,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:25:52,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:52,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:25:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:52,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:25:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:52,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:25:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:52,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:25:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:52,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:25:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:52,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:25:52,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:52,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:25:52,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:52,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:25:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:52,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:25:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:52,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:25:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:52,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 09:25:52,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:52,140 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 09:25:52,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:25:52,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366469395] [2024-10-24 09:25:52,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366469395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:25:52,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:25:52,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 09:25:52,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531356001] [2024-10-24 09:25:52,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:25:52,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 09:25:52,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:25:52,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 09:25:52,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 09:25:52,142 INFO L87 Difference]: Start difference. First operand 746 states and 1076 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 09:25:52,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:25:52,458 INFO L93 Difference]: Finished difference Result 1566 states and 2281 transitions. [2024-10-24 09:25:52,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 09:25:52,459 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 113 [2024-10-24 09:25:52,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:25:52,464 INFO L225 Difference]: With dead ends: 1566 [2024-10-24 09:25:52,464 INFO L226 Difference]: Without dead ends: 976 [2024-10-24 09:25:52,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 09:25:52,465 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 185 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 09:25:52,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 414 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 09:25:52,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-24 09:25:52,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 807. [2024-10-24 09:25:52,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 710 states have (on average 1.408450704225352) internal successors, (1000), 713 states have internal predecessors, (1000), 88 states have call successors, (88), 8 states have call predecessors, (88), 8 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-24 09:25:52,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1176 transitions. [2024-10-24 09:25:52,494 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1176 transitions. Word has length 113 [2024-10-24 09:25:52,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:25:52,495 INFO L471 AbstractCegarLoop]: Abstraction has 807 states and 1176 transitions. [2024-10-24 09:25:52,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 09:25:52,495 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1176 transitions. [2024-10-24 09:25:52,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 09:25:52,496 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:25:52,496 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:25:52,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 09:25:52,496 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:25:52,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:25:52,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1029134026, now seen corresponding path program 1 times [2024-10-24 09:25:52,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:25:52,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711611873] [2024-10-24 09:25:52,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:25:52,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:25:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:52,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:25:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:52,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:25:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:52,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:25:52,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:52,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:25:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:52,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:25:52,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:52,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:25:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:52,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:25:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:52,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:25:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:52,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:25:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:52,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:25:52,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:52,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:25:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:52,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:25:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:52,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:25:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:52,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:25:52,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:52,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:25:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:52,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 09:25:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:52,774 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 09:25:52,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:25:52,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711611873] [2024-10-24 09:25:52,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711611873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:25:52,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:25:52,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 09:25:52,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915168588] [2024-10-24 09:25:52,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:25:52,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 09:25:52,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:25:52,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 09:25:52,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 09:25:52,775 INFO L87 Difference]: Start difference. First operand 807 states and 1176 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 09:25:52,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:25:52,945 INFO L93 Difference]: Finished difference Result 1162 states and 1696 transitions. [2024-10-24 09:25:52,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 09:25:52,945 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2024-10-24 09:25:52,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:25:52,950 INFO L225 Difference]: With dead ends: 1162 [2024-10-24 09:25:52,950 INFO L226 Difference]: Without dead ends: 1160 [2024-10-24 09:25:52,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 09:25:52,952 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 72 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:25:52,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 584 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:25:52,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2024-10-24 09:25:52,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1156. [2024-10-24 09:25:52,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1015 states have (on average 1.4108374384236453) internal successors, (1432), 1022 states have internal predecessors, (1432), 128 states have call successors, (128), 12 states have call predecessors, (128), 12 states have return successors, (128), 121 states have call predecessors, (128), 128 states have call successors, (128) [2024-10-24 09:25:52,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1688 transitions. [2024-10-24 09:25:52,997 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1688 transitions. Word has length 114 [2024-10-24 09:25:52,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:25:52,997 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1688 transitions. [2024-10-24 09:25:52,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 09:25:52,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1688 transitions. [2024-10-24 09:25:52,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 09:25:52,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:25:52,999 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:25:52,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 09:25:52,999 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:25:52,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:25:52,999 INFO L85 PathProgramCache]: Analyzing trace with hash -210827014, now seen corresponding path program 1 times [2024-10-24 09:25:52,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:25:52,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605264541] [2024-10-24 09:25:52,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:25:53,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:25:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:53,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:25:53,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:53,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:25:53,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:53,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:25:53,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:53,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:25:53,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:53,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:25:53,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:53,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:25:53,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:53,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:25:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:53,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:25:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:53,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:25:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:53,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:25:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:53,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:25:53,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:53,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:25:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:53,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:25:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:53,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:25:53,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:53,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:25:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:53,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 09:25:53,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:53,063 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 09:25:53,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:25:53,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605264541] [2024-10-24 09:25:53,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605264541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:25:53,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:25:53,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:25:53,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723450852] [2024-10-24 09:25:53,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:25:53,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:25:53,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:25:53,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:25:53,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:25:53,065 INFO L87 Difference]: Start difference. First operand 1156 states and 1688 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 09:25:53,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:25:53,145 INFO L93 Difference]: Finished difference Result 2438 states and 3530 transitions. [2024-10-24 09:25:53,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:25:53,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2024-10-24 09:25:53,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:25:53,152 INFO L225 Difference]: With dead ends: 2438 [2024-10-24 09:25:53,152 INFO L226 Difference]: Without dead ends: 1466 [2024-10-24 09:25:53,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:25:53,154 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 47 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:25:53,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 192 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:25:53,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2024-10-24 09:25:53,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1459. [2024-10-24 09:25:53,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1459 states, 1287 states have (on average 1.3721833721833723) internal successors, (1766), 1299 states have internal predecessors, (1766), 148 states have call successors, (148), 23 states have call predecessors, (148), 23 states have return successors, (148), 136 states have call predecessors, (148), 148 states have call successors, (148) [2024-10-24 09:25:53,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 2062 transitions. [2024-10-24 09:25:53,209 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 2062 transitions. Word has length 114 [2024-10-24 09:25:53,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:25:53,210 INFO L471 AbstractCegarLoop]: Abstraction has 1459 states and 2062 transitions. [2024-10-24 09:25:53,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 09:25:53,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 2062 transitions. [2024-10-24 09:25:53,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 09:25:53,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:25:53,212 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:25:53,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 09:25:53,212 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:25:53,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:25:53,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1805923998, now seen corresponding path program 1 times [2024-10-24 09:25:53,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:25:53,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913101819] [2024-10-24 09:25:53,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:25:53,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:25:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:53,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:25:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:53,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:25:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:53,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:25:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:53,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:25:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:53,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:25:53,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:53,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:25:53,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:53,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:25:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:53,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:25:53,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:53,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:25:53,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:53,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:25:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:53,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:25:53,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:53,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:25:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:53,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:25:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:53,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:25:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:53,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:25:53,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:53,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 09:25:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:53,731 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 09:25:53,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:25:53,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913101819] [2024-10-24 09:25:53,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913101819] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:25:53,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:25:53,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 09:25:53,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35726062] [2024-10-24 09:25:53,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:25:53,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 09:25:53,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:25:53,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 09:25:53,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 09:25:53,733 INFO L87 Difference]: Start difference. First operand 1459 states and 2062 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 09:25:55,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:25:55,083 INFO L93 Difference]: Finished difference Result 3225 states and 4537 transitions. [2024-10-24 09:25:55,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 09:25:55,084 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2024-10-24 09:25:55,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:25:55,105 INFO L225 Difference]: With dead ends: 3225 [2024-10-24 09:25:55,105 INFO L226 Difference]: Without dead ends: 1999 [2024-10-24 09:25:55,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-24 09:25:55,109 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 38 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:25:55,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 660 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 09:25:55,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2024-10-24 09:25:55,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1987. [2024-10-24 09:25:55,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1987 states, 1785 states have (on average 1.35406162464986) internal successors, (2417), 1807 states have internal predecessors, (2417), 168 states have call successors, (168), 33 states have call predecessors, (168), 33 states have return successors, (168), 146 states have call predecessors, (168), 168 states have call successors, (168) [2024-10-24 09:25:55,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1987 states and 2753 transitions. [2024-10-24 09:25:55,247 INFO L78 Accepts]: Start accepts. Automaton has 1987 states and 2753 transitions. Word has length 114 [2024-10-24 09:25:55,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:25:55,247 INFO L471 AbstractCegarLoop]: Abstraction has 1987 states and 2753 transitions. [2024-10-24 09:25:55,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 09:25:55,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 2753 transitions. [2024-10-24 09:25:55,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 09:25:55,249 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:25:55,250 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:25:55,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 09:25:55,250 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:25:55,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:25:55,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1477926048, now seen corresponding path program 1 times [2024-10-24 09:25:55,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:25:55,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871641055] [2024-10-24 09:25:55,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:25:55,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:25:55,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:55,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:25:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:55,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:25:55,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:55,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:25:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:55,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:25:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:55,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:25:55,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:55,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:25:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:55,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:25:55,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:55,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:25:55,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:55,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:25:55,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:55,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:25:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:55,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:25:55,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:55,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:25:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:55,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:25:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:55,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:25:55,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:55,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:25:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:55,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 09:25:55,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:55,794 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 09:25:55,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:25:55,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871641055] [2024-10-24 09:25:55,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871641055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:25:55,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:25:55,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 09:25:55,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944423197] [2024-10-24 09:25:55,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:25:55,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 09:25:55,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:25:55,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 09:25:55,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 09:25:55,797 INFO L87 Difference]: Start difference. First operand 1987 states and 2753 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 09:25:56,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:25:56,448 INFO L93 Difference]: Finished difference Result 4289 states and 5937 transitions. [2024-10-24 09:25:56,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 09:25:56,449 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2024-10-24 09:25:56,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:25:56,458 INFO L225 Difference]: With dead ends: 4289 [2024-10-24 09:25:56,459 INFO L226 Difference]: Without dead ends: 2600 [2024-10-24 09:25:56,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-24 09:25:56,464 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 63 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 09:25:56,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 789 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 09:25:56,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2600 states. [2024-10-24 09:25:56,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2600 to 2501. [2024-10-24 09:25:56,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2501 states, 2242 states have (on average 1.3331846565566459) internal successors, (2989), 2270 states have internal predecessors, (2989), 216 states have call successors, (216), 42 states have call predecessors, (216), 42 states have return successors, (216), 188 states have call predecessors, (216), 216 states have call successors, (216) [2024-10-24 09:25:56,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2501 states to 2501 states and 3421 transitions. [2024-10-24 09:25:56,603 INFO L78 Accepts]: Start accepts. Automaton has 2501 states and 3421 transitions. Word has length 114 [2024-10-24 09:25:56,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:25:56,604 INFO L471 AbstractCegarLoop]: Abstraction has 2501 states and 3421 transitions. [2024-10-24 09:25:56,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 09:25:56,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2501 states and 3421 transitions. [2024-10-24 09:25:56,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 09:25:56,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:25:56,605 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:25:56,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 09:25:56,606 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:25:56,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:25:56,606 INFO L85 PathProgramCache]: Analyzing trace with hash 274854138, now seen corresponding path program 1 times [2024-10-24 09:25:56,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:25:56,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757663398] [2024-10-24 09:25:56,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:25:56,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:25:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:56,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:25:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:56,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:25:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:56,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:25:56,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:56,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:25:56,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:56,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:25:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:56,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:25:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:56,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:25:56,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:56,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:25:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:56,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:25:56,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:56,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:25:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:56,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:25:56,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:56,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:25:56,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:56,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:25:56,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:56,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:25:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:56,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:25:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:56,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 09:25:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:56,664 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 09:25:56,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:25:56,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757663398] [2024-10-24 09:25:56,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757663398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:25:56,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:25:56,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:25:56,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111240885] [2024-10-24 09:25:56,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:25:56,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:25:56,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:25:56,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:25:56,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:25:56,666 INFO L87 Difference]: Start difference. First operand 2501 states and 3421 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 09:25:56,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:25:56,810 INFO L93 Difference]: Finished difference Result 4706 states and 6443 transitions. [2024-10-24 09:25:56,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:25:56,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2024-10-24 09:25:56,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:25:56,820 INFO L225 Difference]: With dead ends: 4706 [2024-10-24 09:25:56,820 INFO L226 Difference]: Without dead ends: 2543 [2024-10-24 09:25:56,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:25:56,824 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 49 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:25:56,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 241 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:25:56,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2543 states. [2024-10-24 09:25:56,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2543 to 2063. [2024-10-24 09:25:56,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2063 states, 1851 states have (on average 1.3187466234467855) internal successors, (2441), 1866 states have internal predecessors, (2441), 174 states have call successors, (174), 37 states have call predecessors, (174), 37 states have return successors, (174), 159 states have call predecessors, (174), 174 states have call successors, (174) [2024-10-24 09:25:56,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 2063 states and 2789 transitions. [2024-10-24 09:25:56,923 INFO L78 Accepts]: Start accepts. Automaton has 2063 states and 2789 transitions. Word has length 114 [2024-10-24 09:25:56,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:25:56,923 INFO L471 AbstractCegarLoop]: Abstraction has 2063 states and 2789 transitions. [2024-10-24 09:25:56,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 09:25:56,924 INFO L276 IsEmpty]: Start isEmpty. Operand 2063 states and 2789 transitions. [2024-10-24 09:25:56,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 09:25:56,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:25:56,925 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:25:56,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 09:25:56,926 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:25:56,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:25:56,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1421886056, now seen corresponding path program 1 times [2024-10-24 09:25:56,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:25:56,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691693767] [2024-10-24 09:25:56,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:25:56,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:25:56,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:57,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:25:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:57,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:25:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:57,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:25:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:57,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:25:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:57,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:25:57,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:57,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:25:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:57,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:25:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:57,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:25:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:57,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:25:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:57,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:25:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:57,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:25:57,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:57,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:25:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:57,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:25:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:57,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:25:57,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:57,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:25:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:57,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 09:25:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:57,273 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 09:25:57,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:25:57,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691693767] [2024-10-24 09:25:57,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691693767] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:25:57,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:25:57,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 09:25:57,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377607198] [2024-10-24 09:25:57,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:25:57,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 09:25:57,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:25:57,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 09:25:57,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-24 09:25:57,277 INFO L87 Difference]: Start difference. First operand 2063 states and 2789 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 09:25:57,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:25:57,651 INFO L93 Difference]: Finished difference Result 4117 states and 5595 transitions. [2024-10-24 09:25:57,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 09:25:57,651 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 115 [2024-10-24 09:25:57,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:25:57,659 INFO L225 Difference]: With dead ends: 4117 [2024-10-24 09:25:57,660 INFO L226 Difference]: Without dead ends: 2407 [2024-10-24 09:25:57,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-10-24 09:25:57,663 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 125 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 09:25:57,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 710 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 09:25:57,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2407 states. [2024-10-24 09:25:57,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2407 to 2083. [2024-10-24 09:25:57,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2083 states, 1871 states have (on average 1.3153393907001603) internal successors, (2461), 1886 states have internal predecessors, (2461), 174 states have call successors, (174), 37 states have call predecessors, (174), 37 states have return successors, (174), 159 states have call predecessors, (174), 174 states have call successors, (174) [2024-10-24 09:25:57,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 2083 states and 2809 transitions. [2024-10-24 09:25:57,768 INFO L78 Accepts]: Start accepts. Automaton has 2083 states and 2809 transitions. Word has length 115 [2024-10-24 09:25:57,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:25:57,768 INFO L471 AbstractCegarLoop]: Abstraction has 2083 states and 2809 transitions. [2024-10-24 09:25:57,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 09:25:57,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2083 states and 2809 transitions. [2024-10-24 09:25:57,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 09:25:57,770 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:25:57,770 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:25:57,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 09:25:57,770 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:25:57,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:25:57,771 INFO L85 PathProgramCache]: Analyzing trace with hash 303861893, now seen corresponding path program 1 times [2024-10-24 09:25:57,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:25:57,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678011020] [2024-10-24 09:25:57,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:25:57,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:25:57,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:58,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:25:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:58,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:25:58,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:58,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:25:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:58,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:25:58,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:58,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:25:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:58,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:25:58,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:58,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:25:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:58,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:25:58,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:58,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:25:58,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:58,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:25:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:58,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:25:58,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:58,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:25:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:58,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:25:58,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:58,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:25:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:58,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:25:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:58,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 09:25:58,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:58,347 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 09:25:58,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:25:58,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678011020] [2024-10-24 09:25:58,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678011020] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:25:58,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:25:58,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 09:25:58,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213591700] [2024-10-24 09:25:58,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:25:58,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 09:25:58,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:25:58,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 09:25:58,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-10-24 09:25:58,349 INFO L87 Difference]: Start difference. First operand 2083 states and 2809 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 09:25:59,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:25:59,036 INFO L93 Difference]: Finished difference Result 4103 states and 5574 transitions. [2024-10-24 09:25:59,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 09:25:59,036 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 115 [2024-10-24 09:25:59,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:25:59,044 INFO L225 Difference]: With dead ends: 4103 [2024-10-24 09:25:59,045 INFO L226 Difference]: Without dead ends: 2393 [2024-10-24 09:25:59,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2024-10-24 09:25:59,050 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 270 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 09:25:59,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 666 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 09:25:59,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2393 states. [2024-10-24 09:25:59,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2393 to 2093. [2024-10-24 09:25:59,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2093 states, 1881 states have (on average 1.3136629452418926) internal successors, (2471), 1896 states have internal predecessors, (2471), 174 states have call successors, (174), 37 states have call predecessors, (174), 37 states have return successors, (174), 159 states have call predecessors, (174), 174 states have call successors, (174) [2024-10-24 09:25:59,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 2819 transitions. [2024-10-24 09:25:59,146 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 2819 transitions. Word has length 115 [2024-10-24 09:25:59,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:25:59,148 INFO L471 AbstractCegarLoop]: Abstraction has 2093 states and 2819 transitions. [2024-10-24 09:25:59,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 09:25:59,148 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 2819 transitions. [2024-10-24 09:25:59,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 09:25:59,149 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:25:59,149 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:25:59,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 09:25:59,150 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:25:59,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:25:59,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1042354037, now seen corresponding path program 1 times [2024-10-24 09:25:59,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:25:59,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414373197] [2024-10-24 09:25:59,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:25:59,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:25:59,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:59,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:25:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:59,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:25:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:59,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:25:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:59,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:25:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:59,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:25:59,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:59,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:25:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:59,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:25:59,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:59,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:25:59,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:59,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:25:59,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:59,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:25:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:59,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:25:59,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:59,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:25:59,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:59,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:25:59,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:59,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:25:59,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:59,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:25:59,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:59,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 09:25:59,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:59,292 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 75 proven. 9 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2024-10-24 09:25:59,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:25:59,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414373197] [2024-10-24 09:25:59,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414373197] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 09:25:59,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218165752] [2024-10-24 09:25:59,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:25:59,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:25:59,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:25:59,295 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 09:25:59,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 09:25:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:59,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 09:25:59,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:25:59,471 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 194 proven. 9 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2024-10-24 09:25:59,471 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:25:59,639 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 75 proven. 12 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2024-10-24 09:25:59,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218165752] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 09:25:59,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 09:25:59,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 12 [2024-10-24 09:25:59,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866051085] [2024-10-24 09:25:59,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 09:25:59,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 09:25:59,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:25:59,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 09:25:59,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-24 09:25:59,642 INFO L87 Difference]: Start difference. First operand 2093 states and 2819 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (19), 3 states have call predecessors, (19), 7 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-24 09:25:59,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:25:59,921 INFO L93 Difference]: Finished difference Result 4242 states and 5671 transitions. [2024-10-24 09:25:59,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 09:25:59,921 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (19), 3 states have call predecessors, (19), 7 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 115 [2024-10-24 09:25:59,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:25:59,929 INFO L225 Difference]: With dead ends: 4242 [2024-10-24 09:25:59,929 INFO L226 Difference]: Without dead ends: 2191 [2024-10-24 09:25:59,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 254 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2024-10-24 09:25:59,933 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 80 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:25:59,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 226 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:25:59,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2191 states. [2024-10-24 09:26:00,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2191 to 2125. [2024-10-24 09:26:00,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2125 states, 1905 states have (on average 1.2992125984251968) internal successors, (2475), 1920 states have internal predecessors, (2475), 174 states have call successors, (174), 45 states have call predecessors, (174), 45 states have return successors, (174), 159 states have call predecessors, (174), 174 states have call successors, (174) [2024-10-24 09:26:00,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 2823 transitions. [2024-10-24 09:26:00,042 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 2823 transitions. Word has length 115 [2024-10-24 09:26:00,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:26:00,043 INFO L471 AbstractCegarLoop]: Abstraction has 2125 states and 2823 transitions. [2024-10-24 09:26:00,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 3 states have call successors, (19), 3 states have call predecessors, (19), 7 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-24 09:26:00,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 2823 transitions. [2024-10-24 09:26:00,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 09:26:00,044 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:26:00,044 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:26:00,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 09:26:00,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-24 09:26:00,246 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:26:00,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:26:00,246 INFO L85 PathProgramCache]: Analyzing trace with hash 60671004, now seen corresponding path program 1 times [2024-10-24 09:26:00,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:26:00,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078512404] [2024-10-24 09:26:00,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:26:00,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:26:00,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 09:26:00,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [366166397] [2024-10-24 09:26:00,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:26:00,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:26:00,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:26:00,283 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 09:26:00,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 09:26:00,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:26:00,380 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 09:26:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:26:00,478 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 09:26:00,479 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 09:26:00,479 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 09:26:00,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-24 09:26:00,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:26:00,684 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:26:00,742 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 09:26:00,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:26:00 BoogieIcfgContainer [2024-10-24 09:26:00,744 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 09:26:00,745 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 09:26:00,745 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 09:26:00,745 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 09:26:00,745 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:25:43" (3/4) ... [2024-10-24 09:26:00,747 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 09:26:00,747 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 09:26:00,748 INFO L158 Benchmark]: Toolchain (without parser) took 18007.26ms. Allocated memory was 199.2MB in the beginning and 513.8MB in the end (delta: 314.6MB). Free memory was 168.7MB in the beginning and 231.4MB in the end (delta: -62.7MB). Peak memory consumption was 252.6MB. Max. memory is 16.1GB. [2024-10-24 09:26:00,748 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 127.9MB. Free memory was 89.0MB in the beginning and 88.9MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:26:00,748 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.87ms. Allocated memory is still 199.2MB. Free memory was 168.7MB in the beginning and 154.2MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 09:26:00,748 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.96ms. Allocated memory is still 199.2MB. Free memory was 154.2MB in the beginning and 150.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 09:26:00,748 INFO L158 Benchmark]: Boogie Preprocessor took 45.92ms. Allocated memory is still 199.2MB. Free memory was 150.0MB in the beginning and 145.3MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 09:26:00,749 INFO L158 Benchmark]: RCFGBuilder took 470.56ms. Allocated memory is still 199.2MB. Free memory was 145.3MB in the beginning and 118.5MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-24 09:26:00,749 INFO L158 Benchmark]: TraceAbstraction took 17189.06ms. Allocated memory was 199.2MB in the beginning and 513.8MB in the end (delta: 314.6MB). Free memory was 118.0MB in the beginning and 232.4MB in the end (delta: -114.4MB). Peak memory consumption was 200.1MB. Max. memory is 16.1GB. [2024-10-24 09:26:00,749 INFO L158 Benchmark]: Witness Printer took 2.79ms. Allocated memory is still 513.8MB. Free memory was 232.4MB in the beginning and 231.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 09:26:00,750 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 127.9MB. Free memory was 89.0MB in the beginning and 88.9MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 242.87ms. Allocated memory is still 199.2MB. Free memory was 168.7MB in the beginning and 154.2MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.96ms. Allocated memory is still 199.2MB. Free memory was 154.2MB in the beginning and 150.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.92ms. Allocated memory is still 199.2MB. Free memory was 150.0MB in the beginning and 145.3MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 470.56ms. Allocated memory is still 199.2MB. Free memory was 145.3MB in the beginning and 118.5MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 17189.06ms. Allocated memory was 199.2MB in the beginning and 513.8MB in the end (delta: 314.6MB). Free memory was 118.0MB in the beginning and 232.4MB in the end (delta: -114.4MB). Peak memory consumption was 200.1MB. Max. memory is 16.1GB. * Witness Printer took 2.79ms. Allocated memory is still 513.8MB. Free memory was 232.4MB in the beginning and 231.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned short int var_1_3 = 128; [L24] unsigned short int var_1_4 = 4; [L25] unsigned short int var_1_5 = 0; [L26] signed short int var_1_6 = 0; [L27] unsigned char var_1_7 = 1; [L28] signed short int var_1_8 = -2; [L29] signed short int var_1_9 = 500; [L30] unsigned long int var_1_10 = 10; [L31] unsigned char var_1_11 = 2; [L32] unsigned char var_1_12 = 64; [L33] unsigned long int var_1_13 = 1; [L34] unsigned long int last_1_var_1_10 = 10; [L35] unsigned long int last_1_var_1_13 = 1; [L94] isInitial = 1 [L95] FCALL initially() [L96] int k_loop; [L97] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=128, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L97] COND TRUE k_loop < 1 [L98] CALL updateLastVariables() [L86] last_1_var_1_10 = var_1_10 [L87] last_1_var_1_13 = var_1_13 [L98] RET updateLastVariables() [L99] CALL updateVariables() [L60] var_1_3 = __VERIFIER_nondet_ushort() [L61] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L61] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L62] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L62] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L63] var_1_4 = __VERIFIER_nondet_ushort() [L64] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L64] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L65] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L65] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L66] var_1_5 = __VERIFIER_nondet_ushort() [L67] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L67] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L68] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L68] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L69] var_1_7 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_8=-2, var_1_9=500] [L70] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_8=-2, var_1_9=500] [L71] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L71] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-2, var_1_9=500] [L72] var_1_8 = __VERIFIER_nondet_short() [L73] CALL assume_abort_if_not(var_1_8 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=500] [L73] RET assume_abort_if_not(var_1_8 >= -16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=500] [L74] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=500] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=500] [L74] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=500] [L75] var_1_9 = __VERIFIER_nondet_short() [L76] CALL assume_abort_if_not(var_1_9 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L76] RET assume_abort_if_not(var_1_9 >= -16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L77] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L77] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=2, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L78] var_1_11 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L79] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L80] CALL assume_abort_if_not(var_1_11 <= 128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L80] RET assume_abort_if_not(var_1_11 <= 128) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=64, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L81] var_1_12 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L82] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L83] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L83] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L99] RET updateVariables() [L100] CALL step() [L39] COND FALSE !(last_1_var_1_13 >= -50) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L42] EXPR var_1_11 & var_1_12 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=1, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L42] signed long int stepLocal_0 = var_1_11 & var_1_12; [L43] COND TRUE \read(var_1_7) [L44] var_1_13 = ((((var_1_11) > (var_1_1)) ? (var_1_11) : (var_1_1))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=127, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L50] COND TRUE \read(var_1_7) [L51] var_1_6 = (var_1_8 + var_1_9) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=127, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L53] EXPR last_1_var_1_10 >> var_1_1 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=127, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L53] EXPR var_1_8 << var_1_5 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=127, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L53] EXPR (last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=127, var_1_10=10, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L53] COND TRUE (var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5)) [L54] var_1_10 = ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, stepLocal_0=127, var_1_10=0, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L100] RET step() [L101] CALL, EXPR property() [L90] EXPR (((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=0, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L90] EXPR last_1_var_1_10 >> var_1_1 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=0, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L90] EXPR var_1_8 << var_1_5 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=0, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L90] EXPR (last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=0, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L90] EXPR (((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=0, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L90] EXPR ((((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11)))) && (var_1_7 ? (var_1_13 == ((unsigned long int) ((((var_1_11) > (var_1_1)) ? (var_1_11) : (var_1_1))))) : (((var_1_11 & var_1_12) != var_1_1) ? (var_1_13 == ((unsigned long int) var_1_12)) : 1)) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=0, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L90-L91] return ((((last_1_var_1_13 >= -50) ? (var_1_1 == ((unsigned short int) (((((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) > (var_1_5)) ? ((var_1_3 + ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5))))) : 1) && (var_1_7 ? (var_1_6 == ((signed short int) (var_1_8 + var_1_9))) : 1)) && (((var_1_6 / (var_1_11 + var_1_12)) != ((last_1_var_1_10 >> var_1_1) ^ (var_1_8 << var_1_5))) ? (var_1_10 == ((unsigned long int) ((((var_1_12) < (var_1_4)) ? (var_1_12) : (var_1_4))))) : (var_1_10 == ((unsigned long int) var_1_11)))) && (var_1_7 ? (var_1_13 == ((unsigned long int) ((((var_1_11) > (var_1_1)) ? (var_1_11) : (var_1_1))))) : (((var_1_11 & var_1_12) != var_1_1) ? (var_1_13 == ((unsigned long int) var_1_12)) : 1)) ; [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=0, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_13=1, var_1_10=0, var_1_11=127, var_1_12=127, var_1_13=127, var_1_1=0, var_1_3=0, var_1_4=-65536, var_1_5=1, var_1_6=0, var_1_7=1, var_1_8=-1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.1s, OverallIterations: 19, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1824 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1811 mSDsluCounter, 8067 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6077 mSDsCounter, 383 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3066 IncrementalHoareTripleChecker+Invalid, 3449 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 383 mSolverCounterUnsat, 1990 mSDtfsCounter, 3066 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 994 GetRequests, 858 SyntacticMatches, 2 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2501occurred in iteration=14, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 1918 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 2355 NumberOfCodeBlocks, 2355 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2218 ConstructedInterpolants, 0 QuantifiedInterpolants, 9054 SizeOfPredicates, 1 NumberOfNonLiveVariables, 262 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 20 InterpolantComputations, 17 PerfectInterpolantSequences, 9570/9600 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 09:26:00,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-32.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d4efba5d8035d5b89a6fee2af18255a7435db1834e066c2b81c99247161e78c7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:26:02,619 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:26:02,684 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 09:26:02,689 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:26:02,690 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:26:02,707 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:26:02,707 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:26:02,707 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:26:02,708 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:26:02,708 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:26:02,708 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:26:02,708 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:26:02,709 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:26:02,709 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:26:02,709 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:26:02,709 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:26:02,710 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:26:02,710 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:26:02,710 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:26:02,710 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:26:02,710 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:26:02,711 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:26:02,711 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:26:02,711 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 09:26:02,712 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 09:26:02,712 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:26:02,712 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 09:26:02,712 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:26:02,713 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:26:02,713 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:26:02,713 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:26:02,713 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:26:02,713 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:26:02,714 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:26:02,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:26:02,714 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:26:02,714 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:26:02,714 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:26:02,715 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 09:26:02,715 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 09:26:02,715 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:26:02,715 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:26:02,716 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:26:02,716 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:26:02,716 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 09:26:02,716 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d4efba5d8035d5b89a6fee2af18255a7435db1834e066c2b81c99247161e78c7 [2024-10-24 09:26:02,950 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:26:02,968 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:26:02,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:26:02,971 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:26:02,971 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:26:02,973 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-32.i [2024-10-24 09:26:04,226 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:26:04,389 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:26:04,389 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-32.i [2024-10-24 09:26:04,398 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53c5dc126/323d7c8a48764446bfb7faa98a52b442/FLAGb170283c1 [2024-10-24 09:26:04,413 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53c5dc126/323d7c8a48764446bfb7faa98a52b442 [2024-10-24 09:26:04,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:26:04,418 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:26:04,418 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:26:04,419 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:26:04,424 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:26:04,424 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:26:04" (1/1) ... [2024-10-24 09:26:04,425 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dafcedf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:26:04, skipping insertion in model container [2024-10-24 09:26:04,428 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:26:04" (1/1) ... [2024-10-24 09:26:04,448 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:26:04,599 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-32.i[915,928] [2024-10-24 09:26:04,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:26:04,656 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:26:04,669 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-32.i[915,928] [2024-10-24 09:26:04,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:26:04,708 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:26:04,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:26:04 WrapperNode [2024-10-24 09:26:04,709 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:26:04,710 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:26:04,710 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:26:04,710 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:26:04,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:26:04" (1/1) ... [2024-10-24 09:26:04,728 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:26:04" (1/1) ... [2024-10-24 09:26:04,751 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-10-24 09:26:04,753 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:26:04,753 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:26:04,753 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:26:04,753 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:26:04,762 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:26:04" (1/1) ... [2024-10-24 09:26:04,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:26:04" (1/1) ... [2024-10-24 09:26:04,765 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:26:04" (1/1) ... [2024-10-24 09:26:04,774 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 09:26:04,774 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:26:04" (1/1) ... [2024-10-24 09:26:04,774 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:26:04" (1/1) ... [2024-10-24 09:26:04,779 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:26:04" (1/1) ... [2024-10-24 09:26:04,785 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:26:04" (1/1) ... [2024-10-24 09:26:04,787 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:26:04" (1/1) ... [2024-10-24 09:26:04,790 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:26:04" (1/1) ... [2024-10-24 09:26:04,792 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:26:04,797 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:26:04,797 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:26:04,797 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:26:04,798 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:26:04" (1/1) ... [2024-10-24 09:26:04,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:26:04,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:26:04,825 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 09:26:04,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 09:26:04,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:26:04,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 09:26:04,864 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:26:04,864 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:26:04,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:26:04,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:26:04,927 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:26:04,929 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:26:05,192 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-24 09:26:05,192 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:26:05,248 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:26:05,248 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:26:05,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:26:05 BoogieIcfgContainer [2024-10-24 09:26:05,249 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:26:05,251 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:26:05,251 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:26:05,255 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:26:05,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:26:04" (1/3) ... [2024-10-24 09:26:05,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b653e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:26:05, skipping insertion in model container [2024-10-24 09:26:05,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:26:04" (2/3) ... [2024-10-24 09:26:05,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b653e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:26:05, skipping insertion in model container [2024-10-24 09:26:05,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:26:05" (3/3) ... [2024-10-24 09:26:05,258 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-32.i [2024-10-24 09:26:05,273 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:26:05,273 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:26:05,333 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:26:05,340 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@430e7aa2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:26:05,341 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:26:05,344 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 09:26:05,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 09:26:05,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:26:05,354 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:26:05,355 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:26:05,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:26:05,361 INFO L85 PathProgramCache]: Analyzing trace with hash 658397701, now seen corresponding path program 1 times [2024-10-24 09:26:05,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:26:05,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [31655530] [2024-10-24 09:26:05,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:26:05,377 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:26:05,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:26:05,381 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 09:26:05,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 09:26:05,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:26:05,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 09:26:05,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:26:05,555 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-10-24 09:26:05,555 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:26:05,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:26:05,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [31655530] [2024-10-24 09:26:05,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [31655530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:26:05,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:26:05,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:26:05,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135665828] [2024-10-24 09:26:05,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:26:05,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:26:05,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:26:05,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:26:05,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:26:05,585 INFO L87 Difference]: Start difference. First operand has 43 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 09:26:05,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:26:05,628 INFO L93 Difference]: Finished difference Result 85 states and 147 transitions. [2024-10-24 09:26:05,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:26:05,631 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 98 [2024-10-24 09:26:05,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:26:05,636 INFO L225 Difference]: With dead ends: 85 [2024-10-24 09:26:05,637 INFO L226 Difference]: Without dead ends: 41 [2024-10-24 09:26:05,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:26:05,642 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:26:05,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:26:05,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-24 09:26:05,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-24 09:26:05,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 09:26:05,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 61 transitions. [2024-10-24 09:26:05,675 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 61 transitions. Word has length 98 [2024-10-24 09:26:05,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:26:05,676 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 61 transitions. [2024-10-24 09:26:05,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 09:26:05,677 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 61 transitions. [2024-10-24 09:26:05,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 09:26:05,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:26:05,682 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:26:05,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 09:26:05,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:26:05,883 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:26:05,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:26:05,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1731495419, now seen corresponding path program 1 times [2024-10-24 09:26:05,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:26:05,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1434729738] [2024-10-24 09:26:05,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:26:05,884 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:26:05,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:26:05,887 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 09:26:05,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 09:26:05,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:26:05,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 09:26:05,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:26:06,172 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 09:26:06,173 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:26:06,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:26:06,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1434729738] [2024-10-24 09:26:06,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1434729738] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:26:06,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:26:06,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:26:06,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623956045] [2024-10-24 09:26:06,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:26:06,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 09:26:06,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:26:06,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 09:26:06,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 09:26:06,190 INFO L87 Difference]: Start difference. First operand 41 states and 61 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 09:26:06,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:26:06,304 INFO L93 Difference]: Finished difference Result 129 states and 191 transitions. [2024-10-24 09:26:06,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 09:26:06,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 98 [2024-10-24 09:26:06,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:26:06,306 INFO L225 Difference]: With dead ends: 129 [2024-10-24 09:26:06,306 INFO L226 Difference]: Without dead ends: 89 [2024-10-24 09:26:06,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 09:26:06,308 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 40 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:26:06,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 173 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:26:06,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-24 09:26:06,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2024-10-24 09:26:06,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 09:26:06,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 119 transitions. [2024-10-24 09:26:06,335 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 119 transitions. Word has length 98 [2024-10-24 09:26:06,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:26:06,336 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 119 transitions. [2024-10-24 09:26:06,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-24 09:26:06,336 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 119 transitions. [2024-10-24 09:26:06,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 09:26:06,337 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:26:06,337 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:26:06,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 09:26:06,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:26:06,538 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:26:06,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:26:06,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1754125251, now seen corresponding path program 1 times [2024-10-24 09:26:06,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:26:06,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [543507399] [2024-10-24 09:26:06,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:26:06,540 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:26:06,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:26:06,542 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 09:26:06,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 09:26:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:26:06,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 09:26:06,631 INFO L278 TraceCheckSpWp]: Computing forward predicates...