./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-1loop_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-1loop_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 fccc32608678fc6fd4cb86e7f394d0f05414cafa3a24a1c8162582b5a3f5da8c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:04:13,414 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:04:13,479 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:04:13,485 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:04:13,485 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:04:13,520 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:04:13,521 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:04:13,521 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:04:13,522 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:04:13,523 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:04:13,523 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:04:13,524 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:04:13,524 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:04:13,525 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:04:13,526 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:04:13,527 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:04:13,527 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:04:13,528 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:04:13,531 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:04:13,531 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:04:13,531 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:04:13,531 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:04:13,532 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:04:13,532 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:04:13,532 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:04:13,532 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:04:13,532 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:04:13,533 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:04:13,533 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:04:13,533 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:04:13,533 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:04:13,534 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:04:13,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:04:13,534 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:04:13,534 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:04:13,534 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:04:13,535 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:04:13,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:04:13,537 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:04:13,537 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:04:13,537 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:04:13,538 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:04:13,538 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 -> fccc32608678fc6fd4cb86e7f394d0f05414cafa3a24a1c8162582b5a3f5da8c [2024-10-11 11:04:13,829 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:04:13,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:04:13,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:04:13,856 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:04:13,856 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:04:13,857 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-29.i [2024-10-11 11:04:15,322 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:04:15,553 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:04:15,554 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-29.i [2024-10-11 11:04:15,574 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/227312b16/2029d0eb13294281be3df623d5af3a8f/FLAGb0e3e7314 [2024-10-11 11:04:15,589 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/227312b16/2029d0eb13294281be3df623d5af3a8f [2024-10-11 11:04:15,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:04:15,593 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:04:15,596 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:04:15,596 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:04:15,601 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:04:15,602 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:04:15" (1/1) ... [2024-10-11 11:04:15,603 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57e8574a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:04:15, skipping insertion in model container [2024-10-11 11:04:15,603 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:04:15" (1/1) ... [2024-10-11 11:04:15,652 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:04:15,827 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-1loop_file-29.i[916,929] [2024-10-11 11:04:15,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:04:15,940 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:04:15,952 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-1loop_file-29.i[916,929] [2024-10-11 11:04:15,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:04:16,018 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:04:16,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:04:16 WrapperNode [2024-10-11 11:04:16,022 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:04:16,023 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:04:16,023 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:04:16,023 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:04:16,032 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:04:16" (1/1) ... [2024-10-11 11:04:16,058 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:04:16" (1/1) ... [2024-10-11 11:04:16,111 INFO L138 Inliner]: procedures = 26, calls = 51, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 279 [2024-10-11 11:04:16,112 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:04:16,113 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:04:16,113 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:04:16,113 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:04:16,125 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:04:16" (1/1) ... [2024-10-11 11:04:16,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:04:16" (1/1) ... [2024-10-11 11:04:16,130 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:04:16" (1/1) ... [2024-10-11 11:04:16,151 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:04:16,151 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:04:16" (1/1) ... [2024-10-11 11:04:16,152 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:04:16" (1/1) ... [2024-10-11 11:04:16,165 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:04:16" (1/1) ... [2024-10-11 11:04:16,169 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:04:16" (1/1) ... [2024-10-11 11:04:16,173 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:04:16" (1/1) ... [2024-10-11 11:04:16,175 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:04:16" (1/1) ... [2024-10-11 11:04:16,182 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:04:16,183 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:04:16,184 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:04:16,184 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:04:16,185 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:04:16" (1/1) ... [2024-10-11 11:04:16,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:04:16,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:04:16,227 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:04:16,233 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:04:16,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:04:16,281 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:04:16,282 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:04:16,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:04:16,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:04:16,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:04:16,440 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:04:16,446 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:04:16,956 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-10-11 11:04:16,957 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:04:17,007 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:04:17,007 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:04:17,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:04:17 BoogieIcfgContainer [2024-10-11 11:04:17,008 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:04:17,010 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:04:17,011 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:04:17,014 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:04:17,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:04:15" (1/3) ... [2024-10-11 11:04:17,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6982a460 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:04:17, skipping insertion in model container [2024-10-11 11:04:17,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:04:16" (2/3) ... [2024-10-11 11:04:17,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6982a460 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:04:17, skipping insertion in model container [2024-10-11 11:04:17,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:04:17" (3/3) ... [2024-10-11 11:04:17,018 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-29.i [2024-10-11 11:04:17,031 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:04:17,031 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:04:17,092 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:04:17,098 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;@57f90363, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:04:17,099 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:04:17,102 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:04:17,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-10-11 11:04:17,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:04:17,122 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:04:17,123 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:04:17,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:04:17,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1189551638, now seen corresponding path program 1 times [2024-10-11 11:04:17,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:04:17,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029972917] [2024-10-11 11:04:17,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:04:17,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:04:17,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:17,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:04:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:17,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:04:17,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:17,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:04:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:17,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:04:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:17,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:04:17,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:17,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:04:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:17,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:04:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:17,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:04:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:17,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:04:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:17,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:04:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:17,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:04:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:17,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:04:17,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:17,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:04:17,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:17,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:04:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:17,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:04:17,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:17,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:04:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:17,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:04:17,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:17,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:04:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:17,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:04:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:17,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:04:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:17,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:04:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:17,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:04:17,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:17,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:04:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:17,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:04:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:17,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 11:04:17,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:17,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:04:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:17,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 11:04:17,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:17,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:04:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:17,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 11:04:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:17,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 11:04:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:17,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 11:04:17,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:17,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 11:04:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:17,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-11 11:04:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:17,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-11 11:04:17,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:17,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 11:04:17,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:17,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 11:04:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:17,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-11 11:04:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:17,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-11 11:04:17,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:17,858 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:04:17,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:04:17,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029972917] [2024-10-11 11:04:17,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029972917] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:04:17,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:04:17,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:04:17,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103253486] [2024-10-11 11:04:17,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:04:17,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:04:17,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:04:17,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:04:17,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:04:17,900 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:04:17,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:04:17,961 INFO L93 Difference]: Finished difference Result 221 states and 389 transitions. [2024-10-11 11:04:17,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:04:17,964 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:04:17,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:04:17,971 INFO L225 Difference]: With dead ends: 221 [2024-10-11 11:04:17,971 INFO L226 Difference]: Without dead ends: 109 [2024-10-11 11:04:17,975 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:04:17,978 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:04:17,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:04:17,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-11 11:04:18,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-11 11:04:18,024 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:04:18,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 171 transitions. [2024-10-11 11:04:18,030 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 171 transitions. Word has length 238 [2024-10-11 11:04:18,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:04:18,031 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 171 transitions. [2024-10-11 11:04:18,031 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:04:18,031 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 171 transitions. [2024-10-11 11:04:18,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-10-11 11:04:18,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:04:18,037 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:04:18,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:04:18,037 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:04:18,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:04:18,038 INFO L85 PathProgramCache]: Analyzing trace with hash 479173554, now seen corresponding path program 1 times [2024-10-11 11:04:18,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:04:18,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392649441] [2024-10-11 11:04:18,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:04:18,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:04:18,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:04:18,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:04:18,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:04:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:04:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:04:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:04:18,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:04:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:04:18,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:04:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:04:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:04:18,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:04:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:04:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:04:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:04:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:04:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:04:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:04:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:04:18,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:04:18,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:04:18,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:04:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:04:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:04:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 11:04:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:04:18,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 11:04:18,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:04:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 11:04:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 11:04:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 11:04:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 11:04:18,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-11 11:04:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-11 11:04:18,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 11:04:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 11:04:18,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-11 11:04:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-11 11:04:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,496 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:04:18,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:04:18,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392649441] [2024-10-11 11:04:18,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392649441] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:04:18,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:04:18,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:04:18,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084201193] [2024-10-11 11:04:18,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:04:18,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:04:18,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:04:18,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:04:18,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:04:18,504 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:04:18,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:04:18,650 INFO L93 Difference]: Finished difference Result 317 states and 498 transitions. [2024-10-11 11:04:18,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:04:18,652 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:04:18,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:04:18,659 INFO L225 Difference]: With dead ends: 317 [2024-10-11 11:04:18,659 INFO L226 Difference]: Without dead ends: 209 [2024-10-11 11:04:18,660 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:04:18,661 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 148 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:04:18,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 426 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:04:18,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-11 11:04:18,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2024-10-11 11:04:18,712 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:04:18,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 322 transitions. [2024-10-11 11:04:18,720 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 322 transitions. Word has length 238 [2024-10-11 11:04:18,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:04:18,722 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 322 transitions. [2024-10-11 11:04:18,723 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:04:18,723 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 322 transitions. [2024-10-11 11:04:18,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-10-11 11:04:18,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:04:18,727 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:04:18,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:04:18,727 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:04:18,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:04:18,728 INFO L85 PathProgramCache]: Analyzing trace with hash -2079370900, now seen corresponding path program 1 times [2024-10-11 11:04:18,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:04:18,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589872798] [2024-10-11 11:04:18,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:04:18,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:04:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:04:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:04:18,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:04:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:04:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:04:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:04:18,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:04:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:04:18,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:04:18,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:04:18,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:04:18,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:04:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:04:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:04:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:04:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:04:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:04:18,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:04:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:04:18,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:04:18,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:04:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:04:18,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:04:18,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:04:18,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 11:04:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:04:18,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 11:04:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:04:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 11:04:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 11:04:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 11:04:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 11:04:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-11 11:04:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-11 11:04:18,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:18,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 11:04:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:19,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 11:04:19,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:19,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-11 11:04:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:19,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-11 11:04:19,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:19,011 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:04:19,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:04:19,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589872798] [2024-10-11 11:04:19,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589872798] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:04:19,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:04:19,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:04:19,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713852628] [2024-10-11 11:04:19,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:04:19,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:04:19,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:04:19,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:04:19,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:04:19,017 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:04:19,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:04:19,117 INFO L93 Difference]: Finished difference Result 419 states and 651 transitions. [2024-10-11 11:04:19,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:04:19,118 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:04:19,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:04:19,121 INFO L225 Difference]: With dead ends: 419 [2024-10-11 11:04:19,121 INFO L226 Difference]: Without dead ends: 213 [2024-10-11 11:04:19,124 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:04:19,125 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 153 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:04:19,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 341 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:04:19,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-10-11 11:04:19,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2024-10-11 11:04:19,156 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:04:19,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 324 transitions. [2024-10-11 11:04:19,159 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 324 transitions. Word has length 239 [2024-10-11 11:04:19,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:04:19,160 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 324 transitions. [2024-10-11 11:04:19,160 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:04:19,160 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 324 transitions. [2024-10-11 11:04:19,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-10-11 11:04:19,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:04:19,163 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:04:19,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 11:04:19,164 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:04:19,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:04:19,165 INFO L85 PathProgramCache]: Analyzing trace with hash -135075715, now seen corresponding path program 1 times [2024-10-11 11:04:19,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:04:19,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253582450] [2024-10-11 11:04:19,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:04:19,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:04:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:19,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:04:19,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:19,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:04:19,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:19,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:04:19,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:19,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:04:19,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:19,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:04:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:19,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:04:19,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:19,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:04:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:19,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:04:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:19,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:04:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:19,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:04:19,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:19,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:04:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:19,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:04:19,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:19,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:04:20,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:20,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:04:20,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:20,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:04:20,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:20,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:04:20,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:20,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:04:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:20,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:04:20,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:20,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:04:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:20,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:04:20,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:20,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:04:20,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:20,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:04:20,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:20,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:04:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:20,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:04:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:20,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 11:04:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:20,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:04:20,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:20,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 11:04:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:20,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:04:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:20,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 11:04:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:20,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 11:04:20,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:20,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 11:04:20,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:20,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 11:04:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:20,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-11 11:04:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:20,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-11 11:04:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:20,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 11:04:20,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:20,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 11:04:20,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:20,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-11 11:04:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:20,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-11 11:04:20,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:20,216 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:04:20,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:04:20,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253582450] [2024-10-11 11:04:20,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253582450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:04:20,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:04:20,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 11:04:20,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562984347] [2024-10-11 11:04:20,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:04:20,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 11:04:20,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:04:20,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 11:04:20,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:04:20,219 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:04:20,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:04:20,634 INFO L93 Difference]: Finished difference Result 559 states and 856 transitions. [2024-10-11 11:04:20,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 11:04:20,635 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:04:20,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:04:20,641 INFO L225 Difference]: With dead ends: 559 [2024-10-11 11:04:20,642 INFO L226 Difference]: Without dead ends: 349 [2024-10-11 11:04:20,645 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:04:20,646 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 114 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 11:04:20,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 564 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 11:04:20,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-10-11 11:04:20,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 279. [2024-10-11 11:04:20,721 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:04:20,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 429 transitions. [2024-10-11 11:04:20,727 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 429 transitions. Word has length 240 [2024-10-11 11:04:20,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:04:20,728 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 429 transitions. [2024-10-11 11:04:20,729 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:04:20,729 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 429 transitions. [2024-10-11 11:04:20,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-10-11 11:04:20,753 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:04:20,753 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:04:20,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 11:04:20,754 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:04:20,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:04:20,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1492339193, now seen corresponding path program 1 times [2024-10-11 11:04:20,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:04:20,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782415155] [2024-10-11 11:04:20,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:04:20,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:04:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:21,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:04:21,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:21,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:04:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:21,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:04:21,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:21,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:04:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:21,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:04:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:21,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:04:21,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:21,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:04:21,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:21,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:04:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:21,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:04:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:21,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:04:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:21,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:04:21,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:21,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:04:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:21,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:04:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:21,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:04:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:21,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:04:21,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:21,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:04:21,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:21,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:04:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:21,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:04:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:21,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:04:21,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:21,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:04:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:21,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:04:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:21,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:04:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:21,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:04:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:21,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:04:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:21,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 11:04:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:21,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:04:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:21,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 11:04:21,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:21,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:04:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:21,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 11:04:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:21,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 11:04:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:21,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 11:04:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:21,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 11:04:21,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:21,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-11 11:04:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:21,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-11 11:04:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:21,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 11:04:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:21,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 11:04:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:21,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-11 11:04:21,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:21,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-11 11:04:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:21,349 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:04:21,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:04:21,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782415155] [2024-10-11 11:04:21,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782415155] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:04:21,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:04:21,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:04:21,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022855993] [2024-10-11 11:04:21,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:04:21,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:04:21,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:04:21,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:04:21,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:04:21,352 INFO L87 Difference]: Start difference. First operand 279 states and 429 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:04:21,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:04:21,476 INFO L93 Difference]: Finished difference Result 554 states and 844 transitions. [2024-10-11 11:04:21,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:04:21,477 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:04:21,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:04:21,480 INFO L225 Difference]: With dead ends: 554 [2024-10-11 11:04:21,480 INFO L226 Difference]: Without dead ends: 344 [2024-10-11 11:04:21,482 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:04:21,482 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 113 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:04:21,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 340 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:04:21,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-10-11 11:04:21,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 297. [2024-10-11 11:04:21,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 179 states have (on average 1.2681564245810055) internal successors, (227), 179 states have internal predecessors, (227), 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:04:21,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 455 transitions. [2024-10-11 11:04:21,538 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 455 transitions. Word has length 241 [2024-10-11 11:04:21,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:04:21,539 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 455 transitions. [2024-10-11 11:04:21,539 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:04:21,539 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 455 transitions. [2024-10-11 11:04:21,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-10-11 11:04:21,542 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:04:21,542 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:04:21,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 11:04:21,542 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:04:21,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:04:21,543 INFO L85 PathProgramCache]: Analyzing trace with hash -471270839, now seen corresponding path program 1 times [2024-10-11 11:04:21,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:04:21,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899176861] [2024-10-11 11:04:21,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:04:21,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:04:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:29,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:04:29,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:29,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:04:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:29,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:04:29,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:29,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:04:29,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:29,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:04:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:29,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:04:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:29,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:04:29,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:29,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:04:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:29,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:04:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:29,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:04:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:29,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:04:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:29,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:04:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:29,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:04:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:29,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:04:29,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:29,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:04:29,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:29,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:04:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:29,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:04:29,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:29,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:04:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:29,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:04:29,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:29,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:04:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:29,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:04:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:29,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:04:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:29,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:04:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:29,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:04:29,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:29,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 11:04:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:29,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:04:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:29,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 11:04:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:29,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:04:29,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:29,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 11:04:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:29,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 11:04:29,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:29,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 11:04:29,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:29,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 11:04:29,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:29,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-11 11:04:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:29,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-11 11:04:29,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:29,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 11:04:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:29,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 11:04:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:29,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-11 11:04:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:29,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-11 11:04:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:29,240 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:04:29,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:04:29,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899176861] [2024-10-11 11:04:29,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899176861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:04:29,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:04:29,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 11:04:29,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718951143] [2024-10-11 11:04:29,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:04:29,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 11:04:29,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:04:29,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 11:04:29,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-10-11 11:04:29,245 INFO L87 Difference]: Start difference. First operand 297 states and 455 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:04:31,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:04:31,077 INFO L93 Difference]: Finished difference Result 904 states and 1359 transitions. [2024-10-11 11:04:31,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 11:04:31,079 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:04:31,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:04:31,084 INFO L225 Difference]: With dead ends: 904 [2024-10-11 11:04:31,084 INFO L226 Difference]: Without dead ends: 676 [2024-10-11 11:04:31,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2024-10-11 11:04:31,086 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 791 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:04:31,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 599 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 11:04:31,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2024-10-11 11:04:31,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 528. [2024-10-11 11:04:31,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 332 states have (on average 1.283132530120482) internal successors, (426), 332 states have internal predecessors, (426), 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:04:31,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 806 transitions. [2024-10-11 11:04:31,156 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 806 transitions. Word has length 241 [2024-10-11 11:04:31,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:04:31,157 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 806 transitions. [2024-10-11 11:04:31,157 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:04:31,157 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 806 transitions. [2024-10-11 11:04:31,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-10-11 11:04:31,162 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:04:31,162 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:04:31,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 11:04:31,162 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:04:31,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:04:31,163 INFO L85 PathProgramCache]: Analyzing trace with hash -213105401, now seen corresponding path program 1 times [2024-10-11 11:04:31,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:04:31,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120476450] [2024-10-11 11:04:31,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:04:31,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:04:31,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:35,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:04:35,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:35,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:04:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:35,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:04:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:35,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:04:35,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:35,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:04:35,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:35,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:04:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:35,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:04:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:35,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:04:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:35,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:04:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:35,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:04:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:35,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:04:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:35,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:04:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:35,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:04:35,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:35,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:04:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:35,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:04:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:35,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:04:35,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:35,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:04:35,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:35,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:04:35,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:35,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:04:35,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:35,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:04:35,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:35,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:04:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:35,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:04:35,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:35,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:04:35,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:35,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:04:35,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:35,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 11:04:35,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:35,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:04:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:35,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 11:04:35,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:35,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:04:35,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:35,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 11:04:35,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:35,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 11:04:35,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:35,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 11:04:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:35,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 11:04:35,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:35,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-11 11:04:35,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:35,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-11 11:04:35,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:35,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 11:04:35,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:35,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 11:04:35,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:35,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-11 11:04:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:35,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-11 11:04:35,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:35,754 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:04:35,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:04:35,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120476450] [2024-10-11 11:04:35,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120476450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:04:35,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:04:35,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 11:04:35,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153377792] [2024-10-11 11:04:35,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:04:35,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 11:04:35,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:04:35,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 11:04:35,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-11 11:04:35,757 INFO L87 Difference]: Start difference. First operand 528 states and 806 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:04:38,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:04:38,352 INFO L93 Difference]: Finished difference Result 1320 states and 1996 transitions. [2024-10-11 11:04:38,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 11:04:38,353 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:04:38,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:04:38,359 INFO L225 Difference]: With dead ends: 1320 [2024-10-11 11:04:38,359 INFO L226 Difference]: Without dead ends: 861 [2024-10-11 11:04:38,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-10-11 11:04:38,364 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 408 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 11:04:38,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 707 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1003 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 11:04:38,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2024-10-11 11:04:38,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 771. [2024-10-11 11:04:38,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 497 states have (on average 1.2917505030181087) internal successors, (642), 497 states have internal predecessors, (642), 266 states have call successors, (266), 7 states have call predecessors, (266), 7 states have return successors, (266), 266 states have call predecessors, (266), 266 states have call successors, (266) [2024-10-11 11:04:38,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1174 transitions. [2024-10-11 11:04:38,451 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1174 transitions. Word has length 241 [2024-10-11 11:04:38,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:04:38,451 INFO L471 AbstractCegarLoop]: Abstraction has 771 states and 1174 transitions. [2024-10-11 11:04:38,451 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:04:38,452 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1174 transitions. [2024-10-11 11:04:38,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-10-11 11:04:38,455 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:04:38,455 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:04:38,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 11:04:38,455 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:04:38,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:04:38,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1955565154, now seen corresponding path program 1 times [2024-10-11 11:04:38,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:04:38,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263419038] [2024-10-11 11:04:38,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:04:38,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:04:38,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:39,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:04:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:39,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:04:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:39,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:04:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:39,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:04:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:39,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:04:39,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:39,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:04:39,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:39,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:04:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:39,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:04:39,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:39,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:04:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:39,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:04:39,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:39,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:04:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:39,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:04:39,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:39,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:04:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:39,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:04:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:39,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:04:39,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:39,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:04:39,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:39,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:04:39,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:39,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:04:39,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:39,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:04:39,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:39,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:04:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:39,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:04:39,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:39,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:04:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:39,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:04:39,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:39,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:04:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:39,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 11:04:39,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:39,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:04:39,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:39,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 11:04:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:39,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:04:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:39,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 11:04:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:39,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 11:04:39,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:39,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 11:04:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:39,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 11:04:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:39,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-11 11:04:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:39,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-11 11:04:39,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:39,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 11:04:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:39,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 11:04:39,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:39,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-11 11:04:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:39,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-11 11:04:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:39,336 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:04:39,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:04:39,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263419038] [2024-10-11 11:04:39,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263419038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:04:39,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:04:39,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 11:04:39,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989535429] [2024-10-11 11:04:39,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:04:39,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 11:04:39,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:04:39,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 11:04:39,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 11:04:39,339 INFO L87 Difference]: Start difference. First operand 771 states and 1174 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:04:39,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:04:39,941 INFO L93 Difference]: Finished difference Result 1514 states and 2298 transitions. [2024-10-11 11:04:39,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 11:04:39,942 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:04:39,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:04:39,948 INFO L225 Difference]: With dead ends: 1514 [2024-10-11 11:04:39,948 INFO L226 Difference]: Without dead ends: 812 [2024-10-11 11:04:39,951 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:04:39,953 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 168 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 11:04:39,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 624 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 11:04:39,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2024-10-11 11:04:40,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 786. [2024-10-11 11:04:40,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 512 states have (on average 1.294921875) internal successors, (663), 512 states have internal predecessors, (663), 266 states have call successors, (266), 7 states have call predecessors, (266), 7 states have return successors, (266), 266 states have call predecessors, (266), 266 states have call successors, (266) [2024-10-11 11:04:40,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1195 transitions. [2024-10-11 11:04:40,041 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1195 transitions. Word has length 241 [2024-10-11 11:04:40,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:04:40,043 INFO L471 AbstractCegarLoop]: Abstraction has 786 states and 1195 transitions. [2024-10-11 11:04:40,043 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:04:40,043 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1195 transitions. [2024-10-11 11:04:40,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-10-11 11:04:40,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:04:40,046 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:04:40,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 11:04:40,047 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:04:40,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:04:40,047 INFO L85 PathProgramCache]: Analyzing trace with hash -595091416, now seen corresponding path program 1 times [2024-10-11 11:04:40,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:04:40,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991066783] [2024-10-11 11:04:40,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:04:40,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:04:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:04:40,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:04:40,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:04:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:04:40,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:04:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:04:40,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:04:40,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:04:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:04:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:04:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:04:40,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:04:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:04:40,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:04:40,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:04:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:04:40,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:04:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:04:40,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:04:40,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:04:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:04:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:04:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:04:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:04:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 11:04:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:04:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 11:04:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:04:40,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 11:04:40,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 11:04:40,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 11:04:40,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 11:04:40,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-11 11:04:40,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-11 11:04:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 11:04:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 11:04:40,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-11 11:04:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-11 11:04:40,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,390 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:04:40,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:04:40,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991066783] [2024-10-11 11:04:40,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991066783] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:04:40,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:04:40,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:04:40,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416836129] [2024-10-11 11:04:40,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:04:40,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:04:40,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:04:40,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:04:40,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:04:40,393 INFO L87 Difference]: Start difference. First operand 786 states and 1195 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:04:40,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:04:40,611 INFO L93 Difference]: Finished difference Result 1146 states and 1733 transitions. [2024-10-11 11:04:40,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:04:40,611 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:04:40,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:04:40,618 INFO L225 Difference]: With dead ends: 1146 [2024-10-11 11:04:40,618 INFO L226 Difference]: Without dead ends: 918 [2024-10-11 11:04:40,620 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:04:40,621 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 97 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:04:40,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 493 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:04:40,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2024-10-11 11:04:40,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 794. [2024-10-11 11:04:40,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 520 states have (on average 1.2942307692307693) internal successors, (673), 520 states have internal predecessors, (673), 266 states have call successors, (266), 7 states have call predecessors, (266), 7 states have return successors, (266), 266 states have call predecessors, (266), 266 states have call successors, (266) [2024-10-11 11:04:40,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1205 transitions. [2024-10-11 11:04:40,701 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1205 transitions. Word has length 242 [2024-10-11 11:04:40,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:04:40,702 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1205 transitions. [2024-10-11 11:04:40,702 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:04:40,702 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1205 transitions. [2024-10-11 11:04:40,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-10-11 11:04:40,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:04:40,705 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:04:40,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 11:04:40,705 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:04:40,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:04:40,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1170031040, now seen corresponding path program 1 times [2024-10-11 11:04:40,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:04:40,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985514478] [2024-10-11 11:04:40,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:04:40,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:04:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:04:40,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:04:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:04:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:04:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:04:40,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:04:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:04:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:04:40,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:04:40,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:04:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:04:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:04:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:04:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:04:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:04:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:04:40,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:04:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:04:40,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:04:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:04:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:04:40,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:04:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:04:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:04:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 11:04:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:04:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 11:04:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:04:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 11:04:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 11:04:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 11:04:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 11:04:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-11 11:04:40,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-11 11:04:40,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 11:04:40,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 11:04:40,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-11 11:04:40,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-11 11:04:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:40,964 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:04:40,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:04:40,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985514478] [2024-10-11 11:04:40,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985514478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:04:40,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:04:40,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:04:40,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217865762] [2024-10-11 11:04:40,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:04:40,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:04:40,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:04:40,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:04:40,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:04:40,967 INFO L87 Difference]: Start difference. First operand 794 states and 1205 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:04:41,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:04:41,318 INFO L93 Difference]: Finished difference Result 1511 states and 2294 transitions. [2024-10-11 11:04:41,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:04:41,319 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:04:41,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:04:41,325 INFO L225 Difference]: With dead ends: 1511 [2024-10-11 11:04:41,326 INFO L226 Difference]: Without dead ends: 794 [2024-10-11 11:04:41,330 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:04:41,331 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 143 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:04:41,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 163 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:04:41,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2024-10-11 11:04:41,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 794. [2024-10-11 11:04:41,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 520 states have (on average 1.2826923076923078) internal successors, (667), 520 states have internal predecessors, (667), 266 states have call successors, (266), 7 states have call predecessors, (266), 7 states have return successors, (266), 266 states have call predecessors, (266), 266 states have call successors, (266) [2024-10-11 11:04:41,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1199 transitions. [2024-10-11 11:04:41,428 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1199 transitions. Word has length 242 [2024-10-11 11:04:41,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:04:41,428 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1199 transitions. [2024-10-11 11:04:41,429 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:04:41,429 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1199 transitions. [2024-10-11 11:04:41,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-10-11 11:04:41,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:04:41,432 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:04:41,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 11:04:41,432 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:04:41,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:04:41,433 INFO L85 PathProgramCache]: Analyzing trace with hash -360684414, now seen corresponding path program 1 times [2024-10-11 11:04:41,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:04:41,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594578171] [2024-10-11 11:04:41,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:04:41,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:04:41,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:46,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:04:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:46,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:04:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:46,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:04:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:46,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:04:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:46,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:04:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:46,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:04:46,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:46,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:04:46,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:46,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:04:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:46,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:04:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:46,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:04:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:46,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:04:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:46,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:04:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:46,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:04:46,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:46,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:04:46,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:46,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:04:46,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:46,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:04:46,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:46,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:04:46,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:46,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:04:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:46,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:04:46,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:46,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:04:46,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:46,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:04:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:46,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:04:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:46,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:04:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:46,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:04:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:46,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 11:04:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:46,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:04:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:46,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 11:04:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:46,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:04:46,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:46,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 11:04:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:46,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 11:04:46,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:46,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 11:04:46,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:46,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 11:04:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:46,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-11 11:04:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:46,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-11 11:04:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:46,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 11:04:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:46,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 11:04:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:46,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-11 11:04:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:46,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-11 11:04:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:46,743 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:04:46,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:04:46,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594578171] [2024-10-11 11:04:46,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594578171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:04:46,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:04:46,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 11:04:46,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372941069] [2024-10-11 11:04:46,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:04:46,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 11:04:46,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:04:46,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 11:04:46,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-11 11:04:46,746 INFO L87 Difference]: Start difference. First operand 794 states and 1199 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:04:48,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:04:48,916 INFO L93 Difference]: Finished difference Result 1675 states and 2505 transitions. [2024-10-11 11:04:48,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 11:04:48,917 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:04:48,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:04:48,924 INFO L225 Difference]: With dead ends: 1675 [2024-10-11 11:04:48,924 INFO L226 Difference]: Without dead ends: 958 [2024-10-11 11:04:48,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2024-10-11 11:04:48,927 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 260 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:04:48,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 679 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 11:04:48,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2024-10-11 11:04:49,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 817. [2024-10-11 11:04:49,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 543 states have (on average 1.289134438305709) internal successors, (700), 543 states have internal predecessors, (700), 266 states have call successors, (266), 7 states have call predecessors, (266), 7 states have return successors, (266), 266 states have call predecessors, (266), 266 states have call successors, (266) [2024-10-11 11:04:49,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1232 transitions. [2024-10-11 11:04:49,043 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1232 transitions. Word has length 242 [2024-10-11 11:04:49,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:04:49,044 INFO L471 AbstractCegarLoop]: Abstraction has 817 states and 1232 transitions. [2024-10-11 11:04:49,045 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:04:49,045 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1232 transitions. [2024-10-11 11:04:49,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-10-11 11:04:49,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:04:49,048 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:04:49,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 11:04:49,048 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:04:49,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:04:49,049 INFO L85 PathProgramCache]: Analyzing trace with hash -2046236889, now seen corresponding path program 1 times [2024-10-11 11:04:49,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:04:49,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775135726] [2024-10-11 11:04:49,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:04:49,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:04:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:49,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:04:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:49,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:04:49,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:49,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:04:49,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:49,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:04:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:49,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:04:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:49,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:04:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:49,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:04:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:49,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:04:49,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:49,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:04:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:49,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:04:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:49,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:04:49,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:49,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:04:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:49,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:04:49,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:49,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:04:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:49,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:04:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:49,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:04:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:49,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:04:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:49,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:04:49,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:49,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:04:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:49,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:04:49,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:49,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:04:49,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:49,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:04:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:49,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:04:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:49,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:04:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:49,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 11:04:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:49,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:04:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:49,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 11:04:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:49,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:04:49,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:49,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 11:04:49,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:49,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 11:04:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:49,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 11:04:49,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:49,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 11:04:49,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:49,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-11 11:04:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:49,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-11 11:04:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:49,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 11:04:49,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:49,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 11:04:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:49,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-11 11:04:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:49,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-11 11:04:49,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:49,811 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:04:49,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:04:49,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775135726] [2024-10-11 11:04:49,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775135726] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:04:49,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:04:49,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 11:04:49,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994492479] [2024-10-11 11:04:49,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:04:49,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 11:04:49,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:04:49,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 11:04:49,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:04:49,814 INFO L87 Difference]: Start difference. First operand 817 states and 1232 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:04:50,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:04:50,208 INFO L93 Difference]: Finished difference Result 1586 states and 2380 transitions. [2024-10-11 11:04:50,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 11:04:50,209 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:04:50,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:04:50,216 INFO L225 Difference]: With dead ends: 1586 [2024-10-11 11:04:50,217 INFO L226 Difference]: Without dead ends: 864 [2024-10-11 11:04:50,219 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:04:50,219 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 99 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 11:04:50,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 555 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 11:04:50,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2024-10-11 11:04:50,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 812. [2024-10-11 11:04:50,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 538 states have (on average 1.288104089219331) internal successors, (693), 538 states have internal predecessors, (693), 266 states have call successors, (266), 7 states have call predecessors, (266), 7 states have return successors, (266), 266 states have call predecessors, (266), 266 states have call successors, (266) [2024-10-11 11:04:50,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1225 transitions. [2024-10-11 11:04:50,328 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1225 transitions. Word has length 242 [2024-10-11 11:04:50,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:04:50,329 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 1225 transitions. [2024-10-11 11:04:50,329 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:04:50,329 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1225 transitions. [2024-10-11 11:04:50,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-10-11 11:04:50,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:04:50,330 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:04:50,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 11:04:50,331 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:04:50,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:04:50,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1782194264, now seen corresponding path program 1 times [2024-10-11 11:04:50,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:04:50,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363342183] [2024-10-11 11:04:50,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:04:50,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:04:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:50,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:04:50,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:50,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:04:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:50,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:04:50,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:50,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:04:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:50,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:04:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:50,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:04:50,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:50,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:04:50,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:50,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:04:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:50,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:04:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:50,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:04:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:50,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:04:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:50,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:04:50,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:50,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:04:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:50,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:04:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:50,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:04:50,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:50,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:04:50,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:50,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:04:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:50,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:04:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:50,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:04:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:50,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:04:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:50,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:04:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:50,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:04:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:50,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:04:50,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:50,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:04:50,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:50,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 11:04:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:50,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:04:50,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:50,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 11:04:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:50,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:04:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:50,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 11:04:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:50,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 11:04:50,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:50,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 11:04:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:50,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 11:04:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:50,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-11 11:04:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:50,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-11 11:04:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:50,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 11:04:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:50,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 11:04:50,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:50,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-11 11:04:50,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:50,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-11 11:04:50,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:50,714 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:04:50,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:04:50,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363342183] [2024-10-11 11:04:50,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363342183] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:04:50,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601266476] [2024-10-11 11:04:50,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:04:50,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:04:50,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:04:50,718 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:04:50,719 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:04:50,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:50,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 11:04:50,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:04:51,343 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:04:51,344 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:04:51,657 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:04:51,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601266476] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 11:04:51,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 11:04:51,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-11 11:04:51,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005923439] [2024-10-11 11:04:51,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 11:04:51,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 11:04:51,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:04:51,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 11:04:51,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:04:51,660 INFO L87 Difference]: Start difference. First operand 812 states and 1225 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:04:51,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:04:51,942 INFO L93 Difference]: Finished difference Result 1502 states and 2249 transitions. [2024-10-11 11:04:51,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 11:04:51,943 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:04:51,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:04:51,951 INFO L225 Difference]: With dead ends: 1502 [2024-10-11 11:04:51,951 INFO L226 Difference]: Without dead ends: 770 [2024-10-11 11:04:51,954 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:04:51,955 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 109 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:04:51,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 279 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:04:51,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2024-10-11 11:04:52,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 382. [2024-10-11 11:04:52,029 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:04:52,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 562 transitions. [2024-10-11 11:04:52,033 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 562 transitions. Word has length 243 [2024-10-11 11:04:52,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:04:52,034 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 562 transitions. [2024-10-11 11:04:52,034 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:04:52,034 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 562 transitions. [2024-10-11 11:04:52,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-10-11 11:04:52,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:04:52,036 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:04:52,059 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:04:52,236 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:04:52,237 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:04:52,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:04:52,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1499195852, now seen corresponding path program 1 times [2024-10-11 11:04:52,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:04:52,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584192143] [2024-10-11 11:04:52,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:04:52,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:04:52,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:52,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:04:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:52,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:04:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:52,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:04:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:52,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:04:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:52,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:04:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:52,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:04:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:52,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:04:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:52,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:04:52,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:52,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:04:52,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:52,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:04:52,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:52,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:04:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:52,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:04:52,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:52,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:04:52,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:52,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:04:52,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:52,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:04:52,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:52,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:04:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:52,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:04:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:52,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:04:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:52,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:04:52,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:52,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:04:52,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:52,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:04:52,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:52,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:04:52,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:52,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:04:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:52,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:04:52,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:52,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 11:04:52,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:52,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:04:52,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:52,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 11:04:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:52,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:04:52,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:52,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 11:04:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:52,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 11:04:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:52,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 11:04:52,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:52,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 11:04:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:52,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-11 11:04:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:52,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-11 11:04:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:52,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 11:04:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:52,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-11 11:04:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:52,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-11 11:04:52,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:52,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-11 11:04:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:52,980 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:04:52,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:04:52,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584192143] [2024-10-11 11:04:52,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584192143] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:04:52,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604591121] [2024-10-11 11:04:52,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:04:52,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:04:52,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:04:52,984 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:04:52,985 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:04:53,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:04:53,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 11:04:53,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:04:56,158 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:04:56,158 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:04:57,294 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:04:57,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604591121] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 11:04:57,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 11:04:57,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 21 [2024-10-11 11:04:57,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344917529] [2024-10-11 11:04:57,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 11:04:57,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 11:04:57,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:04:57,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 11:04:57,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2024-10-11 11:04:57,298 INFO L87 Difference]: Start difference. First operand 382 states and 562 transitions. Second operand has 21 states, 21 states have (on average 8.095238095238095) internal successors, (170), 21 states have internal predecessors, (170), 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:04:58,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:04:58,594 INFO L93 Difference]: Finished difference Result 1090 states and 1565 transitions. [2024-10-11 11:04:58,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-11 11:04:58,595 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.095238095238095) internal successors, (170), 21 states have internal predecessors, (170), 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:04:58,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:04:58,601 INFO L225 Difference]: With dead ends: 1090 [2024-10-11 11:04:58,601 INFO L226 Difference]: Without dead ends: 795 [2024-10-11 11:04:58,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 555 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=337, Invalid=923, Unknown=0, NotChecked=0, Total=1260 [2024-10-11 11:04:58,604 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 751 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 11:04:58,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 857 Invalid, 1330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 1011 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 11:04:58,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2024-10-11 11:04:58,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 621. [2024-10-11 11:04:58,723 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:04:58,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 895 transitions. [2024-10-11 11:04:58,727 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 895 transitions. Word has length 246 [2024-10-11 11:04:58,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:04:58,728 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 895 transitions. [2024-10-11 11:04:58,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.095238095238095) internal successors, (170), 21 states have internal predecessors, (170), 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:04:58,729 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 895 transitions. [2024-10-11 11:04:58,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-10-11 11:04:58,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:04:58,730 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:04:58,751 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:04:58,934 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:04:58,935 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:04:58,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:04:58,935 INFO L85 PathProgramCache]: Analyzing trace with hash -524591400, now seen corresponding path program 1 times [2024-10-11 11:04:58,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:04:58,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681046673] [2024-10-11 11:04:58,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:04:58,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:04:59,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 11:04:59,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [580669389] [2024-10-11 11:04:59,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:04:59,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:04:59,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:04:59,077 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:04:59,079 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:04:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:04:59,308 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 11:04:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:04:59,685 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 11:04:59,685 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 11:04:59,686 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:04:59,702 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:04:59,888 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:04:59,891 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:05:00,081 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:05:00,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:05:00 BoogieIcfgContainer [2024-10-11 11:05:00,086 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:05:00,086 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:05:00,086 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:05:00,087 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:05:00,087 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:04:17" (3/4) ... [2024-10-11 11:05:00,089 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 11:05:00,090 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:05:00,091 INFO L158 Benchmark]: Toolchain (without parser) took 44498.14ms. Allocated memory was 148.9MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 97.4MB in the beginning and 673.4MB in the end (delta: -576.0MB). Peak memory consumption was 427.6MB. Max. memory is 16.1GB. [2024-10-11 11:05:00,091 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory was 59.2MB in the beginning and 59.1MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:05:00,091 INFO L158 Benchmark]: CACSL2BoogieTranslator took 426.59ms. Allocated memory is still 148.9MB. Free memory was 97.0MB in the beginning and 78.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 11:05:00,092 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.86ms. Allocated memory is still 148.9MB. Free memory was 78.1MB in the beginning and 115.6MB in the end (delta: -37.5MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. [2024-10-11 11:05:00,092 INFO L158 Benchmark]: Boogie Preprocessor took 70.04ms. Allocated memory is still 148.9MB. Free memory was 115.6MB in the beginning and 107.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 11:05:00,092 INFO L158 Benchmark]: RCFGBuilder took 824.71ms. Allocated memory is still 148.9MB. Free memory was 107.2MB in the beginning and 81.7MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-11 11:05:00,093 INFO L158 Benchmark]: TraceAbstraction took 43075.97ms. Allocated memory was 148.9MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 81.0MB in the beginning and 674.4MB in the end (delta: -593.5MB). Peak memory consumption was 413.5MB. Max. memory is 16.1GB. [2024-10-11 11:05:00,093 INFO L158 Benchmark]: Witness Printer took 4.17ms. Allocated memory is still 1.2GB. Free memory was 674.4MB in the beginning and 673.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:05:00,094 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.16ms. Allocated memory is still 96.5MB. Free memory was 59.2MB in the beginning and 59.1MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 426.59ms. Allocated memory is still 148.9MB. Free memory was 97.0MB in the beginning and 78.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.86ms. Allocated memory is still 148.9MB. Free memory was 78.1MB in the beginning and 115.6MB in the end (delta: -37.5MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.04ms. Allocated memory is still 148.9MB. Free memory was 115.6MB in the beginning and 107.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 824.71ms. Allocated memory is still 148.9MB. Free memory was 107.2MB in the beginning and 81.7MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 43075.97ms. Allocated memory was 148.9MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 81.0MB in the beginning and 674.4MB in the end (delta: -593.5MB). Peak memory consumption was 413.5MB. Max. memory is 16.1GB. * Witness Printer took 4.17ms. Allocated memory is still 1.2GB. Free memory was 674.4MB in the beginning and 673.4MB 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] int k_loop; [L234] k_loop = 0 VAL [isInitial=1, k_loop=0, 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] [L234] COND TRUE k_loop < 1 [L235] 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 [L235] RET updateLastVariables() [L236] 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=262145, 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=262145, 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=262145, 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=262145, 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=262145, 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=262145, 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=262145, var_1_11=-640, 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=262145, var_1_11=-640, 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=262145, var_1_11=-640, 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=262145, var_1_11=-640, 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=262145, var_1_11=-640, 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=262145, var_1_11=-640, 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=262145, var_1_11=-640, 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=262145, var_1_11=-640, 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=262145, var_1_11=-640, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=6442450943, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=6442450943, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=6442450943, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=6442450943, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=6442450943, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=6442450943, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=6442450943, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=6442450943, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=6442450943, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=6442450943, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=6442450943, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=6442450943, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=6442450943, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=6442450943, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=6442450943, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=6442450943, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=6442450943, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=6442450943, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=6442450943, var_1_37=100, var_1_38=-29, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=6442450943, var_1_37=100, var_1_38=-29, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=6442450943, var_1_37=100, var_1_38=-29, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=6442450943, var_1_37=100, var_1_38=-29, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=6442450943, var_1_37=100, var_1_38=-29, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=6442450943, var_1_37=100, var_1_38=-29, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=6442450943, var_1_37=100, var_1_38=-29, var_1_39=31, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=6442450943, var_1_37=100, var_1_38=-29, var_1_39=31, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=6442450943, var_1_37=100, var_1_38=-29, var_1_39=31, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=6442450943, var_1_37=100, var_1_38=-29, var_1_39=31, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=6442450943, var_1_37=100, var_1_38=-29, var_1_39=31, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=6442450943, var_1_37=100, var_1_38=-29, var_1_39=31, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L236] RET updateVariables() [L237] 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=6442450943, var_1_37=100, var_1_38=-29, var_1_39=31, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=6442450943, var_1_37=100, var_1_38=-29, var_1_39=31, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=6442450943, var_1_37=100, var_1_38=-29, var_1_39=31, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=6442450943, var_1_37=100, var_1_38=-29, var_1_39=31, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, var_1_29=0, var_1_30=0, var_1_31=5, var_1_32=6442450943, var_1_37=100, var_1_38=-29, var_1_39=31, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, var_1_29=0, var_1_30=1, var_1_31=5, var_1_32=6442450943, var_1_37=100, var_1_38=-29, var_1_39=31, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, var_1_29=0, var_1_30=1, var_1_31=5, var_1_32=6442450943, var_1_37=100, var_1_38=-29, var_1_39=31, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, var_1_29=0, var_1_30=1, var_1_31=5, var_1_32=6442450943, var_1_37=2, var_1_38=-29, var_1_39=31, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, 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=28, var_1_29=0, var_1_30=1, var_1_31=5, var_1_32=6442450943, var_1_37=2, var_1_38=-29, var_1_39=31, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, var_1_16=256, var_1_17=127, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=28, var_1_29=0, var_1_30=1, var_1_31=5, var_1_32=6442450943, var_1_37=2, var_1_38=-29, var_1_39=31, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, var_1_16=256, var_1_17=127, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=28, var_1_29=0, var_1_30=1, var_1_31=5, var_1_32=6442450943, var_1_37=2, var_1_38=-29, var_1_39=31, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, var_1_16=256, var_1_17=127, var_1_18=25, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=28, var_1_29=0, var_1_30=1, var_1_31=5, var_1_32=6442450943, var_1_37=2, var_1_38=-29, var_1_39=31, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, var_1_16=256, var_1_17=127, var_1_18=128, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=28, var_1_29=0, var_1_30=1, var_1_31=5, var_1_32=6442450943, var_1_37=2, var_1_38=-29, var_1_39=31, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, var_1_16=256, var_1_17=127, var_1_18=128, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=28, var_1_29=0, var_1_30=1, var_1_31=5, var_1_32=6442450943, var_1_37=2, var_1_38=-29, var_1_39=31, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, var_1_16=256, var_1_17=127, var_1_18=128, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=28, var_1_29=0, var_1_30=1, var_1_31=5, var_1_32=6442450943, var_1_37=2, var_1_38=-29, var_1_39=31, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, var_1_16=256, var_1_17=127, var_1_18=128, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=28, var_1_29=0, var_1_30=1, var_1_31=5, var_1_32=6442450943, var_1_37=2, var_1_38=-29, var_1_39=31, 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=-28, var_1_10=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, var_1_16=256, var_1_17=127, var_1_18=128, var_1_19=135/8, var_1_1=1, var_1_27=100, var_1_28=28, var_1_29=0, var_1_30=1, var_1_31=5, var_1_32=6442450943, var_1_37=2, var_1_38=-29, var_1_39=31, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, var_1_16=256, var_1_17=127, var_1_18=128, var_1_19=135/8, var_1_1=1, var_1_27=28, var_1_28=28, var_1_29=0, var_1_30=1, var_1_31=5, var_1_32=6442450943, var_1_37=2, var_1_38=-29, var_1_39=31, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, var_1_16=256, var_1_17=127, var_1_18=128, var_1_19=135/8, var_1_1=1, var_1_27=28, var_1_28=28, var_1_29=0, var_1_30=1, var_1_31=5, var_1_32=6442450943, var_1_37=2, var_1_38=-29, var_1_39=31, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, var_1_16=256, var_1_17=127, var_1_18=128, var_1_19=135/8, var_1_1=1, var_1_27=28, var_1_28=28, var_1_29=0, var_1_30=1, var_1_31=5, var_1_32=6442450943, var_1_37=2, var_1_38=-29, var_1_39=31, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, var_1_16=256, var_1_17=127, var_1_18=128, var_1_19=2, var_1_1=1, var_1_22=0, var_1_27=28, var_1_28=28, var_1_29=0, var_1_30=1, var_1_31=5, var_1_32=6442450943, var_1_37=2, var_1_38=-29, var_1_39=31, 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=156, var_1_10=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, var_1_16=256, var_1_17=127, var_1_18=128, var_1_19=2, var_1_1=1, var_1_22=0, var_1_27=28, var_1_28=28, var_1_29=0, var_1_30=1, var_1_31=5, var_1_32=6442450943, var_1_37=2, var_1_38=-29, var_1_39=31, 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=156, var_1_10=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, var_1_16=256, var_1_17=127, var_1_18=128, var_1_19=2, var_1_1=1, var_1_22=0, var_1_27=28, var_1_28=28, var_1_29=0, var_1_30=1, var_1_31=6442434568, var_1_32=6442450943, var_1_37=2, var_1_38=-29, var_1_39=31, var_1_40=-8, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=128] [L237] RET step() [L238] 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, var_1_16=256, var_1_17=127, var_1_18=128, var_1_19=2, var_1_1=1, var_1_22=0, var_1_27=28, var_1_28=28, var_1_29=0, var_1_30=1, var_1_31=6442434568, var_1_32=6442450943, var_1_37=2, var_1_38=-29, var_1_39=31, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, var_1_16=256, var_1_17=127, var_1_18=128, var_1_19=2, var_1_1=1, var_1_22=0, var_1_27=28, var_1_28=28, var_1_29=0, var_1_30=1, var_1_31=6442434568, var_1_32=6442450943, var_1_37=2, var_1_38=-29, var_1_39=31, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, var_1_16=256, var_1_17=127, var_1_18=128, var_1_19=2, var_1_1=1, var_1_22=0, var_1_27=28, var_1_28=28, var_1_29=0, var_1_30=1, var_1_31=6442434568, var_1_32=6442450943, var_1_37=2, var_1_38=-29, var_1_39=31, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, var_1_16=256, var_1_17=127, var_1_18=128, var_1_19=2, var_1_1=1, var_1_22=0, var_1_27=28, var_1_28=28, var_1_29=0, var_1_30=1, var_1_31=6442434568, var_1_32=6442450943, var_1_37=2, var_1_38=-29, var_1_39=31, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, var_1_16=256, var_1_17=127, var_1_18=128, var_1_19=2, var_1_1=1, var_1_22=0, var_1_27=28, var_1_28=28, var_1_29=0, var_1_30=1, var_1_31=6442434568, var_1_32=6442450943, var_1_37=2, var_1_38=-29, var_1_39=31, 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)) ; [L238] RET, EXPR property() [L238] 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, var_1_16=256, var_1_17=127, var_1_18=128, var_1_19=2, var_1_1=1, var_1_22=0, var_1_27=28, var_1_28=28, var_1_29=0, var_1_30=1, var_1_31=6442434568, var_1_32=6442450943, var_1_37=2, var_1_38=-29, var_1_39=31, 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=262145, var_1_11=-640, var_1_12=8, var_1_13=-49153, var_1_14=4, var_1_15=-129, var_1_16=256, var_1_17=127, var_1_18=128, var_1_19=2, var_1_1=1, var_1_22=0, var_1_27=28, var_1_28=28, var_1_29=0, var_1_30=1, var_1_31=6442434568, var_1_32=6442450943, var_1_37=2, var_1_38=-29, var_1_39=31, 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: 42.8s, OverallIterations: 15, TraceHistogramMax: 38, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3430 SdHoareTripleChecker+Valid, 7.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3354 mSDsluCounter, 6795 SdHoareTripleChecker+Invalid, 6.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4507 mSDsCounter, 939 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4048 IncrementalHoareTripleChecker+Invalid, 4987 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 939 mSolverCounterUnsat, 2288 mSDtfsCounter, 4048 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2222 GetRequests, 2104 SyntacticMatches, 3 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=817occurred in iteration=11, InterpolantAutomatonStates: 109, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 1264 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 27.4s InterpolantComputationTime, 4359 NumberOfCodeBlocks, 4359 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 4336 ConstructedInterpolants, 0 QuantifiedInterpolants, 34018 SizeOfPredicates, 34 NumberOfNonLiveVariables, 1125 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:05:00,280 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-1loop_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 fccc32608678fc6fd4cb86e7f394d0f05414cafa3a24a1c8162582b5a3f5da8c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:05:02,537 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:05:02,624 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:05:02,631 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:05:02,632 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:05:02,659 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:05:02,660 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:05:02,662 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:05:02,663 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:05:02,664 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:05:02,664 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:05:02,665 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:05:02,665 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:05:02,666 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:05:02,666 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:05:02,668 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:05:02,668 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:05:02,670 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:05:02,671 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:05:02,671 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:05:02,671 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:05:02,672 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:05:02,672 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:05:02,673 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 11:05:02,673 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 11:05:02,673 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:05:02,673 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 11:05:02,674 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:05:02,674 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:05:02,674 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:05:02,675 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:05:02,675 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:05:02,676 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:05:02,676 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:05:02,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:05:02,677 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:05:02,677 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:05:02,677 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:05:02,678 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 11:05:02,678 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 11:05:02,678 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:05:02,678 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:05:02,679 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:05:02,679 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:05:02,679 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 11:05:02,679 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 -> fccc32608678fc6fd4cb86e7f394d0f05414cafa3a24a1c8162582b5a3f5da8c [2024-10-11 11:05:03,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:05:03,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:05:03,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:05:03,065 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:05:03,066 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:05:03,068 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-29.i [2024-10-11 11:05:04,718 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:05:04,948 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:05:04,949 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-29.i [2024-10-11 11:05:04,969 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6d7e135c1/85ca5c85b76444afa318bd1600f9a071/FLAG7a321437a [2024-10-11 11:05:04,987 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6d7e135c1/85ca5c85b76444afa318bd1600f9a071 [2024-10-11 11:05:04,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:05:04,993 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:05:04,994 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:05:04,996 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:05:05,001 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:05:05,002 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:05:04" (1/1) ... [2024-10-11 11:05:05,003 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69533637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:05:05, skipping insertion in model container [2024-10-11 11:05:05,003 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:05:04" (1/1) ... [2024-10-11 11:05:05,040 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:05:05,250 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-1loop_file-29.i[916,929] [2024-10-11 11:05:05,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:05:05,382 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:05:05,398 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-1loop_file-29.i[916,929] [2024-10-11 11:05:05,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:05:05,478 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:05:05,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:05:05 WrapperNode [2024-10-11 11:05:05,481 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:05:05,482 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:05:05,482 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:05:05,482 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:05:05,489 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:05:05" (1/1) ... [2024-10-11 11:05:05,506 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:05:05" (1/1) ... [2024-10-11 11:05:05,542 INFO L138 Inliner]: procedures = 27, calls = 51, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 251 [2024-10-11 11:05:05,543 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:05:05,544 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:05:05,545 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:05:05,545 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:05:05,556 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:05:05" (1/1) ... [2024-10-11 11:05:05,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:05:05" (1/1) ... [2024-10-11 11:05:05,561 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:05:05" (1/1) ... [2024-10-11 11:05:05,583 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:05:05,584 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:05:05" (1/1) ... [2024-10-11 11:05:05,584 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:05:05" (1/1) ... [2024-10-11 11:05:05,596 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:05:05" (1/1) ... [2024-10-11 11:05:05,601 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:05:05" (1/1) ... [2024-10-11 11:05:05,607 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:05:05" (1/1) ... [2024-10-11 11:05:05,609 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:05:05" (1/1) ... [2024-10-11 11:05:05,615 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:05:05,618 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:05:05,618 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:05:05,618 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:05:05,620 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:05:05" (1/1) ... [2024-10-11 11:05:05,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:05:05,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:05:05,665 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:05:05,668 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:05:05,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:05:05,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 11:05:05,712 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:05:05,712 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:05:05,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:05:05,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:05:05,821 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:05:05,823 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:05:19,030 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-10-11 11:05:19,030 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:05:19,100 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:05:19,102 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:05:19,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:05:19 BoogieIcfgContainer [2024-10-11 11:05:19,103 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:05:19,105 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:05:19,105 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:05:19,109 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:05:19,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:05:04" (1/3) ... [2024-10-11 11:05:19,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c223117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:05:19, skipping insertion in model container [2024-10-11 11:05:19,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:05:05" (2/3) ... [2024-10-11 11:05:19,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c223117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:05:19, skipping insertion in model container [2024-10-11 11:05:19,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:05:19" (3/3) ... [2024-10-11 11:05:19,113 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-29.i [2024-10-11 11:05:19,129 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:05:19,130 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:05:19,217 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:05:19,225 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;@595bf9da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:05:19,225 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:05:19,233 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:05:19,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-10-11 11:05:19,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:05:19,248 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:05:19,249 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:05:19,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:05:19,254 INFO L85 PathProgramCache]: Analyzing trace with hash -246771500, now seen corresponding path program 1 times [2024-10-11 11:05:19,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:05:19,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [885305240] [2024-10-11 11:05:19,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:05:19,268 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:05:19,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:05:19,272 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:05:19,273 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:05:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:05:20,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 11:05:20,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:05:20,405 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:05:20,405 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:05:20,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:05:20,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [885305240] [2024-10-11 11:05:20,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [885305240] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:05:20,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:05:20,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:05:20,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175809487] [2024-10-11 11:05:20,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:05:20,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:05:20,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:05:20,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:05:20,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:05:20,448 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)