./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_codestructure_steplocals_file-16.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-16.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 da982387660185d291ba506664c590935ec691dede2a6c22408e1c80bc2337b3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:29:09,362 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:29:09,447 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 07:29:09,452 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:29:09,454 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:29:09,483 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:29:09,485 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:29:09,485 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:29:09,486 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:29:09,487 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:29:09,488 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:29:09,488 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:29:09,488 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:29:09,490 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:29:09,490 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:29:09,491 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:29:09,491 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:29:09,491 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:29:09,492 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 07:29:09,492 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:29:09,492 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:29:09,496 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:29:09,496 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:29:09,496 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:29:09,497 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:29:09,497 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:29:09,497 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:29:09,497 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:29:09,498 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:29:09,498 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:29:09,498 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:29:09,499 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:29:09,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:29:09,499 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:29:09,500 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:29:09,500 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:29:09,500 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 07:29:09,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 07:29:09,501 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:29:09,501 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:29:09,501 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:29:09,503 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:29:09,503 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-clean/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-clean/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 -> da982387660185d291ba506664c590935ec691dede2a6c22408e1c80bc2337b3 [2024-10-11 07:29:09,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:29:09,801 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:29:09,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:29:09,805 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:29:09,806 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:29:09,807 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-16.i [2024-10-11 07:29:11,342 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:29:11,572 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:29:11,573 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-16.i [2024-10-11 07:29:11,588 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0718a0dfa/3bc28620b99147a59dbfba9fa3f769ce/FLAG50b132b3f [2024-10-11 07:29:11,916 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0718a0dfa/3bc28620b99147a59dbfba9fa3f769ce [2024-10-11 07:29:11,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:29:11,920 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:29:11,922 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:29:11,922 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:29:11,929 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:29:11,930 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:29:11" (1/1) ... [2024-10-11 07:29:11,931 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66054743 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:11, skipping insertion in model container [2024-10-11 07:29:11,933 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:29:11" (1/1) ... [2024-10-11 07:29:11,965 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:29:12,124 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_codestructure_steplocals_file-16.i[917,930] [2024-10-11 07:29:12,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:29:12,226 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:29:12,240 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_codestructure_steplocals_file-16.i[917,930] [2024-10-11 07:29:12,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:29:12,306 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:29:12,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:12 WrapperNode [2024-10-11 07:29:12,307 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:29:12,309 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:29:12,309 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:29:12,309 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:29:12,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:12" (1/1) ... [2024-10-11 07:29:12,328 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:12" (1/1) ... [2024-10-11 07:29:12,366 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 188 [2024-10-11 07:29:12,368 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:29:12,369 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:29:12,369 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:29:12,369 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:29:12,379 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:12" (1/1) ... [2024-10-11 07:29:12,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:12" (1/1) ... [2024-10-11 07:29:12,382 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:12" (1/1) ... [2024-10-11 07:29:12,398 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-11 07:29:12,399 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:12" (1/1) ... [2024-10-11 07:29:12,399 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:12" (1/1) ... [2024-10-11 07:29:12,407 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:12" (1/1) ... [2024-10-11 07:29:12,410 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:12" (1/1) ... [2024-10-11 07:29:12,412 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:12" (1/1) ... [2024-10-11 07:29:12,414 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:12" (1/1) ... [2024-10-11 07:29:12,417 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:29:12,418 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:29:12,418 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:29:12,419 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:29:12,419 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:12" (1/1) ... [2024-10-11 07:29:12,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:29:12,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:29:12,456 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:29:12,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:29:12,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:29:12,504 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:29:12,506 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:29:12,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 07:29:12,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:29:12,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:29:12,615 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:29:12,620 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:29:12,977 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-11 07:29:12,977 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:29:13,030 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:29:13,031 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:29:13,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:29:13 BoogieIcfgContainer [2024-10-11 07:29:13,032 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:29:13,034 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:29:13,034 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:29:13,038 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:29:13,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:29:11" (1/3) ... [2024-10-11 07:29:13,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7648671d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:29:13, skipping insertion in model container [2024-10-11 07:29:13,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:12" (2/3) ... [2024-10-11 07:29:13,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7648671d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:29:13, skipping insertion in model container [2024-10-11 07:29:13,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:29:13" (3/3) ... [2024-10-11 07:29:13,042 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-16.i [2024-10-11 07:29:13,058 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:29:13,058 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:29:13,121 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:29:13,127 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;@1616be92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:29:13,128 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:29:13,131 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 50 states have internal predecessors, (70), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 07:29:13,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-11 07:29:13,143 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:29:13,144 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:29:13,144 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:29:13,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:29:13,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1379691845, now seen corresponding path program 1 times [2024-10-11 07:29:13,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:29:13,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281218753] [2024-10-11 07:29:13,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:29:13,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:29:13,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:13,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:29:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:13,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:29:13,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:13,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:29:13,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:13,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:29:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:13,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:29:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:13,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:29:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:13,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:29:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:13,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:29:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:13,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:29:13,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:13,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:29:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:13,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:29:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:13,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:29:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:13,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:29:13,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:13,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:29:13,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:13,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:29:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:13,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 07:29:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:13,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:29:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:13,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 07:29:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:13,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:29:13,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:13,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 07:29:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:13,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 07:29:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:13,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 07:29:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:13,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 07:29:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:13,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 07:29:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:13,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 07:29:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:13,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 07:29:13,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:13,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 07:29:13,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:29:13,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281218753] [2024-10-11 07:29:13,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281218753] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:29:13,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:29:13,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:29:13,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097610808] [2024-10-11 07:29:13,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:29:13,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:29:13,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:29:13,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:29:13,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:29:13,700 INFO L87 Difference]: Start difference. First operand has 78 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 50 states have internal predecessors, (70), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 07:29:13,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:29:13,756 INFO L93 Difference]: Finished difference Result 153 states and 268 transitions. [2024-10-11 07:29:13,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:29:13,758 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 165 [2024-10-11 07:29:13,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:29:13,767 INFO L225 Difference]: With dead ends: 153 [2024-10-11 07:29:13,767 INFO L226 Difference]: Without dead ends: 76 [2024-10-11 07:29:13,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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-11 07:29:13,775 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:29:13,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:29:13,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-11 07:29:13,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-11 07:29:13,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 07:29:13,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 117 transitions. [2024-10-11 07:29:13,837 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 117 transitions. Word has length 165 [2024-10-11 07:29:13,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:29:13,837 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 117 transitions. [2024-10-11 07:29:13,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 07:29:13,839 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 117 transitions. [2024-10-11 07:29:13,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-11 07:29:13,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:29:13,845 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:29:13,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 07:29:13,845 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:29:13,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:29:13,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1000846733, now seen corresponding path program 1 times [2024-10-11 07:29:13,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:29:13,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195258970] [2024-10-11 07:29:13,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:29:13,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:29:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:16,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:29:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:16,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:29:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:16,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:29:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:16,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:29:16,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:16,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:29:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:16,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:29:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:16,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:29:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:16,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:29:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:16,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:29:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:16,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:29:16,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:16,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:29:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:16,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:29:16,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:16,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:29:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:16,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:29:16,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:16,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:29:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:16,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 07:29:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:16,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:29:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:16,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 07:29:16,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:16,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:29:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:16,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 07:29:16,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:16,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 07:29:16,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:16,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 07:29:16,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:16,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 07:29:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:16,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 07:29:16,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:16,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 07:29:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:16,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 07:29:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:16,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 07:29:16,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:29:16,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195258970] [2024-10-11 07:29:16,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195258970] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:29:16,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:29:16,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 07:29:16,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955477906] [2024-10-11 07:29:16,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:29:16,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 07:29:16,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:29:16,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 07:29:16,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 07:29:16,777 INFO L87 Difference]: Start difference. First operand 76 states and 117 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 07:29:17,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:29:17,141 INFO L93 Difference]: Finished difference Result 205 states and 314 transitions. [2024-10-11 07:29:17,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 07:29:17,142 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 165 [2024-10-11 07:29:17,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:29:17,145 INFO L225 Difference]: With dead ends: 205 [2024-10-11 07:29:17,145 INFO L226 Difference]: Without dead ends: 130 [2024-10-11 07:29:17,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 07:29:17,147 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 92 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 07:29:17,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 417 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 07:29:17,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-11 07:29:17,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 94. [2024-10-11 07:29:17,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 66 states have internal predecessors, (94), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 07:29:17,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 146 transitions. [2024-10-11 07:29:17,164 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 146 transitions. Word has length 165 [2024-10-11 07:29:17,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:29:17,166 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 146 transitions. [2024-10-11 07:29:17,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 07:29:17,167 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 146 transitions. [2024-10-11 07:29:17,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-11 07:29:17,169 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:29:17,170 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:29:17,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 07:29:17,170 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:29:17,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:29:17,171 INFO L85 PathProgramCache]: Analyzing trace with hash -2021915087, now seen corresponding path program 1 times [2024-10-11 07:29:17,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:29:17,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766554181] [2024-10-11 07:29:17,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:29:17,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:29:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:29:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:29:19,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:29:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:29:19,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:29:19,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:29:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:29:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:29:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:29:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:29:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:29:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:29:19,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:29:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:29:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:29:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 07:29:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:29:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 07:29:19,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:29:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 07:29:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 07:29:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 07:29:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 07:29:19,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 07:29:19,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 07:29:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 07:29:19,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 07:29:19,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:29:19,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766554181] [2024-10-11 07:29:19,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766554181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:29:19,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:29:19,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 07:29:19,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784800192] [2024-10-11 07:29:19,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:29:19,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 07:29:19,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:29:19,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 07:29:19,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 07:29:19,537 INFO L87 Difference]: Start difference. First operand 94 states and 146 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 07:29:19,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:29:19,743 INFO L93 Difference]: Finished difference Result 213 states and 330 transitions. [2024-10-11 07:29:19,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 07:29:19,744 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 165 [2024-10-11 07:29:19,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:29:19,746 INFO L225 Difference]: With dead ends: 213 [2024-10-11 07:29:19,746 INFO L226 Difference]: Without dead ends: 120 [2024-10-11 07:29:19,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-11 07:29:19,748 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 108 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:29:19,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 336 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:29:19,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-11 07:29:19,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 94. [2024-10-11 07:29:19,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 66 states have internal predecessors, (94), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 07:29:19,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 146 transitions. [2024-10-11 07:29:19,761 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 146 transitions. Word has length 165 [2024-10-11 07:29:19,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:29:19,763 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 146 transitions. [2024-10-11 07:29:19,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 07:29:19,763 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 146 transitions. [2024-10-11 07:29:19,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 07:29:19,769 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:29:19,769 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:29:19,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 07:29:19,770 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:29:19,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:29:19,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1188045802, now seen corresponding path program 1 times [2024-10-11 07:29:19,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:29:19,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358947155] [2024-10-11 07:29:19,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:29:19,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:29:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:29:19,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:29:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:29:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:29:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:29:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:29:19,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:29:19,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:29:19,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:29:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:29:19,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:29:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:29:19,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:29:19,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:29:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:29:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 07:29:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:29:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 07:29:19,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:29:19,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 07:29:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 07:29:19,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 07:29:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 07:29:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 07:29:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 07:29:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 07:29:19,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:19,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 07:29:19,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:29:19,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358947155] [2024-10-11 07:29:19,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358947155] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:29:19,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:29:19,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:29:19,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053831328] [2024-10-11 07:29:19,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:29:19,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:29:19,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:29:19,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:29:19,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:29:19,885 INFO L87 Difference]: Start difference. First operand 94 states and 146 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 07:29:19,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:29:19,938 INFO L93 Difference]: Finished difference Result 234 states and 360 transitions. [2024-10-11 07:29:19,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:29:19,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 166 [2024-10-11 07:29:19,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:29:19,941 INFO L225 Difference]: With dead ends: 234 [2024-10-11 07:29:19,941 INFO L226 Difference]: Without dead ends: 141 [2024-10-11 07:29:19,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 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-11 07:29:19,943 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 39 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:29:19,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 243 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:29:19,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-11 07:29:19,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 138. [2024-10-11 07:29:19,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 106 states have internal predecessors, (150), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 07:29:19,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 210 transitions. [2024-10-11 07:29:19,956 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 210 transitions. Word has length 166 [2024-10-11 07:29:19,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:29:19,957 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 210 transitions. [2024-10-11 07:29:19,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 07:29:19,957 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 210 transitions. [2024-10-11 07:29:19,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 07:29:19,959 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:29:19,959 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:29:19,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 07:29:19,960 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:29:19,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:29:19,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1130787500, now seen corresponding path program 1 times [2024-10-11 07:29:19,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:29:19,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967991295] [2024-10-11 07:29:19,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:29:19,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:29:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:23,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:29:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:23,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:29:23,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:23,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:29:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:23,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:29:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:23,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:29:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:23,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:29:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:23,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:29:23,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:23,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:29:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:23,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:29:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:23,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:29:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:23,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:29:23,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:23,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:29:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:23,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:29:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:23,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:29:23,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:23,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:29:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:23,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 07:29:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:23,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:29:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:23,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 07:29:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:23,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:29:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:23,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 07:29:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:23,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 07:29:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:23,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 07:29:23,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:23,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 07:29:23,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:23,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 07:29:23,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:23,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 07:29:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:24,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 07:29:24,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:24,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 07:29:24,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:29:24,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967991295] [2024-10-11 07:29:24,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967991295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:29:24,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:29:24,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 07:29:24,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112619353] [2024-10-11 07:29:24,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:29:24,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 07:29:24,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:29:24,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 07:29:24,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 07:29:24,007 INFO L87 Difference]: Start difference. First operand 138 states and 210 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 07:29:24,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:29:24,595 INFO L93 Difference]: Finished difference Result 320 states and 482 transitions. [2024-10-11 07:29:24,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 07:29:24,596 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 166 [2024-10-11 07:29:24,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:29:24,599 INFO L225 Difference]: With dead ends: 320 [2024-10-11 07:29:24,599 INFO L226 Difference]: Without dead ends: 183 [2024-10-11 07:29:24,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-11 07:29:24,601 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 86 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 07:29:24,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 444 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 07:29:24,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-11 07:29:24,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 145. [2024-10-11 07:29:24,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 112 states have (on average 1.4375) internal successors, (161), 113 states have internal predecessors, (161), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 07:29:24,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 221 transitions. [2024-10-11 07:29:24,627 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 221 transitions. Word has length 166 [2024-10-11 07:29:24,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:29:24,628 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 221 transitions. [2024-10-11 07:29:24,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 07:29:24,628 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 221 transitions. [2024-10-11 07:29:24,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 07:29:24,630 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:29:24,630 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:29:24,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 07:29:24,631 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:29:24,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:29:24,631 INFO L85 PathProgramCache]: Analyzing trace with hash 2143111442, now seen corresponding path program 1 times [2024-10-11 07:29:24,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:29:24,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993372630] [2024-10-11 07:29:24,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:29:24,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:29:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:25,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:29:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:25,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:29:25,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:25,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:29:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:25,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:29:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:25,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:29:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:25,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:29:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:25,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:29:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:25,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:29:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:25,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:29:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:25,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:29:25,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:25,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:29:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:25,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:29:25,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:25,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:29:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:25,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:29:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:25,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:29:25,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:25,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 07:29:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:25,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:29:25,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:25,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 07:29:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:25,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:29:25,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:25,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 07:29:25,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:25,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 07:29:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:25,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 07:29:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:25,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 07:29:25,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:25,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 07:29:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:25,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 07:29:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:25,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 07:29:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:25,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 07:29:25,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:29:25,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993372630] [2024-10-11 07:29:25,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993372630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:29:25,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:29:25,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 07:29:25,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303561960] [2024-10-11 07:29:25,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:29:25,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 07:29:25,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:29:25,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 07:29:25,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 07:29:25,177 INFO L87 Difference]: Start difference. First operand 145 states and 221 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 07:29:25,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:29:25,416 INFO L93 Difference]: Finished difference Result 327 states and 493 transitions. [2024-10-11 07:29:25,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 07:29:25,417 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 166 [2024-10-11 07:29:25,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:29:25,419 INFO L225 Difference]: With dead ends: 327 [2024-10-11 07:29:25,419 INFO L226 Difference]: Without dead ends: 183 [2024-10-11 07:29:25,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-11 07:29:25,420 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 62 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:29:25,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 425 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:29:25,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-11 07:29:25,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 138. [2024-10-11 07:29:25,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 106 states have internal predecessors, (150), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 07:29:25,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 210 transitions. [2024-10-11 07:29:25,442 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 210 transitions. Word has length 166 [2024-10-11 07:29:25,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:29:25,442 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 210 transitions. [2024-10-11 07:29:25,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 07:29:25,443 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 210 transitions. [2024-10-11 07:29:25,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 07:29:25,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:29:25,444 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:29:25,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 07:29:25,445 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:29:25,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:29:25,445 INFO L85 PathProgramCache]: Analyzing trace with hash 806098904, now seen corresponding path program 1 times [2024-10-11 07:29:25,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:29:25,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611614832] [2024-10-11 07:29:25,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:29:25,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:29:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:26,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:29:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:26,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:29:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:26,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:29:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:26,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:29:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:26,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:29:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:26,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:29:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:26,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:29:26,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:26,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:29:26,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:26,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:29:26,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:26,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:29:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:26,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:29:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:26,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:29:26,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:26,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:29:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:26,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:29:26,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:26,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:29:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:26,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 07:29:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:26,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:29:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:26,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 07:29:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:26,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:29:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:26,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 07:29:26,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:26,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 07:29:26,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:26,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 07:29:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:26,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 07:29:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:26,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 07:29:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:26,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 07:29:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:26,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 07:29:26,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:26,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 07:29:26,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:29:26,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611614832] [2024-10-11 07:29:26,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611614832] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:29:26,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:29:26,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 07:29:26,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235546493] [2024-10-11 07:29:26,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:29:26,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 07:29:26,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:29:26,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 07:29:26,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 07:29:26,925 INFO L87 Difference]: Start difference. First operand 138 states and 210 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 07:29:27,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:29:27,319 INFO L93 Difference]: Finished difference Result 321 states and 481 transitions. [2024-10-11 07:29:27,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 07:29:27,319 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 166 [2024-10-11 07:29:27,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:29:27,321 INFO L225 Difference]: With dead ends: 321 [2024-10-11 07:29:27,321 INFO L226 Difference]: Without dead ends: 184 [2024-10-11 07:29:27,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 07:29:27,324 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 154 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 07:29:27,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 556 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 07:29:27,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-10-11 07:29:27,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 142. [2024-10-11 07:29:27,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 109 states have (on average 1.4128440366972477) internal successors, (154), 110 states have internal predecessors, (154), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 07:29:27,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 214 transitions. [2024-10-11 07:29:27,338 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 214 transitions. Word has length 166 [2024-10-11 07:29:27,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:29:27,339 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 214 transitions. [2024-10-11 07:29:27,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 07:29:27,340 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 214 transitions. [2024-10-11 07:29:27,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 07:29:27,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:29:27,342 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:29:27,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 07:29:27,343 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:29:27,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:29:27,343 INFO L85 PathProgramCache]: Analyzing trace with hash -214969450, now seen corresponding path program 1 times [2024-10-11 07:29:27,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:29:27,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011785711] [2024-10-11 07:29:27,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:29:27,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:29:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:28,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:29:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:28,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:29:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:28,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:29:28,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:28,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:29:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:28,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:29:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:28,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:29:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:28,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:29:28,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:28,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:29:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:28,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:29:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:28,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:29:28,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:28,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:29:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:28,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:29:28,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:28,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:29:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:28,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:29:28,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:28,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:29:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:28,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 07:29:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:28,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:29:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:28,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 07:29:28,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:28,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:29:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:28,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 07:29:28,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:28,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 07:29:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:28,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 07:29:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:28,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 07:29:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:28,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 07:29:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:28,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 07:29:28,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:28,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 07:29:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:28,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 07:29:28,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:29:28,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011785711] [2024-10-11 07:29:28,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011785711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:29:28,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:29:28,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 07:29:28,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628004465] [2024-10-11 07:29:28,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:29:28,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 07:29:28,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:29:28,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 07:29:28,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 07:29:28,342 INFO L87 Difference]: Start difference. First operand 142 states and 214 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 07:29:28,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:29:28,658 INFO L93 Difference]: Finished difference Result 315 states and 468 transitions. [2024-10-11 07:29:28,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 07:29:28,659 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 166 [2024-10-11 07:29:28,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:29:28,662 INFO L225 Difference]: With dead ends: 315 [2024-10-11 07:29:28,663 INFO L226 Difference]: Without dead ends: 174 [2024-10-11 07:29:28,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-11 07:29:28,664 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 65 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 07:29:28,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 545 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 07:29:28,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-10-11 07:29:28,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 126. [2024-10-11 07:29:28,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 94 states have internal predecessors, (129), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 07:29:28,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 189 transitions. [2024-10-11 07:29:28,679 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 189 transitions. Word has length 166 [2024-10-11 07:29:28,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:29:28,680 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 189 transitions. [2024-10-11 07:29:28,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 07:29:28,680 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 189 transitions. [2024-10-11 07:29:28,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-11 07:29:28,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:29:28,682 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:29:28,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 07:29:28,683 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:29:28,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:29:28,683 INFO L85 PathProgramCache]: Analyzing trace with hash -263012392, now seen corresponding path program 1 times [2024-10-11 07:29:28,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:29:28,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972367424] [2024-10-11 07:29:28,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:29:28,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:29:28,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 07:29:28,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1443726021] [2024-10-11 07:29:28,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:29:28,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:29:28,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:29:28,739 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 07:29:28,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 07:29:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:29:29,015 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 07:29:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:29:29,167 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 07:29:29,168 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 07:29:29,169 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 07:29:29,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 07:29:29,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:29:29,374 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:29:29,510 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 07:29:29,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:29:29 BoogieIcfgContainer [2024-10-11 07:29:29,515 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 07:29:29,515 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 07:29:29,515 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 07:29:29,515 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 07:29:29,516 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:29:13" (3/4) ... [2024-10-11 07:29:29,518 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 07:29:29,519 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 07:29:29,519 INFO L158 Benchmark]: Toolchain (without parser) took 17598.75ms. Allocated memory was 190.8MB in the beginning and 583.0MB in the end (delta: 392.2MB). Free memory was 121.7MB in the beginning and 411.3MB in the end (delta: -289.6MB). Peak memory consumption was 102.9MB. Max. memory is 16.1GB. [2024-10-11 07:29:29,519 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory was 79.5MB in the beginning and 79.4MB in the end (delta: 140.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:29:29,519 INFO L158 Benchmark]: CACSL2BoogieTranslator took 385.41ms. Allocated memory is still 190.8MB. Free memory was 121.4MB in the beginning and 106.0MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 07:29:29,520 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.75ms. Allocated memory is still 190.8MB. Free memory was 106.0MB in the beginning and 103.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 07:29:29,520 INFO L158 Benchmark]: Boogie Preprocessor took 48.62ms. Allocated memory is still 190.8MB. Free memory was 103.2MB in the beginning and 99.6MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 07:29:29,520 INFO L158 Benchmark]: RCFGBuilder took 613.47ms. Allocated memory is still 190.8MB. Free memory was 99.6MB in the beginning and 155.4MB in the end (delta: -55.8MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2024-10-11 07:29:29,520 INFO L158 Benchmark]: TraceAbstraction took 16481.11ms. Allocated memory was 190.8MB in the beginning and 583.0MB in the end (delta: 392.2MB). Free memory was 154.4MB in the beginning and 411.3MB in the end (delta: -257.0MB). Peak memory consumption was 137.2MB. Max. memory is 16.1GB. [2024-10-11 07:29:29,520 INFO L158 Benchmark]: Witness Printer took 3.60ms. Allocated memory is still 583.0MB. Free memory is still 411.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:29:29,522 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.17ms. Allocated memory is still 117.4MB. Free memory was 79.5MB in the beginning and 79.4MB in the end (delta: 140.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 385.41ms. Allocated memory is still 190.8MB. Free memory was 121.4MB in the beginning and 106.0MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.75ms. Allocated memory is still 190.8MB. Free memory was 106.0MB in the beginning and 103.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.62ms. Allocated memory is still 190.8MB. Free memory was 103.2MB in the beginning and 99.6MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 613.47ms. Allocated memory is still 190.8MB. Free memory was 99.6MB in the beginning and 155.4MB in the end (delta: -55.8MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. * TraceAbstraction took 16481.11ms. Allocated memory was 190.8MB in the beginning and 583.0MB in the end (delta: 392.2MB). Free memory was 154.4MB in the beginning and 411.3MB in the end (delta: -257.0MB). Peak memory consumption was 137.2MB. Max. memory is 16.1GB. * Witness Printer took 3.60ms. Allocated memory is still 583.0MB. Free memory is still 411.3MB. There was no memory consumed. 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 someBinaryFLOATComparisonOperation at line 139, overapproximation of someBinaryDOUBLEComparisonOperation at line 139, overapproximation of someUnaryFLOAToperation at line 87, overapproximation of someBinaryArithmeticFLOAToperation at line 87. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -50; [L23] signed short int var_1_2 = 10000; [L24] signed long int var_1_3 = 64; [L25] unsigned char var_1_4 = 0; [L26] signed short int var_1_5 = 8; [L27] signed short int var_1_6 = 64; [L28] unsigned short int var_1_7 = 8; [L29] unsigned short int var_1_8 = 256; [L30] signed long int var_1_9 = 2; [L31] signed long int var_1_10 = 1441729073; [L32] unsigned short int var_1_11 = 32; [L33] double var_1_12 = 7.6; [L34] double var_1_13 = 127.8; [L35] signed char var_1_14 = 32; [L36] signed char var_1_15 = 50; [L37] signed char var_1_16 = 0; [L38] signed char var_1_17 = 16; [L39] float var_1_18 = 0.4; [L40] unsigned char var_1_19 = 0; [L41] float var_1_20 = 24.4; [L42] float var_1_21 = 500.5; [L43] float var_1_22 = 99.324; [L44] unsigned short int var_1_23 = 128; [L143] isInitial = 1 [L144] FCALL initially() [L145] COND TRUE 1 [L146] FCALL updateLastVariables() [L147] CALL updateVariables() [L94] var_1_2 = __VERIFIER_nondet_short() [L95] CALL assume_abort_if_not(var_1_2 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=64, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=64, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L95] RET assume_abort_if_not(var_1_2 >= -32768) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=64, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L96] CALL assume_abort_if_not(var_1_2 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=64, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=64, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L96] RET assume_abort_if_not(var_1_2 <= 32767) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=64, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L97] var_1_3 = __VERIFIER_nondet_long() [L98] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L98] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L99] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L99] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L100] var_1_4 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L101] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L102] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L102] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L103] var_1_5 = __VERIFIER_nondet_short() [L104] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L104] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L105] CALL assume_abort_if_not(var_1_5 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L105] RET assume_abort_if_not(var_1_5 <= 32766) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L106] var_1_6 = __VERIFIER_nondet_short() [L107] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=256, var_1_9=2] [L107] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=256, var_1_9=2] [L108] CALL assume_abort_if_not(var_1_6 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=256, var_1_9=2] [L108] RET assume_abort_if_not(var_1_6 <= 32766) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=256, var_1_9=2] [L109] var_1_8 = __VERIFIER_nondet_ushort() [L110] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_9=2] [L110] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_9=2] [L111] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L111] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L112] var_1_10 = __VERIFIER_nondet_long() [L113] CALL assume_abort_if_not(var_1_10 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L113] RET assume_abort_if_not(var_1_10 >= 1073741823) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L114] CALL assume_abort_if_not(var_1_10 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L114] RET assume_abort_if_not(var_1_10 <= 2147483646) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L115] var_1_13 = __VERIFIER_nondet_double() [L116] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L116] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L117] var_1_15 = __VERIFIER_nondet_char() [L118] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L118] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L119] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L119] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L120] var_1_16 = __VERIFIER_nondet_char() [L121] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L121] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L122] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L122] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L123] var_1_17 = __VERIFIER_nondet_char() [L124] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L124] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L125] CALL assume_abort_if_not(var_1_17 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L125] RET assume_abort_if_not(var_1_17 <= 63) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L126] var_1_19 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L127] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L128] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L128] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L129] var_1_20 = __VERIFIER_nondet_float() [L130] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L130] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L131] var_1_21 = __VERIFIER_nondet_float() [L132] CALL assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L132] RET assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L133] var_1_22 = __VERIFIER_nondet_float() [L134] CALL assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L134] RET assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L147] RET updateVariables() [L148] CALL step() [L48] signed long int stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=2, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L49] COND FALSE !((var_1_2 / -50) >= stepLocal_0) [L56] var_1_1 = var_1_5 VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L58] signed short int stepLocal_1 = var_1_6; VAL [isInitial=1, stepLocal_1=4, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L59] COND TRUE var_1_2 < stepLocal_1 [L60] var_1_7 = (var_1_6 + var_1_8) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=5, var_1_8=1, var_1_9=2] [L62] COND FALSE !(var_1_6 > 128) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=5, var_1_8=1, var_1_9=2] [L65] signed long int stepLocal_2 = (var_1_7 + var_1_9) * var_1_3; VAL [isInitial=1, stepLocal_2=14, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=5, var_1_8=1, var_1_9=2] [L66] EXPR var_1_5 | var_1_6 VAL [isInitial=1, stepLocal_2=14, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=5, var_1_8=1, var_1_9=2] [L66] COND FALSE !(stepLocal_2 < (var_1_5 | var_1_6)) [L71] var_1_11 = var_1_8 VAL [isInitial=1, var_1_10=1073741823, var_1_11=1, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=5, var_1_8=1, var_1_9=2] [L73] signed short int stepLocal_4 = var_1_2; [L74] unsigned short int stepLocal_3 = var_1_11; VAL [isInitial=1, stepLocal_3=1, stepLocal_4=1, var_1_10=1073741823, var_1_11=1, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=5, var_1_8=1, var_1_9=2] [L75] COND FALSE !(stepLocal_3 < (- var_1_10)) [L80] var_1_12 = var_1_13 VAL [isInitial=1, stepLocal_4=1, var_1_10=1073741823, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=5, var_1_8=1, var_1_9=2] [L82] unsigned short int stepLocal_5 = var_1_8; VAL [isInitial=1, stepLocal_4=1, stepLocal_5=1, var_1_10=1073741823, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=5, var_1_8=1, var_1_9=2] [L83] COND TRUE var_1_1 <= stepLocal_5 [L84] var_1_14 = ((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))) - var_1_17) + -2) VAL [isInitial=1, stepLocal_4=1, var_1_10=1073741823, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=5, var_1_8=1, var_1_9=2] [L86] COND TRUE var_1_4 || var_1_19 [L87] var_1_18 = ((((var_1_20 + (var_1_21 + var_1_22)) < 0 ) ? -(var_1_20 + (var_1_21 + var_1_22)) : (var_1_20 + (var_1_21 + var_1_22)))) VAL [isInitial=1, stepLocal_4=1, var_1_10=1073741823, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=5, var_1_8=1, var_1_9=2] [L89] COND TRUE var_1_4 && (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) > var_1_5) [L90] var_1_23 = var_1_6 VAL [isInitial=1, stepLocal_4=1, var_1_10=1073741823, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=4, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=5, var_1_8=1, var_1_9=2] [L148] RET step() [L149] CALL, EXPR property() [L139] EXPR (((((var_1_2 / -50) >= var_1_3) ? (var_1_4 ? (var_1_1 == ((signed short int) (var_1_5 - var_1_6))) : (var_1_1 == ((signed short int) var_1_5))) : (var_1_1 == ((signed short int) var_1_5))) && ((var_1_2 < var_1_6) ? (var_1_7 == ((unsigned short int) (var_1_6 + var_1_8))) : 1)) && ((var_1_6 > 128) ? (var_1_9 == ((signed long int) (var_1_8 - (var_1_10 - var_1_7)))) : 1)) && ((((var_1_7 + var_1_9) * var_1_3) < (var_1_5 | var_1_6)) ? (var_1_4 ? (var_1_11 == ((unsigned short int) var_1_8)) : 1) : (var_1_11 == ((unsigned short int) var_1_8))) VAL [isInitial=1, var_1_10=1073741823, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=4, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=5, var_1_8=1, var_1_9=2] [L139] EXPR var_1_5 | var_1_6 VAL [isInitial=1, var_1_10=1073741823, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=4, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=5, var_1_8=1, var_1_9=2] [L139] EXPR (((((var_1_2 / -50) >= var_1_3) ? (var_1_4 ? (var_1_1 == ((signed short int) (var_1_5 - var_1_6))) : (var_1_1 == ((signed short int) var_1_5))) : (var_1_1 == ((signed short int) var_1_5))) && ((var_1_2 < var_1_6) ? (var_1_7 == ((unsigned short int) (var_1_6 + var_1_8))) : 1)) && ((var_1_6 > 128) ? (var_1_9 == ((signed long int) (var_1_8 - (var_1_10 - var_1_7)))) : 1)) && ((((var_1_7 + var_1_9) * var_1_3) < (var_1_5 | var_1_6)) ? (var_1_4 ? (var_1_11 == ((unsigned short int) var_1_8)) : 1) : (var_1_11 == ((unsigned short int) var_1_8))) VAL [isInitial=1, var_1_10=1073741823, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=4, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=5, var_1_8=1, var_1_9=2] [L139-L140] return (((((((((var_1_2 / -50) >= var_1_3) ? (var_1_4 ? (var_1_1 == ((signed short int) (var_1_5 - var_1_6))) : (var_1_1 == ((signed short int) var_1_5))) : (var_1_1 == ((signed short int) var_1_5))) && ((var_1_2 < var_1_6) ? (var_1_7 == ((unsigned short int) (var_1_6 + var_1_8))) : 1)) && ((var_1_6 > 128) ? (var_1_9 == ((signed long int) (var_1_8 - (var_1_10 - var_1_7)))) : 1)) && ((((var_1_7 + var_1_9) * var_1_3) < (var_1_5 | var_1_6)) ? (var_1_4 ? (var_1_11 == ((unsigned short int) var_1_8)) : 1) : (var_1_11 == ((unsigned short int) var_1_8)))) && ((var_1_11 < (- var_1_10)) ? ((var_1_8 <= var_1_2) ? (var_1_12 == ((double) (var_1_13 - 63.75))) : 1) : (var_1_12 == ((double) var_1_13)))) && ((var_1_1 <= var_1_8) ? (var_1_14 == ((signed char) ((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))) - var_1_17) + -2))) : 1)) && ((var_1_4 || var_1_19) ? (var_1_18 == ((float) ((((var_1_20 + (var_1_21 + var_1_22)) < 0 ) ? -(var_1_20 + (var_1_21 + var_1_22)) : (var_1_20 + (var_1_21 + var_1_22)))))) : 1)) && ((var_1_4 && (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) > var_1_5)) ? (var_1_23 == ((unsigned short int) var_1_6)) : 1) ; [L149] RET, EXPR property() [L149] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1073741823, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=4, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=5, var_1_8=1, var_1_9=2] [L19] reach_error() VAL [isInitial=1, var_1_10=1073741823, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=4, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=5, var_1_8=1, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.3s, OverallIterations: 9, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 606 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 606 mSDsluCounter, 3080 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2110 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1410 IncrementalHoareTripleChecker+Invalid, 1429 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 970 mSDtfsCounter, 1410 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 505 GetRequests, 461 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=5, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 238 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 12.4s InterpolantComputationTime, 1659 NumberOfCodeBlocks, 1659 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1317 ConstructedInterpolants, 0 QuantifiedInterpolants, 12782 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 10400/10400 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-11 07:29:29,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-16.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 da982387660185d291ba506664c590935ec691dede2a6c22408e1c80bc2337b3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:29:31,751 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:29:31,829 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 07:29:31,837 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:29:31,839 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:29:31,869 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:29:31,869 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:29:31,870 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:29:31,870 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:29:31,874 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:29:31,874 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:29:31,875 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:29:31,875 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:29:31,875 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:29:31,876 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:29:31,876 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:29:31,876 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:29:31,876 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:29:31,876 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:29:31,877 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:29:31,877 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:29:31,878 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:29:31,879 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:29:31,879 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 07:29:31,880 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 07:29:31,880 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:29:31,880 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 07:29:31,880 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:29:31,881 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:29:31,881 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:29:31,881 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:29:31,882 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:29:31,882 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:29:31,883 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:29:31,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:29:31,883 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:29:31,884 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:29:31,884 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:29:31,884 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 07:29:31,885 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 07:29:31,885 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:29:31,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:29:31,886 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:29:31,886 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:29:31,886 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 07:29:31,886 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-clean/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-clean/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 -> da982387660185d291ba506664c590935ec691dede2a6c22408e1c80bc2337b3 [2024-10-11 07:29:32,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:29:32,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:29:32,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:29:32,261 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:29:32,262 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:29:32,264 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-16.i [2024-10-11 07:29:33,945 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:29:34,182 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:29:34,182 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-16.i [2024-10-11 07:29:34,193 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b278d9254/522a2c6bdbc04c7da1fd658bd5d63b5b/FLAG663fa3d78 [2024-10-11 07:29:34,528 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b278d9254/522a2c6bdbc04c7da1fd658bd5d63b5b [2024-10-11 07:29:34,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:29:34,532 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:29:34,533 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:29:34,533 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:29:34,538 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:29:34,538 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:29:34" (1/1) ... [2024-10-11 07:29:34,539 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d9e00e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:34, skipping insertion in model container [2024-10-11 07:29:34,539 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:29:34" (1/1) ... [2024-10-11 07:29:34,569 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:29:34,762 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_codestructure_steplocals_file-16.i[917,930] [2024-10-11 07:29:34,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:29:34,864 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:29:34,876 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_codestructure_steplocals_file-16.i[917,930] [2024-10-11 07:29:34,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:29:34,941 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:29:34,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:34 WrapperNode [2024-10-11 07:29:34,942 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:29:34,943 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:29:34,943 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:29:34,943 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:29:34,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:34" (1/1) ... [2024-10-11 07:29:34,968 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:34" (1/1) ... [2024-10-11 07:29:35,009 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 157 [2024-10-11 07:29:35,009 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:29:35,010 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:29:35,014 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:29:35,014 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:29:35,025 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:34" (1/1) ... [2024-10-11 07:29:35,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:34" (1/1) ... [2024-10-11 07:29:35,035 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:34" (1/1) ... [2024-10-11 07:29:35,052 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-11 07:29:35,056 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:34" (1/1) ... [2024-10-11 07:29:35,056 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:34" (1/1) ... [2024-10-11 07:29:35,070 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:34" (1/1) ... [2024-10-11 07:29:35,077 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:34" (1/1) ... [2024-10-11 07:29:35,083 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:34" (1/1) ... [2024-10-11 07:29:35,085 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:34" (1/1) ... [2024-10-11 07:29:35,093 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:29:35,097 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:29:35,097 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:29:35,097 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:29:35,098 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:34" (1/1) ... [2024-10-11 07:29:35,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:29:35,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:29:35,131 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:29:35,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:29:35,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:29:35,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 07:29:35,183 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:29:35,183 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:29:35,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:29:35,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:29:35,268 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:29:35,270 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:29:36,622 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-11 07:29:36,622 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:29:36,670 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:29:36,671 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:29:36,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:29:36 BoogieIcfgContainer [2024-10-11 07:29:36,674 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:29:36,676 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:29:36,677 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:29:36,680 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:29:36,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:29:34" (1/3) ... [2024-10-11 07:29:36,681 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf1a522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:29:36, skipping insertion in model container [2024-10-11 07:29:36,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:29:34" (2/3) ... [2024-10-11 07:29:36,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf1a522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:29:36, skipping insertion in model container [2024-10-11 07:29:36,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:29:36" (3/3) ... [2024-10-11 07:29:36,683 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-16.i [2024-10-11 07:29:36,701 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:29:36,702 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:29:36,765 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:29:36,772 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;@b971382, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:29:36,773 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:29:36,777 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 40 states have (on average 1.4) internal successors, (56), 41 states have internal predecessors, (56), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 07:29:36,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 07:29:36,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:29:36,794 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:29:36,795 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:29:36,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:29:36,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1591907401, now seen corresponding path program 1 times [2024-10-11 07:29:36,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:29:36,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [180368638] [2024-10-11 07:29:36,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:29:36,824 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-11 07:29:36,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:29:36,827 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 07:29:36,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 07:29:37,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:37,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 07:29:37,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:29:37,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 674 proven. 0 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2024-10-11 07:29:37,260 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:29:37,261 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:29:37,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [180368638] [2024-10-11 07:29:37,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [180368638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:29:37,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:29:37,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:29:37,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102662527] [2024-10-11 07:29:37,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:29:37,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:29:37,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:29:37,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:29:37,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:29:37,295 INFO L87 Difference]: Start difference. First operand has 69 states, 40 states have (on average 1.4) internal successors, (56), 41 states have internal predecessors, (56), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 07:29:38,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:29:38,115 INFO L93 Difference]: Finished difference Result 135 states and 240 transitions. [2024-10-11 07:29:38,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:29:38,134 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 162 [2024-10-11 07:29:38,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:29:38,140 INFO L225 Difference]: With dead ends: 135 [2024-10-11 07:29:38,140 INFO L226 Difference]: Without dead ends: 67 [2024-10-11 07:29:38,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 161 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-11 07:29:38,147 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 07:29:38,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 07:29:38,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-11 07:29:38,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-11 07:29:38,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 07:29:38,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 103 transitions. [2024-10-11 07:29:38,194 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 103 transitions. Word has length 162 [2024-10-11 07:29:38,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:29:38,195 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 103 transitions. [2024-10-11 07:29:38,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 07:29:38,195 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 103 transitions. [2024-10-11 07:29:38,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 07:29:38,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:29:38,199 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:29:38,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 07:29:38,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 07:29:38,400 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:29:38,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:29:38,401 INFO L85 PathProgramCache]: Analyzing trace with hash -600328303, now seen corresponding path program 1 times [2024-10-11 07:29:38,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:29:38,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [431324606] [2024-10-11 07:29:38,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:29:38,402 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-11 07:29:38,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:29:38,404 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 07:29:38,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 07:29:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:29:38,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-11 07:29:38,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:30:23,982 WARN L286 SmtUtils]: Spent 7.74s on a formula simplification that was a NOOP. DAG size: 107 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)