./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-29.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_loopvsstraightlinecode_100-while_file-29.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 89fb3437dc022c4b5e6c8772f3270e161abf7529bebe371d9c5e10b428f306b8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:15:24,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:15:24,432 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:15:24,439 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:15:24,441 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:15:24,472 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:15:24,472 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:15:24,474 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:15:24,474 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:15:24,475 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:15:24,476 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:15:24,477 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:15:24,478 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:15:24,478 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:15:24,478 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:15:24,482 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:15:24,482 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:15:24,483 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:15:24,483 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:15:24,483 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:15:24,484 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:15:24,484 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:15:24,484 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:15:24,485 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:15:24,485 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:15:24,485 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:15:24,485 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:15:24,486 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:15:24,486 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:15:24,486 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:15:24,486 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:15:24,487 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:15:24,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:15:24,487 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:15:24,487 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:15:24,488 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:15:24,488 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:15:24,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:15:24,488 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:15:24,489 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:15:24,489 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:15:24,490 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:15:24,490 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 -> 89fb3437dc022c4b5e6c8772f3270e161abf7529bebe371d9c5e10b428f306b8 [2024-10-11 11:15:24,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:15:24,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:15:24,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:15:24,783 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:15:24,784 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:15:24,785 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-29.i [2024-10-11 11:15:26,277 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:15:26,517 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:15:26,521 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-29.i [2024-10-11 11:15:26,535 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/880e4b22c/6f6750e50e0443be8a6c71b3b3f3b2de/FLAG3f08b5fcc [2024-10-11 11:15:26,550 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/880e4b22c/6f6750e50e0443be8a6c71b3b3f3b2de [2024-10-11 11:15:26,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:15:26,554 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:15:26,555 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:15:26,556 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:15:26,561 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:15:26,562 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:15:26" (1/1) ... [2024-10-11 11:15:26,562 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2615a746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:26, skipping insertion in model container [2024-10-11 11:15:26,563 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:15:26" (1/1) ... [2024-10-11 11:15:26,593 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:15:26,741 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-29.i[916,929] [2024-10-11 11:15:26,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:15:26,821 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:15:26,832 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-29.i[916,929] [2024-10-11 11:15:26,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:15:26,887 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:15:26,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:26 WrapperNode [2024-10-11 11:15:26,888 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:15:26,889 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:15:26,889 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:15:26,889 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:15:26,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:26" (1/1) ... [2024-10-11 11:15:26,905 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:26" (1/1) ... [2024-10-11 11:15:27,007 INFO L138 Inliner]: procedures = 26, calls = 51, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 274 [2024-10-11 11:15:27,007 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:15:27,008 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:15:27,008 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:15:27,008 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:15:27,018 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:26" (1/1) ... [2024-10-11 11:15:27,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:26" (1/1) ... [2024-10-11 11:15:27,027 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:26" (1/1) ... [2024-10-11 11:15:27,059 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 11:15:27,063 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:26" (1/1) ... [2024-10-11 11:15:27,063 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:26" (1/1) ... [2024-10-11 11:15:27,081 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:26" (1/1) ... [2024-10-11 11:15:27,087 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:26" (1/1) ... [2024-10-11 11:15:27,100 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:26" (1/1) ... [2024-10-11 11:15:27,106 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:26" (1/1) ... [2024-10-11 11:15:27,116 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:15:27,119 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:15:27,119 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:15:27,119 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:15:27,120 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:26" (1/1) ... [2024-10-11 11:15:27,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:15:27,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:15:27,157 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 11:15:27,167 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 11:15:27,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:15:27,212 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:15:27,213 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:15:27,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:15:27,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:15:27,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:15:27,325 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:15:27,327 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:15:27,750 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-10-11 11:15:27,750 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:15:27,798 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:15:27,798 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:15:27,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:15:27 BoogieIcfgContainer [2024-10-11 11:15:27,800 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:15:27,801 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:15:27,802 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:15:27,805 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:15:27,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:15:26" (1/3) ... [2024-10-11 11:15:27,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@552abbd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:15:27, skipping insertion in model container [2024-10-11 11:15:27,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:26" (2/3) ... [2024-10-11 11:15:27,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@552abbd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:15:27, skipping insertion in model container [2024-10-11 11:15:27,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:15:27" (3/3) ... [2024-10-11 11:15:27,808 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-29.i [2024-10-11 11:15:27,823 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:15:27,823 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:15:27,877 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:15:27,882 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;@39ddd003, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:15:27,883 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:15:27,886 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 71 states have internal predecessors, (100), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 11:15:27,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-10-11 11:15:27,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:15:27,905 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:15:27,906 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:15:27,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:15:27,911 INFO L85 PathProgramCache]: Analyzing trace with hash 226827744, now seen corresponding path program 1 times [2024-10-11 11:15:27,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:15:27,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322863015] [2024-10-11 11:15:27,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:15:27,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:15:28,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:15:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:15:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:15:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:15:28,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:15:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:15:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:15:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:15:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:15:28,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:15:28,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:15:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:15:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:15:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:15:28,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:15:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:15:28,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:15:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:15:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:15:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:15:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:15:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:15:28,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:15:28,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:15:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 11:15:28,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:15:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 11:15:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:15:28,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 11:15:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 11:15:28,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 11:15:28,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 11:15:28,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-11 11:15:28,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-11 11:15:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 11:15:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 11:15:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-11 11:15:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-11 11:15:28,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2024-10-11 11:15:28,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:15:28,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322863015] [2024-10-11 11:15:28,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322863015] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:15:28,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:15:28,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:15:28,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757567062] [2024-10-11 11:15:28,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:15:28,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:15:28,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:15:28,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:15:28,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:15:28,540 INFO L87 Difference]: Start difference. First operand has 111 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 71 states have internal predecessors, (100), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) [2024-10-11 11:15:28,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:15:28,597 INFO L93 Difference]: Finished difference Result 219 states and 388 transitions. [2024-10-11 11:15:28,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:15:28,601 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) Word has length 238 [2024-10-11 11:15:28,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:15:28,611 INFO L225 Difference]: With dead ends: 219 [2024-10-11 11:15:28,611 INFO L226 Difference]: Without dead ends: 109 [2024-10-11 11:15:28,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 116 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 11:15:28,617 INFO L432 NwaCegarLoop]: 168 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, 168 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 11:15:28,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:15:28,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-11 11:15:28,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-11 11:15:28,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 69 states have internal predecessors, (95), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 11:15:28,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 171 transitions. [2024-10-11 11:15:28,669 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 171 transitions. Word has length 238 [2024-10-11 11:15:28,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:15:28,669 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 171 transitions. [2024-10-11 11:15:28,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) [2024-10-11 11:15:28,670 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 171 transitions. [2024-10-11 11:15:28,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-10-11 11:15:28,674 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:15:28,674 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:15:28,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:15:28,675 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:15:28,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:15:28,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1895552936, now seen corresponding path program 1 times [2024-10-11 11:15:28,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:15:28,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892937732] [2024-10-11 11:15:28,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:15:28,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:15:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:15:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:15:28,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:15:28,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:15:28,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:15:28,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:15:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:15:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:15:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:15:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:15:28,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:15:28,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:15:28,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:15:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:15:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:15:28,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:15:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:15:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:15:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:15:28,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:15:28,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:15:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:15:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:15:28,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:15:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 11:15:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:15:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 11:15:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:15:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 11:15:28,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 11:15:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 11:15:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 11:15:28,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-11 11:15:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-11 11:15:28,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 11:15:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 11:15:28,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-11 11:15:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-11 11:15:28,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:28,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2024-10-11 11:15:28,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:15:28,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892937732] [2024-10-11 11:15:28,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892937732] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:15:29,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:15:29,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:15:29,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759227838] [2024-10-11 11:15:29,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:15:29,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:15:29,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:15:29,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:15:29,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:15:29,004 INFO L87 Difference]: Start difference. First operand 109 states and 171 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 11:15:29,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:15:29,120 INFO L93 Difference]: Finished difference Result 317 states and 498 transitions. [2024-10-11 11:15:29,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:15:29,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 238 [2024-10-11 11:15:29,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:15:29,127 INFO L225 Difference]: With dead ends: 317 [2024-10-11 11:15:29,127 INFO L226 Difference]: Without dead ends: 209 [2024-10-11 11:15:29,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 78 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 11:15:29,129 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 148 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:15:29,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 428 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:15:29,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-11 11:15:29,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2024-10-11 11:15:29,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 128 states have (on average 1.328125) internal successors, (170), 128 states have internal predecessors, (170), 76 states have call successors, (76), 2 states have call predecessors, (76), 2 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2024-10-11 11:15:29,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 322 transitions. [2024-10-11 11:15:29,215 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 322 transitions. Word has length 238 [2024-10-11 11:15:29,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:15:29,223 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 322 transitions. [2024-10-11 11:15:29,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 11:15:29,223 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 322 transitions. [2024-10-11 11:15:29,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-10-11 11:15:29,235 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:15:29,235 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:15:29,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:15:29,235 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:15:29,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:15:29,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1121196527, now seen corresponding path program 1 times [2024-10-11 11:15:29,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:15:29,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826835084] [2024-10-11 11:15:29,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:15:29,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:15:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:29,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:15:29,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:29,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:15:29,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:29,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:15:29,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:29,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:15:29,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:29,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:15:29,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:29,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:15:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:29,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:15:29,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:29,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:15:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:29,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:15:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:29,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:15:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:29,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:15:29,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:29,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:15:29,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:29,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:15:29,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:29,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:15:29,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:29,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:15:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:29,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:15:29,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:29,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:15:29,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:29,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:15:29,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:29,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:15:29,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:29,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:15:29,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:29,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:15:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:29,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:15:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:29,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:15:29,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:29,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:15:29,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:29,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 11:15:29,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:29,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:15:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:29,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 11:15:29,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:29,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:15:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:29,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 11:15:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:29,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 11:15:29,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:29,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 11:15:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:29,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 11:15:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:29,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-11 11:15:29,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:29,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-11 11:15:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:29,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 11:15:29,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:29,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 11:15:29,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:29,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-11 11:15:29,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:29,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-11 11:15:29,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:29,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2024-10-11 11:15:29,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:15:29,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826835084] [2024-10-11 11:15:29,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826835084] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:15:29,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:15:29,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:15:29,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710448822] [2024-10-11 11:15:29,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:15:29,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:15:29,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:15:29,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:15:29,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:15:29,472 INFO L87 Difference]: Start difference. First operand 207 states and 322 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 11:15:29,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:15:29,555 INFO L93 Difference]: Finished difference Result 419 states and 651 transitions. [2024-10-11 11:15:29,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:15:29,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 239 [2024-10-11 11:15:29,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:15:29,561 INFO L225 Difference]: With dead ends: 419 [2024-10-11 11:15:29,561 INFO L226 Difference]: Without dead ends: 213 [2024-10-11 11:15:29,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 78 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 11:15:29,564 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 153 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:15:29,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 344 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:15:29,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-10-11 11:15:29,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2024-10-11 11:15:29,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 132 states have (on average 1.303030303030303) internal successors, (172), 132 states have internal predecessors, (172), 76 states have call successors, (76), 2 states have call predecessors, (76), 2 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2024-10-11 11:15:29,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 324 transitions. [2024-10-11 11:15:29,603 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 324 transitions. Word has length 239 [2024-10-11 11:15:29,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:15:29,607 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 324 transitions. [2024-10-11 11:15:29,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 11:15:29,607 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 324 transitions. [2024-10-11 11:15:29,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-10-11 11:15:29,609 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:15:29,610 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:15:29,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 11:15:29,610 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:15:29,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:15:29,610 INFO L85 PathProgramCache]: Analyzing trace with hash 524713621, now seen corresponding path program 1 times [2024-10-11 11:15:29,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:15:29,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502883991] [2024-10-11 11:15:29,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:15:29,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:15:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:30,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:15:30,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:30,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:15:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:30,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:15:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:30,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:15:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:30,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:15:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:30,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:15:30,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:30,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:15:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:30,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:15:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:30,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:15:30,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:30,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:15:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:30,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:15:30,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:30,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:15:30,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:30,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:15:30,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:30,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:15:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:30,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:15:30,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:30,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:15:30,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:30,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:15:30,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:30,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:15:30,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:30,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:15:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:30,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:15:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:30,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:15:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:30,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:15:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:30,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:15:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:30,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:15:30,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:30,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 11:15:30,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:30,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:15:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:30,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 11:15:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:30,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:15:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:30,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 11:15:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:30,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 11:15:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:30,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 11:15:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:30,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 11:15:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:30,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-11 11:15:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:30,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-11 11:15:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:30,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 11:15:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:30,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 11:15:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:30,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-11 11:15:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:30,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-11 11:15:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:30,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2024-10-11 11:15:30,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:15:30,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502883991] [2024-10-11 11:15:30,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502883991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:15:30,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:15:30,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 11:15:30,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806759115] [2024-10-11 11:15:30,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:15:30,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 11:15:30,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:15:30,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 11:15:30,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:15:30,584 INFO L87 Difference]: Start difference. First operand 211 states and 324 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 11:15:30,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:15:30,968 INFO L93 Difference]: Finished difference Result 559 states and 856 transitions. [2024-10-11 11:15:30,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 11:15:30,969 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 240 [2024-10-11 11:15:30,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:15:30,976 INFO L225 Difference]: With dead ends: 559 [2024-10-11 11:15:30,976 INFO L226 Difference]: Without dead ends: 349 [2024-10-11 11:15:30,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:15:30,978 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 114 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 11:15:30,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 568 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 11:15:30,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-10-11 11:15:31,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 279. [2024-10-11 11:15:31,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 161 states have (on average 1.2484472049689441) internal successors, (201), 161 states have internal predecessors, (201), 114 states have call successors, (114), 3 states have call predecessors, (114), 3 states have return successors, (114), 114 states have call predecessors, (114), 114 states have call successors, (114) [2024-10-11 11:15:31,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 429 transitions. [2024-10-11 11:15:31,057 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 429 transitions. Word has length 240 [2024-10-11 11:15:31,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:15:31,058 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 429 transitions. [2024-10-11 11:15:31,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 11:15:31,058 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 429 transitions. [2024-10-11 11:15:31,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-10-11 11:15:31,060 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:15:31,060 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:15:31,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 11:15:31,060 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:15:31,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:15:31,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1214067982, now seen corresponding path program 1 times [2024-10-11 11:15:31,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:15:31,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591715838] [2024-10-11 11:15:31,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:15:31,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:15:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:37,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:15:37,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:37,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:15:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:37,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:15:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:37,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:15:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:37,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:15:37,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:37,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:15:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:37,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:15:37,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:37,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:15:37,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:37,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:15:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:37,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:15:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:37,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:15:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:37,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:15:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:37,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:15:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:37,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:15:37,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:37,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:15:37,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:37,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:15:37,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:37,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:15:37,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:37,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:15:37,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:37,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:15:37,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:37,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:15:37,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:37,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:15:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:37,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:15:37,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:37,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:15:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:37,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:15:37,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:37,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 11:15:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:37,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:15:37,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:37,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 11:15:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:37,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:15:37,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:37,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 11:15:37,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:37,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 11:15:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:37,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 11:15:37,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:37,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 11:15:37,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:37,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-11 11:15:37,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:37,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-11 11:15:37,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:37,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 11:15:37,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:37,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 11:15:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:37,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-11 11:15:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:37,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-11 11:15:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:37,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2024-10-11 11:15:37,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:15:37,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591715838] [2024-10-11 11:15:37,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591715838] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:15:37,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:15:37,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 11:15:37,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527236664] [2024-10-11 11:15:37,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:15:37,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 11:15:37,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:15:37,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 11:15:37,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 11:15:37,616 INFO L87 Difference]: Start difference. First operand 279 states and 429 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 11:15:38,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:15:38,936 INFO L93 Difference]: Finished difference Result 761 states and 1133 transitions. [2024-10-11 11:15:38,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 11:15:38,936 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 241 [2024-10-11 11:15:38,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:15:38,940 INFO L225 Difference]: With dead ends: 761 [2024-10-11 11:15:38,940 INFO L226 Difference]: Without dead ends: 551 [2024-10-11 11:15:38,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2024-10-11 11:15:38,941 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 548 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 11:15:38,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 972 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 11:15:38,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2024-10-11 11:15:38,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 304. [2024-10-11 11:15:38,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 186 states have (on average 1.2634408602150538) internal successors, (235), 186 states have internal predecessors, (235), 114 states have call successors, (114), 3 states have call predecessors, (114), 3 states have return successors, (114), 114 states have call predecessors, (114), 114 states have call successors, (114) [2024-10-11 11:15:38,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 463 transitions. [2024-10-11 11:15:38,977 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 463 transitions. Word has length 241 [2024-10-11 11:15:38,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:15:38,978 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 463 transitions. [2024-10-11 11:15:38,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 11:15:38,978 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 463 transitions. [2024-10-11 11:15:38,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-10-11 11:15:38,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:15:38,980 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:15:38,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 11:15:38,981 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:15:38,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:15:38,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1472233420, now seen corresponding path program 1 times [2024-10-11 11:15:38,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:15:38,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66723272] [2024-10-11 11:15:38,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:15:38,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:15:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:45,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:15:45,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:45,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:15:45,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:45,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:15:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:45,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:15:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:45,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:15:45,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:45,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:15:45,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:45,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:15:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:45,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:15:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:45,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:15:45,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:45,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:15:45,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:45,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:15:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:45,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:15:45,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:45,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:15:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:45,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:15:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:45,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:15:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:45,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:15:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:45,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:15:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:45,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:15:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:45,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:15:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:45,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:15:45,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:45,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:15:45,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:45,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:15:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:45,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:15:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:45,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:15:45,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:45,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 11:15:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:45,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:15:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:45,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 11:15:45,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:45,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:15:45,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:45,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 11:15:45,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:45,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 11:15:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:45,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 11:15:45,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:45,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 11:15:45,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:45,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-11 11:15:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:45,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-11 11:15:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:45,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 11:15:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:45,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 11:15:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:45,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-11 11:15:45,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:45,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-11 11:15:45,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:45,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2024-10-11 11:15:45,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:15:45,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66723272] [2024-10-11 11:15:45,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66723272] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:15:45,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:15:45,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 11:15:45,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691906443] [2024-10-11 11:15:45,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:15:45,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 11:15:45,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:15:45,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 11:15:45,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-10-11 11:15:45,649 INFO L87 Difference]: Start difference. First operand 304 states and 463 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 11:15:48,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:15:48,958 INFO L93 Difference]: Finished difference Result 861 states and 1294 transitions. [2024-10-11 11:15:48,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 11:15:48,959 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 241 [2024-10-11 11:15:48,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:15:48,964 INFO L225 Difference]: With dead ends: 861 [2024-10-11 11:15:48,964 INFO L226 Difference]: Without dead ends: 626 [2024-10-11 11:15:48,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2024-10-11 11:15:48,966 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 509 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:15:48,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 651 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 11:15:48,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2024-10-11 11:15:49,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 523. [2024-10-11 11:15:49,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 327 states have (on average 1.2782874617737003) internal successors, (418), 327 states have internal predecessors, (418), 190 states have call successors, (190), 5 states have call predecessors, (190), 5 states have return successors, (190), 190 states have call predecessors, (190), 190 states have call successors, (190) [2024-10-11 11:15:49,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 798 transitions. [2024-10-11 11:15:49,039 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 798 transitions. Word has length 241 [2024-10-11 11:15:49,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:15:49,040 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 798 transitions. [2024-10-11 11:15:49,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 11:15:49,040 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 798 transitions. [2024-10-11 11:15:49,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-10-11 11:15:49,042 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:15:49,042 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:15:49,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 11:15:49,043 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:15:49,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:15:49,043 INFO L85 PathProgramCache]: Analyzing trace with hash 192999628, now seen corresponding path program 1 times [2024-10-11 11:15:49,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:15:49,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27597821] [2024-10-11 11:15:49,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:15:49,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:15:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:49,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:15:49,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:49,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:15:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:49,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:15:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:49,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:15:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:49,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:15:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:49,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:15:49,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:49,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:15:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:49,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:15:49,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:49,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:15:49,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:49,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:15:49,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:49,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:15:49,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:49,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:15:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:49,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:15:49,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:49,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:15:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:49,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:15:49,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:49,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:15:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:49,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:15:49,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:49,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:15:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:49,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:15:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:49,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:15:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:49,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:15:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:49,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:15:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:49,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:15:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:49,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:15:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:49,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 11:15:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:49,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:15:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:49,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 11:15:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:49,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:15:49,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:49,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 11:15:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:49,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 11:15:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:49,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 11:15:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:49,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 11:15:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:49,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-11 11:15:49,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:49,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-11 11:15:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:49,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 11:15:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:49,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 11:15:49,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:49,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-11 11:15:49,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:49,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-11 11:15:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:49,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2024-10-11 11:15:49,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:15:49,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27597821] [2024-10-11 11:15:49,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27597821] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:15:49,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:15:49,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:15:49,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643795903] [2024-10-11 11:15:49,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:15:49,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:15:49,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:15:49,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:15:49,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:15:49,470 INFO L87 Difference]: Start difference. First operand 523 states and 798 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 11:15:49,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:15:49,588 INFO L93 Difference]: Finished difference Result 1125 states and 1698 transitions. [2024-10-11 11:15:49,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:15:49,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 241 [2024-10-11 11:15:49,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:15:49,593 INFO L225 Difference]: With dead ends: 1125 [2024-10-11 11:15:49,594 INFO L226 Difference]: Without dead ends: 671 [2024-10-11 11:15:49,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:15:49,596 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 81 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:15:49,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 454 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:15:49,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2024-10-11 11:15:49,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 551. [2024-10-11 11:15:49,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 355 states have (on average 1.2901408450704226) internal successors, (458), 355 states have internal predecessors, (458), 190 states have call successors, (190), 5 states have call predecessors, (190), 5 states have return successors, (190), 190 states have call predecessors, (190), 190 states have call successors, (190) [2024-10-11 11:15:49,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 838 transitions. [2024-10-11 11:15:49,658 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 838 transitions. Word has length 241 [2024-10-11 11:15:49,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:15:49,663 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 838 transitions. [2024-10-11 11:15:49,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 11:15:49,664 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 838 transitions. [2024-10-11 11:15:49,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-10-11 11:15:49,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:15:49,667 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:15:49,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 11:15:49,667 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:15:49,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:15:49,667 INFO L85 PathProgramCache]: Analyzing trace with hash -654063321, now seen corresponding path program 1 times [2024-10-11 11:15:49,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:15:49,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038393493] [2024-10-11 11:15:49,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:15:49,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:15:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:50,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:15:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:50,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:15:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:50,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:15:50,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:50,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:15:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:50,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:15:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:50,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:15:50,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:50,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:15:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:50,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:15:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:50,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:15:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:50,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:15:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:50,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:15:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:50,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:15:50,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:50,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:15:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:50,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:15:50,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:50,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:15:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:50,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:15:50,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:50,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:15:50,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:50,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:15:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:50,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:15:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:50,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:15:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:50,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:15:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:50,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:15:50,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:50,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:15:50,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:50,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:15:50,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:50,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 11:15:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:50,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:15:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:50,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 11:15:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:50,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:15:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:50,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 11:15:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:50,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 11:15:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:50,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 11:15:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:50,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 11:15:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:50,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-11 11:15:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:50,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-11 11:15:50,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:50,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 11:15:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:50,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 11:15:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:50,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-11 11:15:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:50,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-11 11:15:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:50,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2024-10-11 11:15:50,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:15:50,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038393493] [2024-10-11 11:15:50,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038393493] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:15:50,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:15:50,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 11:15:50,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636116349] [2024-10-11 11:15:50,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:15:50,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 11:15:50,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:15:50,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 11:15:50,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 11:15:50,523 INFO L87 Difference]: Start difference. First operand 551 states and 838 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 11:15:51,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:15:51,067 INFO L93 Difference]: Finished difference Result 1074 states and 1626 transitions. [2024-10-11 11:15:51,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 11:15:51,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 241 [2024-10-11 11:15:51,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:15:51,072 INFO L225 Difference]: With dead ends: 1074 [2024-10-11 11:15:51,072 INFO L226 Difference]: Without dead ends: 592 [2024-10-11 11:15:51,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:15:51,077 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 210 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 11:15:51,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 601 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 11:15:51,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2024-10-11 11:15:51,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 566. [2024-10-11 11:15:51,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 370 states have (on average 1.2945945945945947) internal successors, (479), 370 states have internal predecessors, (479), 190 states have call successors, (190), 5 states have call predecessors, (190), 5 states have return successors, (190), 190 states have call predecessors, (190), 190 states have call successors, (190) [2024-10-11 11:15:51,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 859 transitions. [2024-10-11 11:15:51,135 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 859 transitions. Word has length 241 [2024-10-11 11:15:51,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:15:51,136 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 859 transitions. [2024-10-11 11:15:51,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 11:15:51,137 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 859 transitions. [2024-10-11 11:15:51,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-10-11 11:15:51,139 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:15:51,140 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:15:51,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 11:15:51,140 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:15:51,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:15:51,140 INFO L85 PathProgramCache]: Analyzing trace with hash 110890974, now seen corresponding path program 1 times [2024-10-11 11:15:51,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:15:51,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754851831] [2024-10-11 11:15:51,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:15:51,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:15:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:15:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:15:51,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:15:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:15:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:15:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:15:51,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:15:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:15:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:15:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:15:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:15:51,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:15:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:15:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:15:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:15:51,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:15:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:15:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:15:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:15:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:15:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:15:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:15:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:15:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:15:51,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 11:15:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:15:51,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 11:15:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:15:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 11:15:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 11:15:51,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 11:15:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 11:15:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-11 11:15:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-11 11:15:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 11:15:51,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 11:15:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-11 11:15:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-11 11:15:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2024-10-11 11:15:51,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:15:51,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754851831] [2024-10-11 11:15:51,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754851831] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:15:51,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:15:51,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:15:51,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850530164] [2024-10-11 11:15:51,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:15:51,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:15:51,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:15:51,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:15:51,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:15:51,494 INFO L87 Difference]: Start difference. First operand 566 states and 859 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 11:15:51,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:15:51,693 INFO L93 Difference]: Finished difference Result 953 states and 1434 transitions. [2024-10-11 11:15:51,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:15:51,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 242 [2024-10-11 11:15:51,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:15:51,700 INFO L225 Difference]: With dead ends: 953 [2024-10-11 11:15:51,702 INFO L226 Difference]: Without dead ends: 698 [2024-10-11 11:15:51,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:15:51,704 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 97 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:15:51,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 496 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:15:51,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-10-11 11:15:51,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 574. [2024-10-11 11:15:51,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 378 states have (on average 1.2936507936507937) internal successors, (489), 378 states have internal predecessors, (489), 190 states have call successors, (190), 5 states have call predecessors, (190), 5 states have return successors, (190), 190 states have call predecessors, (190), 190 states have call successors, (190) [2024-10-11 11:15:51,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 869 transitions. [2024-10-11 11:15:51,775 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 869 transitions. Word has length 242 [2024-10-11 11:15:51,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:15:51,775 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 869 transitions. [2024-10-11 11:15:51,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 11:15:51,776 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 869 transitions. [2024-10-11 11:15:51,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-10-11 11:15:51,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:15:51,778 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:15:51,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 11:15:51,778 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:15:51,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:15:51,778 INFO L85 PathProgramCache]: Analyzing trace with hash -464048650, now seen corresponding path program 1 times [2024-10-11 11:15:51,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:15:51,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58236802] [2024-10-11 11:15:51,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:15:51,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:15:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:15:51,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:15:51,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:15:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:15:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:15:51,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:15:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:15:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:15:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:15:51,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:15:51,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:15:51,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:15:51,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:15:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:15:51,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:15:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:15:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:15:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:15:51,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:15:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:15:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:51,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:15:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:52,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:15:52,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:52,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:15:52,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:52,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:15:52,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:52,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 11:15:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:52,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:15:52,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:52,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 11:15:52,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:52,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:15:52,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:52,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 11:15:52,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:52,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 11:15:52,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:52,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 11:15:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:52,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 11:15:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:52,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-11 11:15:52,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:52,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-11 11:15:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:52,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 11:15:52,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:52,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 11:15:52,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:52,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-11 11:15:52,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:52,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-11 11:15:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:52,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2024-10-11 11:15:52,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:15:52,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58236802] [2024-10-11 11:15:52,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58236802] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:15:52,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:15:52,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:15:52,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505502554] [2024-10-11 11:15:52,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:15:52,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:15:52,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:15:52,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:15:52,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:15:52,054 INFO L87 Difference]: Start difference. First operand 574 states and 869 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 11:15:52,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:15:52,368 INFO L93 Difference]: Finished difference Result 1071 states and 1622 transitions. [2024-10-11 11:15:52,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:15:52,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 242 [2024-10-11 11:15:52,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:15:52,374 INFO L225 Difference]: With dead ends: 1071 [2024-10-11 11:15:52,374 INFO L226 Difference]: Without dead ends: 574 [2024-10-11 11:15:52,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:15:52,377 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 143 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:15:52,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 164 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:15:52,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-10-11 11:15:52,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2024-10-11 11:15:52,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 378 states have (on average 1.283068783068783) internal successors, (485), 378 states have internal predecessors, (485), 190 states have call successors, (190), 5 states have call predecessors, (190), 5 states have return successors, (190), 190 states have call predecessors, (190), 190 states have call successors, (190) [2024-10-11 11:15:52,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 865 transitions. [2024-10-11 11:15:52,449 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 865 transitions. Word has length 242 [2024-10-11 11:15:52,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:15:52,450 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 865 transitions. [2024-10-11 11:15:52,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 11:15:52,450 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 865 transitions. [2024-10-11 11:15:52,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-10-11 11:15:52,451 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:15:52,452 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:15:52,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 11:15:52,452 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:15:52,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:15:52,453 INFO L85 PathProgramCache]: Analyzing trace with hash 345297976, now seen corresponding path program 1 times [2024-10-11 11:15:52,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:15:52,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227540549] [2024-10-11 11:15:52,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:15:52,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:15:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:57,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:15:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:57,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:15:57,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:57,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:15:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:57,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:15:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:57,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:15:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:57,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:15:57,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:57,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:15:57,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:57,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:15:57,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:57,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:15:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:57,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:15:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:57,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:15:57,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:57,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:15:57,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:57,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:15:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:57,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:15:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:57,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:15:57,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:57,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:15:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:57,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:15:57,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:57,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:15:57,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:57,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:15:57,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:57,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:15:57,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:57,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:15:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:57,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:15:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:57,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:15:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:57,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:15:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:57,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 11:15:57,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:57,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:15:57,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:57,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 11:15:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:57,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:15:57,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:57,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 11:15:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:57,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 11:15:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:57,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 11:15:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:57,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 11:15:57,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:57,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-11 11:15:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:57,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-11 11:15:57,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:57,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 11:15:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:57,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 11:15:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:57,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-11 11:15:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:57,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-11 11:15:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:15:57,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2024-10-11 11:15:57,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:15:57,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227540549] [2024-10-11 11:15:57,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227540549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:15:57,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:15:57,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 11:15:57,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405256174] [2024-10-11 11:15:57,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:15:57,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 11:15:57,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:15:57,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 11:15:58,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-11 11:15:58,001 INFO L87 Difference]: Start difference. First operand 574 states and 865 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 11:16:00,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:16:00,504 INFO L93 Difference]: Finished difference Result 1235 states and 1837 transitions. [2024-10-11 11:16:00,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 11:16:00,506 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 242 [2024-10-11 11:16:00,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:16:00,510 INFO L225 Difference]: With dead ends: 1235 [2024-10-11 11:16:00,511 INFO L226 Difference]: Without dead ends: 738 [2024-10-11 11:16:00,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2024-10-11 11:16:00,512 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 235 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 11:16:00,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 694 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 11:16:00,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2024-10-11 11:16:00,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 597. [2024-10-11 11:16:00,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 401 states have (on average 1.2917705735660847) internal successors, (518), 401 states have internal predecessors, (518), 190 states have call successors, (190), 5 states have call predecessors, (190), 5 states have return successors, (190), 190 states have call predecessors, (190), 190 states have call successors, (190) [2024-10-11 11:16:00,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 898 transitions. [2024-10-11 11:16:00,557 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 898 transitions. Word has length 242 [2024-10-11 11:16:00,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:16:00,557 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 898 transitions. [2024-10-11 11:16:00,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 11:16:00,558 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 898 transitions. [2024-10-11 11:16:00,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-10-11 11:16:00,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:16:00,559 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:16:00,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 11:16:00,559 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:16:00,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:16:00,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1340254499, now seen corresponding path program 1 times [2024-10-11 11:16:00,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:16:00,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844999875] [2024-10-11 11:16:00,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:16:00,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:16:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:16:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:16:01,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:16:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:16:01,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:16:01,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:16:01,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:16:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:16:01,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:16:01,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:16:01,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:16:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:16:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:16:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:16:01,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:16:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:16:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:16:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:16:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:16:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:16:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:16:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:16:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:16:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:16:01,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 11:16:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:16:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 11:16:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:16:01,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 11:16:01,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 11:16:01,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 11:16:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 11:16:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-11 11:16:01,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-11 11:16:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 11:16:01,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 11:16:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-11 11:16:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-11 11:16:01,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2024-10-11 11:16:01,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:16:01,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844999875] [2024-10-11 11:16:01,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844999875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:16:01,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:16:01,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 11:16:01,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750185468] [2024-10-11 11:16:01,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:16:01,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 11:16:01,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:16:01,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 11:16:01,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:16:01,119 INFO L87 Difference]: Start difference. First operand 597 states and 898 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 11:16:01,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:16:01,496 INFO L93 Difference]: Finished difference Result 1146 states and 1712 transitions. [2024-10-11 11:16:01,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 11:16:01,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) Word has length 242 [2024-10-11 11:16:01,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:16:01,501 INFO L225 Difference]: With dead ends: 1146 [2024-10-11 11:16:01,501 INFO L226 Difference]: Without dead ends: 644 [2024-10-11 11:16:01,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:16:01,503 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 99 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:16:01,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 559 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:16:01,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2024-10-11 11:16:01,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 592. [2024-10-11 11:16:01,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 396 states have (on average 1.2904040404040404) internal successors, (511), 396 states have internal predecessors, (511), 190 states have call successors, (190), 5 states have call predecessors, (190), 5 states have return successors, (190), 190 states have call predecessors, (190), 190 states have call successors, (190) [2024-10-11 11:16:01,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 891 transitions. [2024-10-11 11:16:01,560 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 891 transitions. Word has length 242 [2024-10-11 11:16:01,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:16:01,560 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 891 transitions. [2024-10-11 11:16:01,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 1 states have call successors, (38) [2024-10-11 11:16:01,560 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 891 transitions. [2024-10-11 11:16:01,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-10-11 11:16:01,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:16:01,561 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:16:01,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 11:16:01,562 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:16:01,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:16:01,562 INFO L85 PathProgramCache]: Analyzing trace with hash -2102068931, now seen corresponding path program 1 times [2024-10-11 11:16:01,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:16:01,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094371972] [2024-10-11 11:16:01,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:16:01,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:16:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:16:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:16:01,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:16:01,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:16:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:16:01,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:16:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:16:01,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:16:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:16:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:16:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:16:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:16:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:16:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:16:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:16:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:16:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:16:01,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:16:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:16:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:16:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:16:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:16:01,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:16:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:16:01,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 11:16:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:16:01,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 11:16:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:16:01,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 11:16:01,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 11:16:01,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 11:16:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 11:16:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-11 11:16:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-11 11:16:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 11:16:01,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 11:16:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-11 11:16:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-11 11:16:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2024-10-11 11:16:01,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:16:01,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094371972] [2024-10-11 11:16:01,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094371972] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:16:01,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557361065] [2024-10-11 11:16:01,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:16:01,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:16:01,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:16:01,822 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 11:16:01,822 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 11:16:01,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:01,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 11:16:01,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:16:02,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 37 proven. 111 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-10-11 11:16:02,318 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:16:02,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2024-10-11 11:16:02,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557361065] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 11:16:02,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 11:16:02,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-11 11:16:02,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712335871] [2024-10-11 11:16:02,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 11:16:02,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 11:16:02,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:16:02,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 11:16:02,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:16:02,582 INFO L87 Difference]: Start difference. First operand 592 states and 891 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (75), 2 states have call predecessors, (75), 4 states have return successors, (76), 1 states have call predecessors, (76), 2 states have call successors, (76) [2024-10-11 11:16:02,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:16:02,921 INFO L93 Difference]: Finished difference Result 1067 states and 1593 transitions. [2024-10-11 11:16:02,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 11:16:02,925 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (75), 2 states have call predecessors, (75), 4 states have return successors, (76), 1 states have call predecessors, (76), 2 states have call successors, (76) Word has length 243 [2024-10-11 11:16:02,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:16:02,934 INFO L225 Difference]: With dead ends: 1067 [2024-10-11 11:16:02,934 INFO L226 Difference]: Without dead ends: 555 [2024-10-11 11:16:02,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 557 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-11 11:16:02,944 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 109 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:16:02,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 282 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:16:02,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-10-11 11:16:03,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 382. [2024-10-11 11:16:03,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 261 states have (on average 1.2796934865900382) internal successors, (334), 261 states have internal predecessors, (334), 114 states have call successors, (114), 6 states have call predecessors, (114), 6 states have return successors, (114), 114 states have call predecessors, (114), 114 states have call successors, (114) [2024-10-11 11:16:03,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 562 transitions. [2024-10-11 11:16:03,026 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 562 transitions. Word has length 243 [2024-10-11 11:16:03,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:16:03,027 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 562 transitions. [2024-10-11 11:16:03,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (75), 2 states have call predecessors, (75), 4 states have return successors, (76), 1 states have call predecessors, (76), 2 states have call successors, (76) [2024-10-11 11:16:03,028 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 562 transitions. [2024-10-11 11:16:03,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-10-11 11:16:03,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:16:03,029 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:16:03,049 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 11:16:03,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 11:16:03,230 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:16:03,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:16:03,231 INFO L85 PathProgramCache]: Analyzing trace with hash 509128002, now seen corresponding path program 1 times [2024-10-11 11:16:03,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:16:03,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113354583] [2024-10-11 11:16:03,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:16:03,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:16:03,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:03,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:16:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:03,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:16:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:03,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:16:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:03,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:16:03,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:03,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:16:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:03,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:16:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:03,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:16:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:03,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:16:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:03,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:16:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:03,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:16:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:03,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:16:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:03,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:16:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:03,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:16:03,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:03,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:16:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:03,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:16:03,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:03,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:16:03,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:03,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:16:03,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:03,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:16:03,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:03,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:16:03,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:03,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:16:03,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:03,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:16:03,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:03,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:16:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:03,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:16:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:03,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:16:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:03,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 11:16:03,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:04,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:16:04,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:04,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 11:16:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:04,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:16:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:04,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 11:16:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:04,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 11:16:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:04,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 11:16:04,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:04,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 11:16:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:04,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-11 11:16:04,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:04,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-11 11:16:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:04,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 11:16:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:04,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 11:16:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:04,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-11 11:16:04,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:04,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-11 11:16:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:04,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 39 proven. 72 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2024-10-11 11:16:04,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:16:04,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113354583] [2024-10-11 11:16:04,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113354583] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:16:04,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634697303] [2024-10-11 11:16:04,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:16:04,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:16:04,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:16:04,136 INFO L229 MonitoredProcess]: Starting monitored process 3 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 11:16:04,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 11:16:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:04,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 11:16:04,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:16:07,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 1311 proven. 72 refuted. 0 times theorem prover too weak. 1429 trivial. 0 not checked. [2024-10-11 11:16:07,408 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:16:08,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 39 proven. 72 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2024-10-11 11:16:08,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634697303] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 11:16:08,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 11:16:08,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 22 [2024-10-11 11:16:08,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199203743] [2024-10-11 11:16:08,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 11:16:08,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 11:16:08,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:16:08,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 11:16:08,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2024-10-11 11:16:08,697 INFO L87 Difference]: Start difference. First operand 382 states and 562 transitions. Second operand has 22 states, 22 states have (on average 7.7727272727272725) internal successors, (171), 22 states have internal predecessors, (171), 6 states have call successors, (114), 3 states have call predecessors, (114), 6 states have return successors, (114), 6 states have call predecessors, (114), 6 states have call successors, (114) [2024-10-11 11:16:10,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:16:10,034 INFO L93 Difference]: Finished difference Result 1090 states and 1565 transitions. [2024-10-11 11:16:10,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-11 11:16:10,035 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.7727272727272725) internal successors, (171), 22 states have internal predecessors, (171), 6 states have call successors, (114), 3 states have call predecessors, (114), 6 states have return successors, (114), 6 states have call predecessors, (114), 6 states have call successors, (114) Word has length 246 [2024-10-11 11:16:10,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:16:10,046 INFO L225 Difference]: With dead ends: 1090 [2024-10-11 11:16:10,049 INFO L226 Difference]: Without dead ends: 795 [2024-10-11 11:16:10,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 554 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=348, Invalid=984, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 11:16:10,052 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 724 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 353 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 353 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:16:10,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 914 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [353 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 11:16:10,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2024-10-11 11:16:10,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 621. [2024-10-11 11:16:10,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 426 states have (on average 1.2652582159624413) internal successors, (539), 428 states have internal predecessors, (539), 178 states have call successors, (178), 16 states have call predecessors, (178), 16 states have return successors, (178), 176 states have call predecessors, (178), 178 states have call successors, (178) [2024-10-11 11:16:10,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 895 transitions. [2024-10-11 11:16:10,170 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 895 transitions. Word has length 246 [2024-10-11 11:16:10,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:16:10,171 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 895 transitions. [2024-10-11 11:16:10,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.7727272727272725) internal successors, (171), 22 states have internal predecessors, (171), 6 states have call successors, (114), 3 states have call predecessors, (114), 6 states have return successors, (114), 6 states have call predecessors, (114), 6 states have call successors, (114) [2024-10-11 11:16:10,172 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 895 transitions. [2024-10-11 11:16:10,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-10-11 11:16:10,173 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:16:10,173 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:16:10,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 11:16:10,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:16:10,378 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:16:10,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:16:10,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1151837187, now seen corresponding path program 1 times [2024-10-11 11:16:10,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:16:10,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774282827] [2024-10-11 11:16:10,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:16:10,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:16:10,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 11:16:10,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1058898119] [2024-10-11 11:16:10,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:16:10,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:16:10,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:16:10,550 INFO L229 MonitoredProcess]: Starting monitored process 4 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 11:16:10,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 11:16:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:16:10,825 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 11:16:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:16:11,147 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 11:16:11,148 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 11:16:11,149 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:16:11,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 11:16:11,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:16:11,359 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:16:11,558 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:16:11,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:16:11 BoogieIcfgContainer [2024-10-11 11:16:11,562 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:16:11,563 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:16:11,563 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:16:11,563 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:16:11,563 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:15:27" (3/4) ... [2024-10-11 11:16:11,565 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 11:16:11,566 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:16:11,567 INFO L158 Benchmark]: Toolchain (without parser) took 45012.72ms. Allocated memory was 167.8MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 92.2MB in the beginning and 982.7MB in the end (delta: -890.5MB). Peak memory consumption was 524.5MB. Max. memory is 16.1GB. [2024-10-11 11:16:11,567 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 167.8MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:16:11,567 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.89ms. Allocated memory is still 167.8MB. Free memory was 92.0MB in the beginning and 73.1MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 11:16:11,568 INFO L158 Benchmark]: Boogie Procedure Inliner took 118.82ms. Allocated memory is still 167.8MB. Free memory was 73.1MB in the beginning and 135.1MB in the end (delta: -62.0MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2024-10-11 11:16:11,568 INFO L158 Benchmark]: Boogie Preprocessor took 109.81ms. Allocated memory is still 167.8MB. Free memory was 135.1MB in the beginning and 126.9MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 11:16:11,568 INFO L158 Benchmark]: RCFGBuilder took 681.03ms. Allocated memory is still 167.8MB. Free memory was 126.9MB in the beginning and 85.9MB in the end (delta: 41.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-10-11 11:16:11,569 INFO L158 Benchmark]: TraceAbstraction took 43760.78ms. Allocated memory was 167.8MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 85.9MB in the beginning and 983.7MB in the end (delta: -897.8MB). Peak memory consumption was 515.6MB. Max. memory is 16.1GB. [2024-10-11 11:16:11,569 INFO L158 Benchmark]: Witness Printer took 3.86ms. Allocated memory is still 1.6GB. Free memory was 983.7MB in the beginning and 982.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:16:11,570 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.19ms. Allocated memory is still 167.8MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 332.89ms. Allocated memory is still 167.8MB. Free memory was 92.0MB in the beginning and 73.1MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 118.82ms. Allocated memory is still 167.8MB. Free memory was 73.1MB in the beginning and 135.1MB in the end (delta: -62.0MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 109.81ms. Allocated memory is still 167.8MB. Free memory was 135.1MB in the beginning and 126.9MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 681.03ms. Allocated memory is still 167.8MB. Free memory was 126.9MB in the beginning and 85.9MB in the end (delta: 41.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 43760.78ms. Allocated memory was 167.8MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 85.9MB in the beginning and 983.7MB in the end (delta: -897.8MB). Peak memory consumption was 515.6MB. Max. memory is 16.1GB. * Witness Printer took 3.86ms. Allocated memory is still 1.6GB. Free memory was 983.7MB in the beginning and 982.7MB in the end (delta: 1.0MB). 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 someBinaryDOUBLEComparisonOperation at line 227, overapproximation of someBinaryArithmeticDOUBLEoperation at line 135. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_5 = 1; [L24] unsigned char var_1_6 = 1; [L25] unsigned char var_1_7 = 0; [L26] unsigned char var_1_8 = 128; [L27] unsigned short int var_1_10 = 5; [L28] unsigned char var_1_11 = 10; [L29] unsigned short int var_1_12 = 8; [L30] unsigned short int var_1_13 = 22843; [L31] unsigned char var_1_14 = 4; [L32] unsigned char var_1_15 = 128; [L33] unsigned char var_1_16 = 32; [L34] unsigned short int var_1_17 = 4; [L35] unsigned char var_1_18 = 25; [L36] double var_1_19 = 16.875; [L37] double var_1_20 = 15.475; [L38] double var_1_21 = 7.1; [L39] double var_1_22 = 256.5; [L40] double var_1_23 = 9.4; [L41] double var_1_24 = 4.75; [L42] double var_1_25 = 4.8; [L43] double var_1_26 = 128.5; [L44] unsigned char var_1_27 = 100; [L45] signed char var_1_28 = 0; [L46] signed char var_1_29 = 8; [L47] unsigned char var_1_30 = 0; [L48] unsigned long int var_1_31 = 5; [L49] unsigned long int var_1_32 = 2657034370; [L50] double var_1_33 = 0.0; [L51] double var_1_34 = 50.6; [L52] double var_1_35 = 0.0; [L53] double var_1_36 = 49.25; [L54] signed char var_1_37 = 100; [L55] signed char var_1_38 = 4; [L56] signed char var_1_39 = -4; [L57] signed long int var_1_40 = -8; [L58] unsigned short int last_1_var_1_12 = 8; [L59] unsigned short int last_1_var_1_17 = 4; [L60] unsigned char last_1_var_1_27 = 100; [L61] unsigned char last_1_var_1_30 = 0; [L62] unsigned long int last_1_var_1_31 = 5; [L63] signed char last_1_var_1_37 = 100; [L64] signed long int last_1_var_1_40 = -8; [L231] isInitial = 1 [L232] FCALL initially() [L233] COND TRUE 1 [L234] CALL updateLastVariables() [L218] last_1_var_1_12 = var_1_12 [L219] last_1_var_1_17 = var_1_17 [L220] last_1_var_1_27 = var_1_27 [L221] last_1_var_1_30 = var_1_30 [L222] last_1_var_1_31 = var_1_31 [L223] last_1_var_1_37 = var_1_37 [L224] last_1_var_1_40 = var_1_40 [L234] RET updateLastVariables() [L235] CALL updateVariables() [L154] var_1_5 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=5, var_1_11=10, var_1_12=8, var_1_13=22843, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=5, var_1_11=10, var_1_12=8, var_1_13=22843, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L155] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=5, var_1_11=10, var_1_12=8, var_1_13=22843, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L156] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=5, var_1_11=10, var_1_12=8, var_1_13=22843, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=5, var_1_11=10, var_1_12=8, var_1_13=22843, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L156] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=5, var_1_11=10, var_1_12=8, var_1_13=22843, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L157] var_1_6 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_6 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=5, var_1_11=10, var_1_12=8, var_1_13=22843, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=5, var_1_11=10, var_1_12=8, var_1_13=22843, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L158] RET assume_abort_if_not(var_1_6 >= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=5, var_1_11=10, var_1_12=8, var_1_13=22843, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L159] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=5, var_1_11=10, var_1_12=8, var_1_13=22843, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=5, var_1_11=10, var_1_12=8, var_1_13=22843, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L159] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=5, var_1_11=10, var_1_12=8, var_1_13=22843, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L160] var_1_7 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=5, var_1_11=10, var_1_12=8, var_1_13=22843, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=5, var_1_11=10, var_1_12=8, var_1_13=22843, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_8=128] [L161] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=5, var_1_11=10, var_1_12=8, var_1_13=22843, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_8=128] [L162] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=5, var_1_11=10, var_1_12=8, var_1_13=22843, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=5, var_1_11=10, var_1_12=8, var_1_13=22843, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L162] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=5, var_1_11=10, var_1_12=8, var_1_13=22843, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L163] var_1_10 = __VERIFIER_nondet_ushort() [L164] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_11=10, var_1_12=8, var_1_13=22843, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_11=10, var_1_12=8, var_1_13=22843, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L164] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_11=10, var_1_12=8, var_1_13=22843, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L165] CALL assume_abort_if_not(var_1_10 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_11=10, var_1_12=8, var_1_13=22843, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_11=10, var_1_12=8, var_1_13=22843, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L165] RET assume_abort_if_not(var_1_10 <= 65535) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_11=10, var_1_12=8, var_1_13=22843, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L166] CALL assume_abort_if_not(var_1_10 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=10, var_1_12=8, var_1_13=22843, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=10, var_1_12=8, var_1_13=22843, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L166] RET assume_abort_if_not(var_1_10 != 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=10, var_1_12=8, var_1_13=22843, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L167] var_1_11 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_12=8, var_1_13=22843, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_12=8, var_1_13=22843, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L168] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_12=8, var_1_13=22843, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L169] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=22843, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=22843, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L169] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=22843, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L170] var_1_13 = __VERIFIER_nondet_ushort() [L171] CALL assume_abort_if_not(var_1_13 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L171] RET assume_abort_if_not(var_1_13 >= 16383) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L172] CALL assume_abort_if_not(var_1_13 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L172] RET assume_abort_if_not(var_1_13 <= 32767) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L173] var_1_15 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_15 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L174] RET assume_abort_if_not(var_1_15 >= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L175] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L175] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=32, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L176] var_1_16 = __VERIFIER_nondet_uchar() [L177] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L177] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L178] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L178] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_20=619/40, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L179] var_1_20 = __VERIFIER_nondet_double() [L180] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L180] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_21=71/10, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L181] var_1_21 = __VERIFIER_nondet_double() [L182] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L182] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_22=513/2, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L183] var_1_22 = __VERIFIER_nondet_double() [L184] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L184] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_23=47/5, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L185] var_1_23 = __VERIFIER_nondet_double() [L186] CALL assume_abort_if_not((var_1_23 >= -461168.6018427382800e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L186] RET assume_abort_if_not((var_1_23 >= -461168.6018427382800e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_24=19/4, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L187] var_1_24 = __VERIFIER_nondet_double() [L188] CALL assume_abort_if_not((var_1_24 >= -115292.1504606845700e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 1152921.504606845700e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L188] RET assume_abort_if_not((var_1_24 >= -115292.1504606845700e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 1152921.504606845700e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_25=24/5, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L189] var_1_25 = __VERIFIER_nondet_double() [L190] CALL assume_abort_if_not((var_1_25 >= -115292.1504606845700e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 1152921.504606845700e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L190] RET assume_abort_if_not((var_1_25 >= -115292.1504606845700e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 1152921.504606845700e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_26=257/2, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L191] var_1_26 = __VERIFIER_nondet_double() [L192] CALL assume_abort_if_not((var_1_26 >= -230584.3009213691390e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 2305843.009213691390e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L192] RET assume_abort_if_not((var_1_26 >= -230584.3009213691390e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 2305843.009213691390e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L193] var_1_28 = __VERIFIER_nondet_char() [L194] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L194] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L195] CALL assume_abort_if_not(var_1_28 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L195] RET assume_abort_if_not(var_1_28 <= 64) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=8, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L196] var_1_29 = __VERIFIER_nondet_char() [L197] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L197] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L198] CALL assume_abort_if_not(var_1_29 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L198] RET assume_abort_if_not(var_1_29 <= 63) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=2657034370, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L199] var_1_32 = __VERIFIER_nondet_ulong() [L200] CALL assume_abort_if_not(var_1_32 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=-70866960385, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=-70866960385, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L200] RET assume_abort_if_not(var_1_32 >= 2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=-70866960385, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L201] CALL assume_abort_if_not(var_1_32 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=-70866960385, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=-70866960385, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L201] RET assume_abort_if_not(var_1_32 <= 4294967294) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=-70866960385, var_1_33=0, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L202] var_1_33 = __VERIFIER_nondet_double() [L203] CALL assume_abort_if_not((var_1_33 >= 4611686.018427387900e+12F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854776000e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=-70866960385, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=-70866960385, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L203] RET assume_abort_if_not((var_1_33 >= 4611686.018427387900e+12F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854776000e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=-70866960385, var_1_34=253/5, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L204] var_1_34 = __VERIFIER_nondet_double() [L205] CALL assume_abort_if_not((var_1_34 >= 0.0F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 4611686.018427387900e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=-70866960385, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=-70866960385, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L205] RET assume_abort_if_not((var_1_34 >= 0.0F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 4611686.018427387900e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=-70866960385, var_1_35=0, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L206] var_1_35 = __VERIFIER_nondet_double() [L207] CALL assume_abort_if_not((var_1_35 >= 4611686.018427387900e+12F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854776000e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=-70866960385, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=-70866960385, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L207] RET assume_abort_if_not((var_1_35 >= 4611686.018427387900e+12F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854776000e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=-70866960385, var_1_36=197/4, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L208] var_1_36 = __VERIFIER_nondet_double() [L209] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 4611686.018427387900e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=-70866960385, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=-70866960385, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L209] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 4611686.018427387900e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=-70866960385, var_1_37=100, var_1_38=4, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L210] var_1_38 = __VERIFIER_nondet_char() [L211] CALL assume_abort_if_not(var_1_38 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=-70866960385, var_1_37=100, var_1_38=30, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=-70866960385, var_1_37=100, var_1_38=30, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L211] RET assume_abort_if_not(var_1_38 >= -31) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=-70866960385, var_1_37=100, var_1_38=30, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L212] CALL assume_abort_if_not(var_1_38 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=-70866960385, var_1_37=100, var_1_38=30, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=-70866960385, var_1_37=100, var_1_38=30, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L212] RET assume_abort_if_not(var_1_38 <= 32) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=-70866960385, var_1_37=100, var_1_38=30, var_1_39=-4, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L213] var_1_39 = __VERIFIER_nondet_char() [L214] CALL assume_abort_if_not(var_1_39 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=-70866960385, var_1_37=100, var_1_38=30, var_1_39=-29, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=-70866960385, var_1_37=100, var_1_38=30, var_1_39=-29, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L214] RET assume_abort_if_not(var_1_39 >= -31) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=-70866960385, var_1_37=100, var_1_38=30, var_1_39=-29, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L215] CALL assume_abort_if_not(var_1_39 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=-70866960385, var_1_37=100, var_1_38=30, var_1_39=-29, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=-70866960385, var_1_37=100, var_1_38=30, var_1_39=-29, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L215] RET assume_abort_if_not(var_1_39 <= 31) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=-70866960385, var_1_37=100, var_1_38=30, var_1_39=-29, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L235] RET updateVariables() [L236] CALL step() [L68] signed long int stepLocal_1 = last_1_var_1_27; [L69] signed long int stepLocal_0 = last_1_var_1_27; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, stepLocal_0=100, stepLocal_1=100, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=-70866960385, var_1_37=100, var_1_38=30, var_1_39=-29, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L70] COND TRUE last_1_var_1_17 != stepLocal_0 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, stepLocal_1=100, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=-70866960385, var_1_37=100, var_1_38=30, var_1_39=-29, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L71] COND TRUE stepLocal_1 >= (last_1_var_1_17 + last_1_var_1_31) [L72] var_1_1 = var_1_5 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=-70866960385, var_1_37=100, var_1_38=30, var_1_39=-29, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L81] signed long int stepLocal_2 = (((256) > (last_1_var_1_12)) ? (256) : (last_1_var_1_12)); VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, stepLocal_2=256, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=-70866960385, var_1_37=100, var_1_38=30, var_1_39=-29, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L82] COND FALSE !(\read(last_1_var_1_30)) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, stepLocal_2=256, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=-70866960385, var_1_37=100, var_1_38=30, var_1_39=-29, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L89] COND TRUE \read(var_1_1) [L90] var_1_30 = 1 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, stepLocal_2=256, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=1, var_1_31=5, var_1_32=-70866960385, var_1_37=100, var_1_38=30, var_1_39=-29, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L94] signed long int stepLocal_7 = var_1_15 - ((((var_1_16) > (var_1_28)) ? (var_1_16) : (var_1_28))); VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, stepLocal_2=256, stepLocal_7=99, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=1, var_1_31=5, var_1_32=-70866960385, var_1_37=100, var_1_38=30, var_1_39=-29, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L95] COND TRUE stepLocal_7 < (last_1_var_1_37 / ((((var_1_13) < (var_1_10)) ? (var_1_13) : (var_1_10)))) [L96] var_1_37 = ((var_1_38 + var_1_39) + var_1_29) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, stepLocal_2=256, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=1, var_1_31=5, var_1_32=-70866960385, var_1_37=1, var_1_38=30, var_1_39=-29, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L100] var_1_40 = last_1_var_1_40 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, stepLocal_2=256, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=4, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=1, var_1_31=5, var_1_32=-70866960385, var_1_37=1, var_1_38=30, var_1_39=-29, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L101] COND FALSE !(! var_1_1) [L108] var_1_17 = var_1_15 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, stepLocal_2=256, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=128, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=1, var_1_31=5, var_1_32=-70866960385, var_1_37=1, var_1_38=30, var_1_39=-29, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L110] COND TRUE \read(var_1_1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, stepLocal_2=256, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=128, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=1, var_1_31=5, var_1_32=-70866960385, var_1_37=1, var_1_38=30, var_1_39=-29, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L111] EXPR var_1_16 << var_1_37 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, stepLocal_2=256, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=128, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=1, var_1_31=5, var_1_32=-70866960385, var_1_37=1, var_1_38=30, var_1_39=-29, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L111] COND TRUE ((((var_1_13) < (var_1_37)) ? (var_1_13) : (var_1_37))) > ((var_1_16 << var_1_37) / var_1_15) [L112] var_1_18 = ((((2) > (var_1_11)) ? (2) : (var_1_11))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, stepLocal_2=256, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=128, var_1_18=129, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=1, var_1_31=5, var_1_32=-70866960385, var_1_37=1, var_1_38=30, var_1_39=-29, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L115] COND TRUE var_1_17 > var_1_14 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, stepLocal_2=256, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=128, var_1_18=129, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=1, var_1_31=5, var_1_32=-70866960385, var_1_37=1, var_1_38=30, var_1_39=-29, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L116] COND FALSE !(var_1_18 == var_1_17) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, stepLocal_2=256, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=128, var_1_18=129, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=1, var_1_31=5, var_1_32=-70866960385, var_1_37=1, var_1_38=30, var_1_39=-29, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L120] COND FALSE !(! var_1_1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, stepLocal_2=256, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=128, var_1_18=129, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=1, var_1_31=5, var_1_32=-70866960385, var_1_37=1, var_1_38=30, var_1_39=-29, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L125] signed long int stepLocal_5 = var_1_16 - (var_1_28 + var_1_29); VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, stepLocal_2=256, stepLocal_5=-29, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=128, var_1_18=129, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=29, var_1_29=0, var_1_30=1, var_1_31=5, var_1_32=-70866960385, var_1_37=1, var_1_38=30, var_1_39=-29, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L126] COND TRUE stepLocal_5 <= var_1_12 [L127] var_1_27 = ((((var_1_29) > (var_1_28)) ? (var_1_29) : (var_1_28))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, stepLocal_2=256, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=128, var_1_18=129, var_1_19=135/8, var_1_1=1, var_1_27=29, var_1_28=29, var_1_29=0, var_1_30=1, var_1_31=5, var_1_32=-70866960385, var_1_37=1, var_1_38=30, var_1_39=-29, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L131] unsigned char stepLocal_4 = var_1_14; [L132] unsigned char stepLocal_3 = var_1_14 <= var_1_8; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, stepLocal_2=256, stepLocal_3=1, stepLocal_4=4, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=128, var_1_18=129, var_1_19=135/8, var_1_1=1, var_1_27=29, var_1_28=29, var_1_29=0, var_1_30=1, var_1_31=5, var_1_32=-70866960385, var_1_37=1, var_1_38=30, var_1_39=-29, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L133] COND TRUE var_1_5 && stepLocal_3 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, stepLocal_2=256, stepLocal_4=4, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=128, var_1_18=129, var_1_19=135/8, var_1_1=1, var_1_27=29, var_1_28=29, var_1_29=0, var_1_30=1, var_1_31=5, var_1_32=-70866960385, var_1_37=1, var_1_38=30, var_1_39=-29, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L134] COND TRUE stepLocal_4 > var_1_40 [L135] var_1_19 = (((((var_1_20 - var_1_21)) < (var_1_22)) ? ((var_1_20 - var_1_21)) : (var_1_22))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, stepLocal_2=256, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=128, var_1_18=129, var_1_19=2, var_1_1=1, var_1_22=0, var_1_27=29, var_1_28=29, var_1_29=0, var_1_30=1, var_1_31=5, var_1_32=-70866960385, var_1_37=1, var_1_38=30, var_1_39=-29, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L140] signed long int stepLocal_6 = var_1_27 + var_1_8; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, stepLocal_2=256, stepLocal_6=157, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=128, var_1_18=129, var_1_19=2, var_1_1=1, var_1_22=0, var_1_27=29, var_1_28=29, var_1_29=0, var_1_30=1, var_1_31=5, var_1_32=-70866960385, var_1_37=1, var_1_38=30, var_1_39=-29, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L141] COND TRUE var_1_19 != var_1_22 [L142] var_1_31 = (var_1_32 - (var_1_40 + var_1_13)) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, stepLocal_2=256, stepLocal_6=157, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=128, var_1_18=129, var_1_19=2, var_1_1=1, var_1_22=0, var_1_27=29, var_1_28=29, var_1_29=0, var_1_30=1, var_1_31=-70866976760, var_1_32=-70866960385, var_1_37=1, var_1_38=30, var_1_39=-29, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L236] RET step() [L237] CALL, EXPR property() [L227] EXPR ((((((last_1_var_1_17 != last_1_var_1_27) ? ((last_1_var_1_27 >= (last_1_var_1_17 + last_1_var_1_31)) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_5 ? (var_1_1 == ((unsigned char) var_1_6)) : 1)) : (var_1_1 == ((unsigned char) var_1_7))) && ((! var_1_1) ? ((var_1_12 > (var_1_14 % var_1_10)) ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1)) && ((var_1_17 > var_1_14) ? ((var_1_18 == var_1_17) ? (var_1_12 == ((unsigned short int) ((var_1_13 - var_1_11) + var_1_17))) : 1) : 1)) && (last_1_var_1_30 ? ((var_1_13 > ((((256) > (last_1_var_1_12)) ? (256) : (last_1_var_1_12)))) ? (var_1_14 == ((unsigned char) (var_1_15 - var_1_16))) : (var_1_14 == ((unsigned char) (var_1_16 + 10)))) : 1)) && ((! var_1_1) ? ((! (! (! var_1_5))) ? (var_1_17 == ((unsigned short int) var_1_14)) : (var_1_17 == ((unsigned short int) var_1_13))) : (var_1_17 == ((unsigned short int) var_1_15)))) && (var_1_1 ? ((((((var_1_13) < (var_1_37)) ? (var_1_13) : (var_1_37))) > ((var_1_16 << var_1_37) / var_1_15)) ? (var_1_18 == ((unsigned char) ((((2) > (var_1_11)) ? (2) : (var_1_11))))) : 1) : 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=128, var_1_18=129, var_1_19=2, var_1_1=1, var_1_22=0, var_1_27=29, var_1_28=29, var_1_29=0, var_1_30=1, var_1_31=-70866976760, var_1_32=-70866960385, var_1_37=1, var_1_38=30, var_1_39=-29, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L227] EXPR var_1_1 ? ((((((var_1_13) < (var_1_37)) ? (var_1_13) : (var_1_37))) > ((var_1_16 << var_1_37) / var_1_15)) ? (var_1_18 == ((unsigned char) ((((2) > (var_1_11)) ? (2) : (var_1_11))))) : 1) : 1 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=128, var_1_18=129, var_1_19=2, var_1_1=1, var_1_22=0, var_1_27=29, var_1_28=29, var_1_29=0, var_1_30=1, var_1_31=-70866976760, var_1_32=-70866960385, var_1_37=1, var_1_38=30, var_1_39=-29, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L227] EXPR var_1_16 << var_1_37 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=128, var_1_18=129, var_1_19=2, var_1_1=1, var_1_22=0, var_1_27=29, var_1_28=29, var_1_29=0, var_1_30=1, var_1_31=-70866976760, var_1_32=-70866960385, var_1_37=1, var_1_38=30, var_1_39=-29, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L227] EXPR var_1_1 ? ((((((var_1_13) < (var_1_37)) ? (var_1_13) : (var_1_37))) > ((var_1_16 << var_1_37) / var_1_15)) ? (var_1_18 == ((unsigned char) ((((2) > (var_1_11)) ? (2) : (var_1_11))))) : 1) : 1 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=128, var_1_18=129, var_1_19=2, var_1_1=1, var_1_22=0, var_1_27=29, var_1_28=29, var_1_29=0, var_1_30=1, var_1_31=-70866976760, var_1_32=-70866960385, var_1_37=1, var_1_38=30, var_1_39=-29, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L227] EXPR ((((((last_1_var_1_17 != last_1_var_1_27) ? ((last_1_var_1_27 >= (last_1_var_1_17 + last_1_var_1_31)) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_5 ? (var_1_1 == ((unsigned char) var_1_6)) : 1)) : (var_1_1 == ((unsigned char) var_1_7))) && ((! var_1_1) ? ((var_1_12 > (var_1_14 % var_1_10)) ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1)) && ((var_1_17 > var_1_14) ? ((var_1_18 == var_1_17) ? (var_1_12 == ((unsigned short int) ((var_1_13 - var_1_11) + var_1_17))) : 1) : 1)) && (last_1_var_1_30 ? ((var_1_13 > ((((256) > (last_1_var_1_12)) ? (256) : (last_1_var_1_12)))) ? (var_1_14 == ((unsigned char) (var_1_15 - var_1_16))) : (var_1_14 == ((unsigned char) (var_1_16 + 10)))) : 1)) && ((! var_1_1) ? ((! (! (! var_1_5))) ? (var_1_17 == ((unsigned short int) var_1_14)) : (var_1_17 == ((unsigned short int) var_1_13))) : (var_1_17 == ((unsigned short int) var_1_15)))) && (var_1_1 ? ((((((var_1_13) < (var_1_37)) ? (var_1_13) : (var_1_37))) > ((var_1_16 << var_1_37) / var_1_15)) ? (var_1_18 == ((unsigned char) ((((2) > (var_1_11)) ? (2) : (var_1_11))))) : 1) : 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=128, var_1_18=129, var_1_19=2, var_1_1=1, var_1_22=0, var_1_27=29, var_1_28=29, var_1_29=0, var_1_30=1, var_1_31=-70866976760, var_1_32=-70866960385, var_1_37=1, var_1_38=30, var_1_39=-29, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L227-L228] return ((((((((((((last_1_var_1_17 != last_1_var_1_27) ? ((last_1_var_1_27 >= (last_1_var_1_17 + last_1_var_1_31)) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_5 ? (var_1_1 == ((unsigned char) var_1_6)) : 1)) : (var_1_1 == ((unsigned char) var_1_7))) && ((! var_1_1) ? ((var_1_12 > (var_1_14 % var_1_10)) ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1)) && ((var_1_17 > var_1_14) ? ((var_1_18 == var_1_17) ? (var_1_12 == ((unsigned short int) ((var_1_13 - var_1_11) + var_1_17))) : 1) : 1)) && (last_1_var_1_30 ? ((var_1_13 > ((((256) > (last_1_var_1_12)) ? (256) : (last_1_var_1_12)))) ? (var_1_14 == ((unsigned char) (var_1_15 - var_1_16))) : (var_1_14 == ((unsigned char) (var_1_16 + 10)))) : 1)) && ((! var_1_1) ? ((! (! (! var_1_5))) ? (var_1_17 == ((unsigned short int) var_1_14)) : (var_1_17 == ((unsigned short int) var_1_13))) : (var_1_17 == ((unsigned short int) var_1_15)))) && (var_1_1 ? ((((((var_1_13) < (var_1_37)) ? (var_1_13) : (var_1_37))) > ((var_1_16 << var_1_37) / var_1_15)) ? (var_1_18 == ((unsigned char) ((((2) > (var_1_11)) ? (2) : (var_1_11))))) : 1) : 1)) && ((var_1_5 && (var_1_14 <= var_1_8)) ? ((var_1_14 > var_1_40) ? (var_1_19 == ((double) (((((var_1_20 - var_1_21)) < (var_1_22)) ? ((var_1_20 - var_1_21)) : (var_1_22))))) : 1) : (var_1_19 == ((double) (var_1_23 + ((var_1_24 + var_1_25) + var_1_26)))))) && (((var_1_16 - (var_1_28 + var_1_29)) <= var_1_12) ? (var_1_27 == ((unsigned char) ((((var_1_29) > (var_1_28)) ? (var_1_29) : (var_1_28))))) : (var_1_27 == ((unsigned char) var_1_29)))) && (var_1_1 ? (var_1_30 == ((unsigned char) 1)) : (var_1_30 == ((unsigned char) (! var_1_5))))) && ((var_1_19 != var_1_22) ? (var_1_31 == ((unsigned long int) (var_1_32 - (var_1_40 + var_1_13)))) : (((var_1_27 + var_1_8) >= (var_1_15 + var_1_29)) ? (((var_1_24 * (var_1_23 * var_1_19)) >= ((var_1_33 - var_1_34) - (var_1_35 - var_1_36))) ? (var_1_31 == ((unsigned long int) var_1_8)) : (var_1_31 == ((unsigned long int) last_1_var_1_31))) : 1))) && (((var_1_15 - ((((var_1_16) > (var_1_28)) ? (var_1_16) : (var_1_28)))) < (last_1_var_1_37 / ((((var_1_13) < (var_1_10)) ? (var_1_13) : (var_1_10))))) ? (var_1_37 == ((signed char) ((var_1_38 + var_1_39) + var_1_29))) : (var_1_37 == ((signed char) ((((var_1_28) < (var_1_38)) ? (var_1_28) : (var_1_38))))))) && (var_1_40 == ((signed long int) last_1_var_1_40)) ; [L237] RET, EXPR property() [L237] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=128, var_1_18=129, var_1_19=2, var_1_1=1, var_1_22=0, var_1_27=29, var_1_28=29, var_1_29=0, var_1_30=1, var_1_31=-70866976760, var_1_32=-70866960385, var_1_37=1, var_1_38=30, var_1_39=-29, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=4, last_1_var_1_27=100, last_1_var_1_30=0, last_1_var_1_31=5, last_1_var_1_37=100, last_1_var_1_40=-8, var_1_10=1, var_1_11=129, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=128, var_1_16=-256, var_1_17=128, var_1_18=129, var_1_19=2, var_1_1=1, var_1_22=0, var_1_27=29, var_1_28=29, var_1_29=0, var_1_30=1, var_1_31=-70866976760, var_1_32=-70866960385, var_1_37=1, var_1_38=30, var_1_39=-29, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 111 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 43.5s, OverallIterations: 15, TraceHistogramMax: 38, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3246 SdHoareTripleChecker+Valid, 7.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3170 mSDsluCounter, 7295 SdHoareTripleChecker+Invalid, 6.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4974 mSDsCounter, 973 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4026 IncrementalHoareTripleChecker+Invalid, 4999 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 973 mSolverCounterUnsat, 2321 mSDtfsCounter, 4026 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2225 GetRequests, 2106 SyntacticMatches, 2 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=621occurred in iteration=14, InterpolantAutomatonStates: 112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 14 MinimizatonAttempts, 1234 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 28.1s InterpolantComputationTime, 4359 NumberOfCodeBlocks, 4359 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 4336 ConstructedInterpolants, 0 QuantifiedInterpolants, 34805 SizeOfPredicates, 34 NumberOfNonLiveVariables, 1119 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 18 InterpolantComputations, 12 PerfectInterpolantSequences, 50067/50616 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 11:16:11,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-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_loopvsstraightlinecode_100-while_file-29.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 89fb3437dc022c4b5e6c8772f3270e161abf7529bebe371d9c5e10b428f306b8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:16:14,206 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:16:14,273 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 11:16:14,280 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:16:14,280 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:16:14,308 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:16:14,309 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:16:14,309 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:16:14,310 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:16:14,311 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:16:14,313 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:16:14,313 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:16:14,314 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:16:14,314 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:16:14,314 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:16:14,314 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:16:14,314 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:16:14,315 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:16:14,315 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:16:14,315 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:16:14,316 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:16:14,316 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:16:14,317 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:16:14,317 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 11:16:14,317 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 11:16:14,317 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:16:14,318 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 11:16:14,318 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:16:14,318 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:16:14,318 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:16:14,319 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:16:14,319 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:16:14,319 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:16:14,320 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:16:14,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:16:14,320 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:16:14,321 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:16:14,321 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:16:14,321 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 11:16:14,321 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 11:16:14,322 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:16:14,322 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:16:14,322 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:16:14,322 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:16:14,322 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 11:16:14,322 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 -> 89fb3437dc022c4b5e6c8772f3270e161abf7529bebe371d9c5e10b428f306b8 [2024-10-11 11:16:14,605 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:16:14,637 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:16:14,639 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:16:14,644 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:16:14,648 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:16:14,649 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-29.i [2024-10-11 11:16:16,305 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:16:16,565 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:16:16,565 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-29.i [2024-10-11 11:16:16,573 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5aac86436/a13aedd187af425890fb8c03f6e85f1a/FLAG0ea8b45de [2024-10-11 11:16:16,584 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5aac86436/a13aedd187af425890fb8c03f6e85f1a [2024-10-11 11:16:16,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:16:16,587 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:16:16,588 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:16:16,588 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:16:16,595 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:16:16,596 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:16:16" (1/1) ... [2024-10-11 11:16:16,597 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65af0bf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:16, skipping insertion in model container [2024-10-11 11:16:16,597 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:16:16" (1/1) ... [2024-10-11 11:16:16,626 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:16:16,763 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-29.i[916,929] [2024-10-11 11:16:16,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:16:16,877 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:16:16,890 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-29.i[916,929] [2024-10-11 11:16:16,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:16:16,964 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:16:16,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:16 WrapperNode [2024-10-11 11:16:16,964 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:16:16,965 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:16:16,965 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:16:16,965 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:16:16,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:16" (1/1) ... [2024-10-11 11:16:16,996 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:16" (1/1) ... [2024-10-11 11:16:17,050 INFO L138 Inliner]: procedures = 27, calls = 51, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 246 [2024-10-11 11:16:17,050 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:16:17,051 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:16:17,051 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:16:17,051 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:16:17,070 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:16" (1/1) ... [2024-10-11 11:16:17,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:16" (1/1) ... [2024-10-11 11:16:17,074 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:16" (1/1) ... [2024-10-11 11:16:17,100 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 11:16:17,101 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:16" (1/1) ... [2024-10-11 11:16:17,101 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:16" (1/1) ... [2024-10-11 11:16:17,117 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:16" (1/1) ... [2024-10-11 11:16:17,124 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:16" (1/1) ... [2024-10-11 11:16:17,126 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:16" (1/1) ... [2024-10-11 11:16:17,132 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:16" (1/1) ... [2024-10-11 11:16:17,139 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:16:17,140 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:16:17,144 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:16:17,144 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:16:17,145 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:16" (1/1) ... [2024-10-11 11:16:17,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:16:17,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:16:17,182 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 11:16:17,208 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 11:16:17,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:16:17,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 11:16:17,242 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:16:17,242 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:16:17,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:16:17,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:16:17,364 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:16:17,366 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:16:31,688 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-11 11:16:31,689 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:16:31,761 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:16:31,763 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:16:31,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:16:31 BoogieIcfgContainer [2024-10-11 11:16:31,764 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:16:31,766 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:16:31,767 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:16:31,770 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:16:31,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:16:16" (1/3) ... [2024-10-11 11:16:31,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b8d4ebd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:16:31, skipping insertion in model container [2024-10-11 11:16:31,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:16:16" (2/3) ... [2024-10-11 11:16:31,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b8d4ebd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:16:31, skipping insertion in model container [2024-10-11 11:16:31,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:16:31" (3/3) ... [2024-10-11 11:16:31,774 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-29.i [2024-10-11 11:16:31,791 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:16:31,792 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:16:31,901 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:16:31,907 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;@7953f5d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:16:31,907 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:16:31,912 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 62 states have internal predecessors, (87), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 11:16:31,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-10-11 11:16:31,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:16:31,927 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:16:31,927 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:16:31,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:16:31,932 INFO L85 PathProgramCache]: Analyzing trace with hash -169731928, now seen corresponding path program 1 times [2024-10-11 11:16:31,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:16:31,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [794168172] [2024-10-11 11:16:31,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:16:31,945 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 11:16:31,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:16:31,950 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 11:16:31,968 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 11:16:33,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:33,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 11:16:33,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:16:33,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 818 proven. 0 refuted. 0 times theorem prover too weak. 1994 trivial. 0 not checked. [2024-10-11 11:16:33,320 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:16:33,321 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:16:33,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [794168172] [2024-10-11 11:16:33,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [794168172] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:16:33,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:16:33,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:16:33,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020030199] [2024-10-11 11:16:33,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:16:33,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:16:33,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:16:33,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:16:33,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:16:33,354 INFO L87 Difference]: Start difference. First operand has 102 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 62 states have internal predecessors, (87), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2024-10-11 11:16:37,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:16:37,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:16:37,825 INFO L93 Difference]: Finished difference Result 201 states and 362 transitions. [2024-10-11 11:16:37,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:16:37,974 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 236 [2024-10-11 11:16:37,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:16:37,982 INFO L225 Difference]: With dead ends: 201 [2024-10-11 11:16:37,983 INFO L226 Difference]: Without dead ends: 100 [2024-10-11 11:16:37,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 235 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 11:16:37,989 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-11 11:16:37,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2024-10-11 11:16:38,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-11 11:16:38,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-10-11 11:16:38,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 60 states have internal predecessors, (82), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 11:16:38,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 158 transitions. [2024-10-11 11:16:38,054 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 158 transitions. Word has length 236 [2024-10-11 11:16:38,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:16:38,055 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 158 transitions. [2024-10-11 11:16:38,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2024-10-11 11:16:38,056 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 158 transitions. [2024-10-11 11:16:38,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-10-11 11:16:38,061 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:16:38,061 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:16:38,105 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 11:16:38,262 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 11:16:38,263 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:16:38,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:16:38,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1446206352, now seen corresponding path program 1 times [2024-10-11 11:16:38,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:16:38,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [560832810] [2024-10-11 11:16:38,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:16:38,266 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 11:16:38,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:16:38,269 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 11:16:38,271 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 11:16:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:16:39,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 11:16:39,506 INFO L278 TraceCheckSpWp]: Computing forward predicates...