./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_fillercode_fillercodestructure_filler-pe-cn_file-9.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_fillercode_fillercodestructure_filler-pe-cn_file-9.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 cc33f209bced6c0c817f0d79521a5290f75a385be3ec8e5ae9230238355f74ff --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:12:38,282 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:12:38,375 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 09:12:38,383 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:12:38,383 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:12:38,421 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:12:38,422 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:12:38,422 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:12:38,423 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:12:38,424 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:12:38,424 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:12:38,425 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:12:38,425 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:12:38,427 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:12:38,428 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:12:38,428 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:12:38,428 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:12:38,429 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:12:38,429 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 09:12:38,429 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:12:38,429 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:12:38,430 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:12:38,430 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:12:38,431 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:12:38,431 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:12:38,431 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:12:38,432 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:12:38,432 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:12:38,432 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:12:38,433 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:12:38,433 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:12:38,433 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:12:38,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:12:38,434 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:12:38,434 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:12:38,435 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:12:38,435 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 09:12:38,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 09:12:38,435 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:12:38,436 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:12:38,436 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:12:38,437 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:12:38,437 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 -> cc33f209bced6c0c817f0d79521a5290f75a385be3ec8e5ae9230238355f74ff [2024-10-11 09:12:38,713 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:12:38,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:12:38,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:12:38,740 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:12:38,741 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:12:38,742 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-9.i [2024-10-11 09:12:40,238 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:12:40,463 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:12:40,464 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-9.i [2024-10-11 09:12:40,474 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fcd72022e/2e9331d4a8724e59928f159a5f4e2b64/FLAGfef32fd1d [2024-10-11 09:12:40,816 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fcd72022e/2e9331d4a8724e59928f159a5f4e2b64 [2024-10-11 09:12:40,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:12:40,819 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:12:40,821 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:12:40,821 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:12:40,827 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:12:40,828 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:12:40" (1/1) ... [2024-10-11 09:12:40,829 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e4ab571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:12:40, skipping insertion in model container [2024-10-11 09:12:40,830 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:12:40" (1/1) ... [2024-10-11 09:12:40,864 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:12:41,050 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_fillercode_fillercodestructure_filler-pe-cn_file-9.i[918,931] [2024-10-11 09:12:41,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:12:41,179 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:12:41,193 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_fillercode_fillercodestructure_filler-pe-cn_file-9.i[918,931] [2024-10-11 09:12:41,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:12:41,272 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:12:41,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:12:41 WrapperNode [2024-10-11 09:12:41,273 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:12:41,275 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:12:41,275 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:12:41,276 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:12:41,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:12:41" (1/1) ... [2024-10-11 09:12:41,293 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:12:41" (1/1) ... [2024-10-11 09:12:41,350 INFO L138 Inliner]: procedures = 26, calls = 50, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 284 [2024-10-11 09:12:41,354 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:12:41,355 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:12:41,355 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:12:41,355 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:12:41,364 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:12:41" (1/1) ... [2024-10-11 09:12:41,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:12:41" (1/1) ... [2024-10-11 09:12:41,374 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:12:41" (1/1) ... [2024-10-11 09:12:41,397 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 09:12:41,397 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:12:41" (1/1) ... [2024-10-11 09:12:41,397 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:12:41" (1/1) ... [2024-10-11 09:12:41,412 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:12:41" (1/1) ... [2024-10-11 09:12:41,421 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:12:41" (1/1) ... [2024-10-11 09:12:41,424 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:12:41" (1/1) ... [2024-10-11 09:12:41,431 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:12:41" (1/1) ... [2024-10-11 09:12:41,441 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:12:41,447 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:12:41,447 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:12:41,447 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:12:41,448 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:12:41" (1/1) ... [2024-10-11 09:12:41,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:12:41,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:12:41,484 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 09:12:41,491 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 09:12:41,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:12:41,541 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:12:41,542 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:12:41,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 09:12:41,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:12:41,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:12:41,654 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:12:41,656 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:12:42,262 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-11 09:12:42,263 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:12:42,313 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:12:42,313 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:12:42,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:12:42 BoogieIcfgContainer [2024-10-11 09:12:42,314 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:12:42,316 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:12:42,318 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:12:42,321 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:12:42,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:12:40" (1/3) ... [2024-10-11 09:12:42,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@122c5b7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:12:42, skipping insertion in model container [2024-10-11 09:12:42,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:12:41" (2/3) ... [2024-10-11 09:12:42,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@122c5b7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:12:42, skipping insertion in model container [2024-10-11 09:12:42,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:12:42" (3/3) ... [2024-10-11 09:12:42,325 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-cn_file-9.i [2024-10-11 09:12:42,343 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:12:42,344 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:12:42,409 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:12:42,416 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;@41664b26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:12:42,416 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:12:42,420 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 79 states have (on average 1.481012658227848) internal successors, (117), 80 states have internal predecessors, (117), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-11 09:12:42,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-11 09:12:42,438 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:12:42,439 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:12:42,440 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:12:42,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:12:42,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1552081568, now seen corresponding path program 1 times [2024-10-11 09:12:42,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:12:42,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626123816] [2024-10-11 09:12:42,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:12:42,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:12:42,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:42,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:12:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:42,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:12:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:42,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:12:42,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:42,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:12:42,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:42,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 09:12:42,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:42,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:12:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:42,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 09:12:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:42,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:12:42,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:42,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 09:12:42,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:42,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:12:42,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:42,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:12:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:42,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:12:42,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:42,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:12:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:42,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:12:42,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:42,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:12:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:42,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:12:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:42,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:12:42,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:42,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:12:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:42,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:12:43,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:12:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 09:12:43,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:12:43,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 09:12:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 09:12:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 09:12:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 09:12:43,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 09:12:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 09:12:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 09:12:43,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 09:12:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 09:12:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 09:12:43,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 09:12:43,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-11 09:12:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-11 09:12:43,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 09:12:43,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-11 09:12:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-10-11 09:12:43,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:12:43,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626123816] [2024-10-11 09:12:43,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626123816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:12:43,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:12:43,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:12:43,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818310371] [2024-10-11 09:12:43,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:12:43,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:12:43,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:12:43,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:12:43,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:12:43,159 INFO L87 Difference]: Start difference. First operand has 119 states, 79 states have (on average 1.481012658227848) internal successors, (117), 80 states have internal predecessors, (117), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) 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, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 2 states have call successors, (37) [2024-10-11 09:12:43,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:12:43,212 INFO L93 Difference]: Finished difference Result 235 states and 417 transitions. [2024-10-11 09:12:43,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:12:43,215 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, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 2 states have call successors, (37) Word has length 233 [2024-10-11 09:12:43,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:12:43,222 INFO L225 Difference]: With dead ends: 235 [2024-10-11 09:12:43,223 INFO L226 Difference]: Without dead ends: 117 [2024-10-11 09:12:43,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 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 09:12:43,231 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:12:43,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:12:43,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-11 09:12:43,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-10-11 09:12:43,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 78 states have (on average 1.4230769230769231) internal successors, (111), 78 states have internal predecessors, (111), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-11 09:12:43,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 185 transitions. [2024-10-11 09:12:43,294 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 185 transitions. Word has length 233 [2024-10-11 09:12:43,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:12:43,295 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 185 transitions. [2024-10-11 09:12:43,295 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, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 2 states have call successors, (37) [2024-10-11 09:12:43,295 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 185 transitions. [2024-10-11 09:12:43,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-11 09:12:43,303 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:12:43,303 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:12:43,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 09:12:43,304 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:12:43,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:12:43,306 INFO L85 PathProgramCache]: Analyzing trace with hash 562791134, now seen corresponding path program 1 times [2024-10-11 09:12:43,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:12:43,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363870453] [2024-10-11 09:12:43,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:12:43,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:12:43,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:12:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:12:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:12:43,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:12:43,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 09:12:43,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:12:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 09:12:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:12:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 09:12:43,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:12:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:12:43,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:12:43,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:12:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:12:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:12:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:12:43,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:12:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:12:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:12:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:12:43,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 09:12:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:12:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 09:12:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 09:12:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 09:12:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 09:12:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 09:12:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 09:12:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 09:12:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 09:12:43,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 09:12:43,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 09:12:43,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 09:12:43,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-11 09:12:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-11 09:12:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 09:12:43,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-11 09:12:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:43,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-10-11 09:12:43,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:12:43,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363870453] [2024-10-11 09:12:43,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363870453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:12:43,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:12:43,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:12:43,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162479679] [2024-10-11 09:12:43,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:12:43,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:12:43,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:12:43,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:12:43,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:12:43,878 INFO L87 Difference]: Start difference. First operand 117 states and 185 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, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-10-11 09:12:43,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:12:43,933 INFO L93 Difference]: Finished difference Result 234 states and 371 transitions. [2024-10-11 09:12:43,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:12:43,935 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, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 233 [2024-10-11 09:12:43,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:12:43,939 INFO L225 Difference]: With dead ends: 234 [2024-10-11 09:12:43,939 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 09:12:43,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 76 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 09:12:43,946 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:12:43,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 357 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:12:43,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 09:12:43,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-10-11 09:12:43,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 79 states have internal predecessors, (112), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-11 09:12:43,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 186 transitions. [2024-10-11 09:12:43,967 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 186 transitions. Word has length 233 [2024-10-11 09:12:43,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:12:43,969 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 186 transitions. [2024-10-11 09:12:43,969 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, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-10-11 09:12:43,970 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 186 transitions. [2024-10-11 09:12:43,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-10-11 09:12:43,973 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:12:43,973 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:12:43,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 09:12:43,974 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:12:43,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:12:43,975 INFO L85 PathProgramCache]: Analyzing trace with hash -873320503, now seen corresponding path program 1 times [2024-10-11 09:12:43,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:12:43,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199465158] [2024-10-11 09:12:43,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:12:43,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:12:44,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:46,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:12:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:46,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:12:46,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:46,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:12:46,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:46,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:12:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:46,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 09:12:46,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:46,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:12:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:46,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 09:12:46,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:46,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:12:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:46,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 09:12:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:46,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:12:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:46,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:12:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:46,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:12:46,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:46,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:12:46,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:46,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:12:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:46,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:12:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:46,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:12:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:46,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:12:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:46,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:12:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:46,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:12:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:46,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:12:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:46,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 09:12:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:46,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:12:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:46,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 09:12:46,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:46,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 09:12:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:46,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 09:12:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:46,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 09:12:46,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:46,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 09:12:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:46,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 09:12:46,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:46,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 09:12:46,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:46,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 09:12:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:46,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 09:12:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:46,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 09:12:46,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:46,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 09:12:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:46,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-11 09:12:46,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:46,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-11 09:12:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:46,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 09:12:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:46,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-11 09:12:46,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:46,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-10-11 09:12:46,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:12:46,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199465158] [2024-10-11 09:12:46,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199465158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:12:46,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:12:46,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 09:12:46,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159207962] [2024-10-11 09:12:46,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:12:46,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 09:12:46,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:12:46,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 09:12:46,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 09:12:46,589 INFO L87 Difference]: Start difference. First operand 118 states and 186 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-10-11 09:12:46,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:12:46,976 INFO L93 Difference]: Finished difference Result 291 states and 458 transitions. [2024-10-11 09:12:46,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 09:12:46,977 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 234 [2024-10-11 09:12:46,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:12:46,980 INFO L225 Difference]: With dead ends: 291 [2024-10-11 09:12:46,980 INFO L226 Difference]: Without dead ends: 174 [2024-10-11 09:12:46,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 09:12:46,982 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 210 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 09:12:46,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 676 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 09:12:46,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-10-11 09:12:46,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 159. [2024-10-11 09:12:46,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 120 states have (on average 1.5) internal successors, (180), 120 states have internal predecessors, (180), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-11 09:12:46,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 254 transitions. [2024-10-11 09:12:46,996 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 254 transitions. Word has length 234 [2024-10-11 09:12:46,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:12:46,997 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 254 transitions. [2024-10-11 09:12:46,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-10-11 09:12:46,997 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 254 transitions. [2024-10-11 09:12:47,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-10-11 09:12:47,000 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:12:47,001 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:12:47,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 09:12:47,001 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:12:47,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:12:47,002 INFO L85 PathProgramCache]: Analyzing trace with hash -732771893, now seen corresponding path program 1 times [2024-10-11 09:12:47,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:12:47,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344189134] [2024-10-11 09:12:47,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:12:47,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:12:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:49,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:12:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:49,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:12:49,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:49,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:12:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:49,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:12:49,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:49,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 09:12:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:49,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:12:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:49,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 09:12:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:49,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:12:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:49,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 09:12:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:49,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:12:49,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:49,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:12:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:49,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:12:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:49,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:12:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:49,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:12:50,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:50,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:12:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:50,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:12:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:50,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:12:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:50,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:12:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:50,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:12:50,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:50,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:12:50,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:50,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 09:12:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:50,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:12:50,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:50,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 09:12:50,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:50,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 09:12:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:50,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 09:12:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:50,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 09:12:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:50,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 09:12:50,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:50,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 09:12:50,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:50,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 09:12:50,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:50,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 09:12:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:50,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 09:12:50,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:50,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 09:12:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:50,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 09:12:50,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:50,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-11 09:12:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:50,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-11 09:12:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:50,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 09:12:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:50,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-11 09:12:50,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:50,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-10-11 09:12:50,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:12:50,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344189134] [2024-10-11 09:12:50,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344189134] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:12:50,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:12:50,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 09:12:50,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490554881] [2024-10-11 09:12:50,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:12:50,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 09:12:50,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:12:50,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 09:12:50,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-11 09:12:50,141 INFO L87 Difference]: Start difference. First operand 159 states and 254 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-10-11 09:12:52,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:12:52,591 INFO L93 Difference]: Finished difference Result 481 states and 759 transitions. [2024-10-11 09:12:52,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 09:12:52,592 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 234 [2024-10-11 09:12:52,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:12:52,595 INFO L225 Difference]: With dead ends: 481 [2024-10-11 09:12:52,596 INFO L226 Difference]: Without dead ends: 323 [2024-10-11 09:12:52,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-10-11 09:12:52,598 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 648 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 09:12:52,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 857 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 09:12:52,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-10-11 09:12:52,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 170. [2024-10-11 09:12:52,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 130 states have (on average 1.4923076923076923) internal successors, (194), 130 states have internal predecessors, (194), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-11 09:12:52,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 268 transitions. [2024-10-11 09:12:52,635 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 268 transitions. Word has length 234 [2024-10-11 09:12:52,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:12:52,636 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 268 transitions. [2024-10-11 09:12:52,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-10-11 09:12:52,637 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 268 transitions. [2024-10-11 09:12:52,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-10-11 09:12:52,640 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:12:52,641 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:12:52,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 09:12:52,641 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:12:52,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:12:52,642 INFO L85 PathProgramCache]: Analyzing trace with hash -513917175, now seen corresponding path program 1 times [2024-10-11 09:12:52,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:12:52,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695132593] [2024-10-11 09:12:52,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:12:52,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:12:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:54,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:12:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:54,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:12:54,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:54,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:12:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:54,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:12:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:54,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 09:12:54,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:54,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:12:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:54,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 09:12:54,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:54,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:12:54,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:54,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 09:12:54,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:54,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:12:54,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:54,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:12:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:54,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:12:54,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:54,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:12:54,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:54,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:12:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:54,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:12:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:54,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:12:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:54,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:12:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:54,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:12:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:54,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:12:54,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:54,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:12:54,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:54,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 09:12:54,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:54,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:12:54,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:54,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 09:12:54,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:54,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 09:12:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:54,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 09:12:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:54,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 09:12:54,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:54,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 09:12:54,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:54,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 09:12:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:54,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 09:12:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:54,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 09:12:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:54,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 09:12:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:54,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 09:12:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:54,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 09:12:54,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:54,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-11 09:12:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:54,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-11 09:12:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:54,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 09:12:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:54,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-11 09:12:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:54,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-10-11 09:12:54,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:12:54,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695132593] [2024-10-11 09:12:54,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695132593] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:12:54,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:12:54,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 09:12:54,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777542921] [2024-10-11 09:12:54,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:12:54,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 09:12:54,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:12:54,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 09:12:54,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 09:12:54,929 INFO L87 Difference]: Start difference. First operand 170 states and 268 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-10-11 09:12:56,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:12:56,222 INFO L93 Difference]: Finished difference Result 480 states and 758 transitions. [2024-10-11 09:12:56,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 09:12:56,223 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 234 [2024-10-11 09:12:56,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:12:56,227 INFO L225 Difference]: With dead ends: 480 [2024-10-11 09:12:56,227 INFO L226 Difference]: Without dead ends: 311 [2024-10-11 09:12:56,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-11 09:12:56,230 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 146 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:12:56,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 869 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 09:12:56,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-10-11 09:12:56,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 165. [2024-10-11 09:12:56,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 125 states have (on average 1.488) internal successors, (186), 125 states have internal predecessors, (186), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-11 09:12:56,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 260 transitions. [2024-10-11 09:12:56,273 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 260 transitions. Word has length 234 [2024-10-11 09:12:56,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:12:56,274 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 260 transitions. [2024-10-11 09:12:56,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-10-11 09:12:56,275 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 260 transitions. [2024-10-11 09:12:56,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-10-11 09:12:56,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:12:56,278 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:12:56,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 09:12:56,279 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:12:56,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:12:56,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1190456141, now seen corresponding path program 1 times [2024-10-11 09:12:56,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:12:56,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539733603] [2024-10-11 09:12:56,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:12:56,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:12:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:57,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:12:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:57,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:12:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:57,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:12:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:57,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:12:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:57,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 09:12:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:57,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:12:57,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:57,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 09:12:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:57,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:12:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:57,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 09:12:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:57,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:12:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:57,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:12:57,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:57,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:12:57,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:57,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:12:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:57,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:12:57,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:57,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:12:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:57,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:12:57,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:57,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:12:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:57,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:12:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:57,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:12:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:57,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:12:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:57,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 09:12:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:57,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:12:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:57,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 09:12:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:57,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 09:12:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:57,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 09:12:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:57,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 09:12:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:57,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 09:12:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:57,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 09:12:57,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:57,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 09:12:57,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:57,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 09:12:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:57,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 09:12:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:57,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 09:12:57,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:57,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 09:12:57,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:57,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-11 09:12:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:57,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-11 09:12:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:57,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 09:12:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:57,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-11 09:12:57,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:57,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-10-11 09:12:57,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:12:57,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539733603] [2024-10-11 09:12:57,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539733603] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:12:57,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:12:57,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 09:12:57,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393173182] [2024-10-11 09:12:57,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:12:57,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 09:12:57,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:12:57,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 09:12:57,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 09:12:57,463 INFO L87 Difference]: Start difference. First operand 165 states and 260 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-10-11 09:12:58,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:12:58,100 INFO L93 Difference]: Finished difference Result 400 states and 624 transitions. [2024-10-11 09:12:58,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 09:12:58,102 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 234 [2024-10-11 09:12:58,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:12:58,104 INFO L225 Difference]: With dead ends: 400 [2024-10-11 09:12:58,106 INFO L226 Difference]: Without dead ends: 236 [2024-10-11 09:12:58,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-11 09:12:58,108 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 210 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 09:12:58,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 1292 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 09:12:58,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-10-11 09:12:58,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 124. [2024-10-11 09:12:58,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 84 states have (on average 1.3928571428571428) internal successors, (117), 84 states have internal predecessors, (117), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-11 09:12:58,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 191 transitions. [2024-10-11 09:12:58,126 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 191 transitions. Word has length 234 [2024-10-11 09:12:58,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:12:58,129 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 191 transitions. [2024-10-11 09:12:58,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-10-11 09:12:58,129 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 191 transitions. [2024-10-11 09:12:58,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-10-11 09:12:58,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:12:58,133 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:12:58,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 09:12:58,134 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:12:58,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:12:58,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1985836530, now seen corresponding path program 1 times [2024-10-11 09:12:58,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:12:58,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808443044] [2024-10-11 09:12:58,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:12:58,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:12:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:58,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:12:58,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:58,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:12:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:58,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:12:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:58,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:12:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:58,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 09:12:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:58,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:12:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:58,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 09:12:58,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:58,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:12:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:58,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 09:12:58,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:58,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:12:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:58,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:12:58,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:58,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:12:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:58,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:12:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:58,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:12:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:58,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:12:58,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:58,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:12:58,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:58,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:12:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:58,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:12:58,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:58,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:12:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:58,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:12:58,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:58,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 09:12:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:58,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:12:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:58,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 09:12:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:58,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 09:12:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:58,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 09:12:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:58,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 09:12:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:58,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 09:12:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:58,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 09:12:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:58,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 09:12:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:58,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 09:12:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:58,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 09:12:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:58,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 09:12:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:58,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 09:12:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:58,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-11 09:12:58,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:58,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-11 09:12:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:58,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 09:12:58,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:58,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-11 09:12:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:58,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2024-10-11 09:12:58,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:12:58,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808443044] [2024-10-11 09:12:58,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808443044] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:12:58,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562219626] [2024-10-11 09:12:58,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:12:58,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:12:58,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:12:58,561 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 09:12:58,562 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 09:12:58,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:58,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 09:12:58,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:12:58,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-10-11 09:12:58,936 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:12:58,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562219626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:12:58,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 09:12:58,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2024-10-11 09:12:58,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619934158] [2024-10-11 09:12:58,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:12:58,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 09:12:58,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:12:58,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 09:12:58,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 09:12:58,939 INFO L87 Difference]: Start difference. First operand 124 states and 191 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, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-10-11 09:12:59,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:12:59,147 INFO L93 Difference]: Finished difference Result 294 states and 450 transitions. [2024-10-11 09:12:59,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 09:12:59,148 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, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 236 [2024-10-11 09:12:59,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:12:59,150 INFO L225 Difference]: With dead ends: 294 [2024-10-11 09:12:59,150 INFO L226 Difference]: Without dead ends: 171 [2024-10-11 09:12:59,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 09:12:59,151 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 54 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:12:59,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 798 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:12:59,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-11 09:12:59,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 168. [2024-10-11 09:12:59,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 125 states have (on average 1.432) internal successors, (179), 126 states have internal predecessors, (179), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-11 09:12:59,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 257 transitions. [2024-10-11 09:12:59,167 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 257 transitions. Word has length 236 [2024-10-11 09:12:59,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:12:59,167 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 257 transitions. [2024-10-11 09:12:59,168 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, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-10-11 09:12:59,168 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 257 transitions. [2024-10-11 09:12:59,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-10-11 09:12:59,171 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:12:59,171 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:12:59,190 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 09:12:59,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:12:59,372 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:12:59,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:12:59,373 INFO L85 PathProgramCache]: Analyzing trace with hash -2134118226, now seen corresponding path program 1 times [2024-10-11 09:12:59,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:12:59,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963347113] [2024-10-11 09:12:59,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:12:59,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:12:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:59,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:12:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:59,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:12:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:59,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:12:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:59,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:12:59,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:59,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 09:12:59,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:59,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:12:59,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:59,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 09:12:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:59,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:12:59,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:59,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 09:12:59,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:59,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:12:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:59,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:12:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:59,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:12:59,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:59,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:12:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:59,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:12:59,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:59,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:12:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:59,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:12:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:59,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:12:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:59,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:12:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:59,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:12:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:59,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:12:59,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:59,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 09:12:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:59,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:12:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:59,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 09:12:59,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:59,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 09:12:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:59,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 09:12:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:59,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 09:12:59,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:59,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 09:12:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:59,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 09:12:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:59,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 09:12:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:59,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 09:12:59,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:59,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 09:12:59,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:59,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 09:12:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:59,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 09:12:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:59,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-11 09:12:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:59,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-11 09:12:59,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:59,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 09:12:59,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:59,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-11 09:12:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:59,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2024-10-11 09:12:59,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:12:59,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963347113] [2024-10-11 09:12:59,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963347113] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:12:59,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780529110] [2024-10-11 09:12:59,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:12:59,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:12:59,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:12:59,752 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 09:12:59,753 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 09:12:59,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:12:59,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 09:12:59,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:13:00,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 548 proven. 108 refuted. 0 times theorem prover too weak. 2008 trivial. 0 not checked. [2024-10-11 09:13:00,553 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:13:00,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2024-10-11 09:13:00,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780529110] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:13:00,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 09:13:00,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-10-11 09:13:00,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174162099] [2024-10-11 09:13:00,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 09:13:00,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 09:13:00,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:13:00,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 09:13:00,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 09:13:00,877 INFO L87 Difference]: Start difference. First operand 168 states and 257 transitions. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 6 states have call successors, (109), 3 states have call predecessors, (109), 5 states have return successors, (110), 5 states have call predecessors, (110), 6 states have call successors, (110) [2024-10-11 09:13:01,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:13:01,207 INFO L93 Difference]: Finished difference Result 345 states and 521 transitions. [2024-10-11 09:13:01,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 09:13:01,208 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 6 states have call successors, (109), 3 states have call predecessors, (109), 5 states have return successors, (110), 5 states have call predecessors, (110), 6 states have call successors, (110) Word has length 236 [2024-10-11 09:13:01,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:13:01,213 INFO L225 Difference]: With dead ends: 345 [2024-10-11 09:13:01,213 INFO L226 Difference]: Without dead ends: 178 [2024-10-11 09:13:01,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 540 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2024-10-11 09:13:01,214 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 481 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 09:13:01,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 304 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 09:13:01,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-10-11 09:13:01,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2024-10-11 09:13:01,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 131 states have (on average 1.4045801526717556) internal successors, (184), 132 states have internal predecessors, (184), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-11 09:13:01,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 262 transitions. [2024-10-11 09:13:01,237 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 262 transitions. Word has length 236 [2024-10-11 09:13:01,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:13:01,239 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 262 transitions. [2024-10-11 09:13:01,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 6 states have call successors, (109), 3 states have call predecessors, (109), 5 states have return successors, (110), 5 states have call predecessors, (110), 6 states have call successors, (110) [2024-10-11 09:13:01,239 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 262 transitions. [2024-10-11 09:13:01,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-10-11 09:13:01,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:13:01,242 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:13:01,260 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 09:13:01,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:13:01,443 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:13:01,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:13:01,444 INFO L85 PathProgramCache]: Analyzing trace with hash 2026835564, now seen corresponding path program 1 times [2024-10-11 09:13:01,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:13:01,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158016075] [2024-10-11 09:13:01,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:13:01,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:13:01,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 09:13:01,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1177085103] [2024-10-11 09:13:01,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:13:01,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:13:01,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:13:01,575 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 09:13:01,577 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 09:13:01,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:01,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 09:13:01,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:13:02,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 556 proven. 96 refuted. 0 times theorem prover too weak. 2012 trivial. 0 not checked. [2024-10-11 09:13:02,119 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:13:02,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 12 proven. 96 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2024-10-11 09:13:02,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:13:02,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158016075] [2024-10-11 09:13:02,530 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 09:13:02,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177085103] [2024-10-11 09:13:02,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177085103] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:13:02,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 09:13:02,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-10-11 09:13:02,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352151764] [2024-10-11 09:13:02,531 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 09:13:02,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 09:13:02,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:13:02,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 09:13:02,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-10-11 09:13:02,534 INFO L87 Difference]: Start difference. First operand 176 states and 262 transitions. Second operand has 16 states, 16 states have (on average 5.875) internal successors, (94), 16 states have internal predecessors, (94), 3 states have call successors, (69), 2 states have call predecessors, (69), 4 states have return successors, (70), 3 states have call predecessors, (70), 3 states have call successors, (70) [2024-10-11 09:13:03,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:13:03,884 INFO L93 Difference]: Finished difference Result 520 states and 762 transitions. [2024-10-11 09:13:03,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 09:13:03,885 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.875) internal successors, (94), 16 states have internal predecessors, (94), 3 states have call successors, (69), 2 states have call predecessors, (69), 4 states have return successors, (70), 3 states have call predecessors, (70), 3 states have call successors, (70) Word has length 236 [2024-10-11 09:13:03,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:13:03,889 INFO L225 Difference]: With dead ends: 520 [2024-10-11 09:13:03,889 INFO L226 Difference]: Without dead ends: 345 [2024-10-11 09:13:03,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 456 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2024-10-11 09:13:03,892 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 235 mSDsluCounter, 1175 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:13:03,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 1401 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 09:13:03,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-10-11 09:13:03,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 245. [2024-10-11 09:13:03,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 203 states have (on average 1.522167487684729) internal successors, (309), 203 states have internal predecessors, (309), 37 states have call successors, (37), 4 states have call predecessors, (37), 4 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-11 09:13:03,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 383 transitions. [2024-10-11 09:13:03,916 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 383 transitions. Word has length 236 [2024-10-11 09:13:03,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:13:03,917 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 383 transitions. [2024-10-11 09:13:03,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.875) internal successors, (94), 16 states have internal predecessors, (94), 3 states have call successors, (69), 2 states have call predecessors, (69), 4 states have return successors, (70), 3 states have call predecessors, (70), 3 states have call successors, (70) [2024-10-11 09:13:03,917 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 383 transitions. [2024-10-11 09:13:03,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-10-11 09:13:03,919 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:13:03,920 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:13:03,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 09:13:04,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:13:04,124 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:13:04,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:13:04,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1606757699, now seen corresponding path program 1 times [2024-10-11 09:13:04,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:13:04,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786494149] [2024-10-11 09:13:04,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:13:04,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:13:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:04,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:13:04,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:04,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:13:04,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:04,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:13:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:04,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:13:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:04,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 09:13:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:04,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:13:04,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:04,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 09:13:04,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:04,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:13:04,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:04,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 09:13:04,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:04,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:13:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:04,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:13:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:04,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:13:04,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:04,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:13:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:04,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:13:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:04,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:13:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:04,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:13:04,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:04,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:13:04,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:04,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:13:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:04,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:13:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:04,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:13:04,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:04,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 09:13:04,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:04,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:13:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:04,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 09:13:04,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:04,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 09:13:04,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:04,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 09:13:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:04,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 09:13:04,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:04,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 09:13:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:04,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 09:13:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:04,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 09:13:04,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:04,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 09:13:04,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:04,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 09:13:04,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:04,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 09:13:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:04,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 09:13:04,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:04,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-11 09:13:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:04,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-11 09:13:04,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:04,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 09:13:04,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:04,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-11 09:13:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:04,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-10-11 09:13:04,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:13:04,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786494149] [2024-10-11 09:13:04,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786494149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:13:04,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:13:04,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:13:04,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364312069] [2024-10-11 09:13:04,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:13:04,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:13:04,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:13:04,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:13:04,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:13:04,280 INFO L87 Difference]: Start difference. First operand 245 states and 383 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-10-11 09:13:04,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:13:04,444 INFO L93 Difference]: Finished difference Result 572 states and 883 transitions. [2024-10-11 09:13:04,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:13:04,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 236 [2024-10-11 09:13:04,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:13:04,448 INFO L225 Difference]: With dead ends: 572 [2024-10-11 09:13:04,448 INFO L226 Difference]: Without dead ends: 328 [2024-10-11 09:13:04,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 76 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 09:13:04,449 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 158 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:13:04,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 363 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 09:13:04,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-10-11 09:13:04,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 245. [2024-10-11 09:13:04,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 203 states have (on average 1.5172413793103448) internal successors, (308), 203 states have internal predecessors, (308), 37 states have call successors, (37), 4 states have call predecessors, (37), 4 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-11 09:13:04,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 382 transitions. [2024-10-11 09:13:04,478 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 382 transitions. Word has length 236 [2024-10-11 09:13:04,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:13:04,479 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 382 transitions. [2024-10-11 09:13:04,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-10-11 09:13:04,479 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 382 transitions. [2024-10-11 09:13:04,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-10-11 09:13:04,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:13:04,482 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:13:04,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 09:13:04,482 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:13:04,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:13:04,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1674437140, now seen corresponding path program 1 times [2024-10-11 09:13:04,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:13:04,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497091616] [2024-10-11 09:13:04,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:13:04,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:13:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:07,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:13:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:07,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:13:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:07,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:13:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:07,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:13:07,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:07,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 09:13:07,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:07,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:13:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:07,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 09:13:07,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:07,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:13:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:07,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 09:13:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:07,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:13:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:07,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:13:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:07,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:13:07,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:07,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:13:07,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:07,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:13:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:07,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:13:07,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:07,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:13:07,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:07,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:13:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:07,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:13:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:07,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:13:07,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:07,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:13:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:07,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 09:13:07,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:07,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:13:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:07,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 09:13:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:07,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 09:13:07,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:07,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 09:13:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:07,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 09:13:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:07,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 09:13:07,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:07,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 09:13:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:07,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 09:13:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:07,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 09:13:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:07,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 09:13:07,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:07,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 09:13:07,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:07,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 09:13:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:07,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-11 09:13:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:07,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-11 09:13:07,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:07,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 09:13:07,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:07,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-11 09:13:07,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:07,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-10-11 09:13:07,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:13:07,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497091616] [2024-10-11 09:13:07,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497091616] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:13:07,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:13:07,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 09:13:07,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299407853] [2024-10-11 09:13:07,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:13:07,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 09:13:07,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:13:07,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 09:13:07,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-11 09:13:07,364 INFO L87 Difference]: Start difference. First operand 245 states and 382 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-10-11 09:13:09,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:13:09,911 INFO L93 Difference]: Finished difference Result 678 states and 1047 transitions. [2024-10-11 09:13:09,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 09:13:09,912 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 237 [2024-10-11 09:13:09,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:13:09,917 INFO L225 Difference]: With dead ends: 678 [2024-10-11 09:13:09,917 INFO L226 Difference]: Without dead ends: 434 [2024-10-11 09:13:09,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-11 09:13:09,919 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 605 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 1455 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 1462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:13:09,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 1402 Invalid, 1462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1455 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 09:13:09,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-10-11 09:13:09,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 326. [2024-10-11 09:13:09,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 284 states have (on average 1.5492957746478873) internal successors, (440), 284 states have internal predecessors, (440), 37 states have call successors, (37), 4 states have call predecessors, (37), 4 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-11 09:13:09,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 514 transitions. [2024-10-11 09:13:09,960 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 514 transitions. Word has length 237 [2024-10-11 09:13:09,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:13:09,961 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 514 transitions. [2024-10-11 09:13:09,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-10-11 09:13:09,961 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 514 transitions. [2024-10-11 09:13:09,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-10-11 09:13:09,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:13:09,964 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:13:09,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 09:13:09,964 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:13:09,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:13:09,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1677858512, now seen corresponding path program 1 times [2024-10-11 09:13:09,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:13:09,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073801351] [2024-10-11 09:13:09,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:13:09,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:13:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 09:13:10,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [117406842] [2024-10-11 09:13:10,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:13:10,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:13:10,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:13:10,098 INFO L229 MonitoredProcess]: Starting monitored process 5 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 09:13:10,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 09:13:10,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:13:10,308 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 09:13:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:13:10,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 09:13:10,525 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 09:13:10,526 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 09:13:10,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 09:13:10,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 09:13:10,733 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:13:10,906 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 09:13:10,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 09:13:10 BoogieIcfgContainer [2024-10-11 09:13:10,909 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 09:13:10,909 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 09:13:10,909 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 09:13:10,909 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 09:13:10,911 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:12:42" (3/4) ... [2024-10-11 09:13:10,913 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 09:13:10,914 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 09:13:10,914 INFO L158 Benchmark]: Toolchain (without parser) took 30095.43ms. Allocated memory was 157.3MB in the beginning and 539.0MB in the end (delta: 381.7MB). Free memory was 102.9MB in the beginning and 230.3MB in the end (delta: -127.4MB). Peak memory consumption was 255.7MB. Max. memory is 16.1GB. [2024-10-11 09:13:10,915 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 157.3MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:13:10,915 INFO L158 Benchmark]: CACSL2BoogieTranslator took 453.31ms. Allocated memory is still 157.3MB. Free memory was 102.4MB in the beginning and 85.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 09:13:10,915 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.68ms. Allocated memory is still 157.3MB. Free memory was 85.2MB in the beginning and 81.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 09:13:10,915 INFO L158 Benchmark]: Boogie Preprocessor took 85.76ms. Allocated memory is still 157.3MB. Free memory was 81.5MB in the beginning and 77.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 09:13:10,916 INFO L158 Benchmark]: RCFGBuilder took 867.18ms. Allocated memory was 157.3MB in the beginning and 213.9MB in the end (delta: 56.6MB). Free memory was 77.3MB in the beginning and 162.6MB in the end (delta: -85.3MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2024-10-11 09:13:10,916 INFO L158 Benchmark]: TraceAbstraction took 28592.35ms. Allocated memory was 213.9MB in the beginning and 539.0MB in the end (delta: 325.1MB). Free memory was 161.6MB in the beginning and 231.3MB in the end (delta: -69.8MB). Peak memory consumption was 254.2MB. Max. memory is 16.1GB. [2024-10-11 09:13:10,917 INFO L158 Benchmark]: Witness Printer took 4.48ms. Allocated memory is still 539.0MB. Free memory was 231.3MB in the beginning and 230.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 09:13:10,918 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.18ms. Allocated memory is still 157.3MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 453.31ms. Allocated memory is still 157.3MB. Free memory was 102.4MB in the beginning and 85.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.68ms. Allocated memory is still 157.3MB. Free memory was 85.2MB in the beginning and 81.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.76ms. Allocated memory is still 157.3MB. Free memory was 81.5MB in the beginning and 77.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 867.18ms. Allocated memory was 157.3MB in the beginning and 213.9MB in the end (delta: 56.6MB). Free memory was 77.3MB in the beginning and 162.6MB in the end (delta: -85.3MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * TraceAbstraction took 28592.35ms. Allocated memory was 213.9MB in the beginning and 539.0MB in the end (delta: 325.1MB). Free memory was 161.6MB in the beginning and 231.3MB in the end (delta: -69.8MB). Peak memory consumption was 254.2MB. Max. memory is 16.1GB. * Witness Printer took 4.48ms. Allocated memory is still 539.0MB. Free memory was 231.3MB in the beginning and 230.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 128, overapproximation of shiftLeft at line 207, overapproximation of someUnaryDOUBLEoperation at line 47, overapproximation of someBinaryDOUBLEComparisonOperation at line 207. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] signed short int var_1_3 = 1; [L24] signed long int var_1_5 = -64; [L25] signed char var_1_6 = 10; [L26] signed char var_1_7 = 5; [L27] double var_1_8 = 16.25; [L28] double var_1_9 = 1.8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 64; [L31] unsigned short int var_1_12 = 16; [L32] unsigned long int var_1_13 = 128; [L33] unsigned char var_1_15 = 1; [L34] unsigned short int var_1_16 = 256; [L35] signed char var_1_18 = -2; [L36] unsigned long int var_1_19 = 50; [L37] unsigned char var_1_20 = 0; [L38] unsigned char var_1_21 = 0; [L39] unsigned long int var_1_22 = 0; [L40] unsigned char var_1_23 = 64; [L41] unsigned char var_1_24 = 64; [L42] unsigned char var_1_25 = 2; [L43] unsigned short int var_1_26 = 32; [L44] unsigned long int var_1_27 = 100; [L45] unsigned short int var_1_28 = 64; [L46] float var_1_29 = 499.875; [L47] float var_1_30 = -0.2; [L48] float var_1_31 = 7.4; [L49] float var_1_32 = -0.375; [L50] float var_1_33 = 1.4; [L51] float var_1_34 = 200.4; [L52] float var_1_35 = 1.5; [L53] unsigned char var_1_36 = 0; [L54] unsigned char last_1_var_1_10 = 32; [L55] unsigned short int last_1_var_1_12 = 16; [L56] unsigned long int last_1_var_1_13 = 128; [L211] isInitial = 1 [L212] FCALL initially() [L213] COND TRUE 1 [L214] CALL updateLastVariables() [L202] last_1_var_1_10 = var_1_10 [L203] last_1_var_1_12 = var_1_12 [L204] last_1_var_1_13 = var_1_13 [L214] RET updateLastVariables() [L215] CALL updateVariables() [L143] var_1_3 = __VERIFIER_nondet_short() [L144] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L144] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L145] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L145] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L146] var_1_5 = __VERIFIER_nondet_long() [L147] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L147] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L148] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L148] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L149] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L149] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L150] var_1_6 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L151] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L152] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L152] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L153] var_1_7 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L154] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L155] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L155] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L156] var_1_8 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_9=9/5] [L157] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_9=9/5] [L158] var_1_9 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L159] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L160] var_1_11 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L161] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L162] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L162] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L163] var_1_15 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L164] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L165] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L165] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L166] var_1_20 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L167] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L168] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L168] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L169] var_1_21 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L170] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L171] CALL assume_abort_if_not(var_1_21 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L171] RET assume_abort_if_not(var_1_21 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L172] var_1_22 = __VERIFIER_nondet_ulong() [L173] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L173] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L174] CALL assume_abort_if_not(var_1_22 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L174] RET assume_abort_if_not(var_1_22 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L175] var_1_24 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L176] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L177] CALL assume_abort_if_not(var_1_24 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L177] RET assume_abort_if_not(var_1_24 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=2, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L178] var_1_25 = __VERIFIER_nondet_uchar() [L179] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L179] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L180] CALL assume_abort_if_not(var_1_25 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L180] RET assume_abort_if_not(var_1_25 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=100, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L181] var_1_27 = __VERIFIER_nondet_ulong() [L182] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L182] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L183] CALL assume_abort_if_not(var_1_27 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L183] RET assume_abort_if_not(var_1_27 <= 4294967295) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L184] CALL assume_abort_if_not(var_1_27 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L184] RET assume_abort_if_not(var_1_27 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_29=3999/8, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L185] var_1_29 = __VERIFIER_nondet_float() [L186] CALL assume_abort_if_not((var_1_29 >= -922337.2036854776000e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L186] RET assume_abort_if_not((var_1_29 >= -922337.2036854776000e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L187] var_1_30 = __VERIFIER_nondet_float() [L188] CALL assume_abort_if_not((var_1_30 >= -922337.2036854776000e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854776000e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L188] RET assume_abort_if_not((var_1_30 >= -922337.2036854776000e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854776000e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L189] CALL assume_abort_if_not(var_1_30 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L189] RET assume_abort_if_not(var_1_30 != 0.0F) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_31=37/5, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L190] var_1_31 = __VERIFIER_nondet_float() [L191] CALL assume_abort_if_not((var_1_31 >= -922337.2036854776000e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854776000e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L191] RET assume_abort_if_not((var_1_31 >= -922337.2036854776000e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854776000e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L192] var_1_32 = __VERIFIER_nondet_float() [L193] CALL assume_abort_if_not((var_1_32 >= -922337.2036854776000e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L193] RET assume_abort_if_not((var_1_32 >= -922337.2036854776000e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L194] CALL assume_abort_if_not(var_1_32 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L194] RET assume_abort_if_not(var_1_32 != 0.0F) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_34=1002/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L195] var_1_34 = __VERIFIER_nondet_float() [L196] CALL assume_abort_if_not((var_1_34 >= -922337.2036854765600e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L196] RET assume_abort_if_not((var_1_34 >= -922337.2036854765600e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L197] var_1_36 = __VERIFIER_nondet_uchar() [L198] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L198] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L199] CALL assume_abort_if_not(var_1_36 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L199] RET assume_abort_if_not(var_1_36 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L215] RET updateVariables() [L216] CALL step() [L60] COND TRUE ((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10 [L61] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L63] signed long int stepLocal_2 = last_1_var_1_12 + var_1_7; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_2=16, var_1_10=32, var_1_11=6, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L64] COND TRUE var_1_6 <= stepLocal_2 [L65] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L69] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L69] COND FALSE !((1 << var_1_10) != (-500 / -100)) [L76] var_1_13 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L78] var_1_18 = var_1_3 [L79] signed long int stepLocal_4 = (((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64))); [L80] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=6, stepLocal_4=6, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=256, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L81] COND FALSE !((- var_1_9) <= var_1_8) [L94] var_1_16 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=6, stepLocal_4=6, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L96] signed long int stepLocal_1 = (var_1_10 & 0) * var_1_5; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=6, stepLocal_4=6, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L97] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=6, stepLocal_4=6, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L97] signed long int stepLocal_0 = var_1_16 >> var_1_3; [L98] COND FALSE !(stepLocal_0 == (var_1_10 / var_1_5)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=6, stepLocal_4=6, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L105] COND TRUE var_1_20 || var_1_21 [L106] var_1_19 = ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=6, stepLocal_4=6, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L108] COND FALSE !(((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) == (~ 16u)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=6, stepLocal_4=6, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L113] COND TRUE var_1_22 <= var_1_19 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=6, stepLocal_4=6, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=32, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L114] COND TRUE var_1_22 <= (((((var_1_25) < (var_1_24)) ? (var_1_25) : (var_1_24))) / var_1_27) [L115] var_1_26 = ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=6, stepLocal_4=6, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L128] COND FALSE !((var_1_29 / var_1_30) > ((((var_1_31 / var_1_32) < 0 ) ? -(var_1_31 / var_1_32) : (var_1_31 / var_1_32)))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=6, stepLocal_4=6, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L133] var_1_33 = var_1_34 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=6, stepLocal_4=6, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L134] COND FALSE !(((256 - var_1_25) <= (var_1_28 + var_1_19)) || var_1_20) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=6, stepLocal_4=6, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L216] RET step() [L217] CALL, EXPR property() [L207] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L207] EXPR ((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L207] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L207] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L207] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L207-L208] return (((((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_12) ? ((var_1_13 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L217] RET, EXPR property() [L217] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=0, var_1_21=1, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=191, var_1_26=64, var_1_27=1, var_1_28=64, var_1_33=2, var_1_34=2, var_1_35=3/2, var_1_36=0, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 119 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.3s, OverallIterations: 12, TraceHistogramMax: 37, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2753 SdHoareTripleChecker+Valid, 7.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2747 mSDsluCounter, 8501 SdHoareTripleChecker+Invalid, 6.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6221 mSDsCounter, 145 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4033 IncrementalHoareTripleChecker+Invalid, 4178 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 145 mSolverCounterUnsat, 2280 mSDtfsCounter, 4033 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2057 GetRequests, 1956 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=326occurred in iteration=11, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 722 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 15.3s InterpolantComputationTime, 3765 NumberOfCodeBlocks, 3765 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3512 ConstructedInterpolants, 0 QuantifiedInterpolants, 17681 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1562 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 39336/39960 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 09:13:11,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-9.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 cc33f209bced6c0c817f0d79521a5290f75a385be3ec8e5ae9230238355f74ff --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:13:13,244 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:13:13,306 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 09:13:13,311 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:13:13,311 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:13:13,359 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:13:13,360 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:13:13,360 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:13:13,361 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:13:13,363 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:13:13,363 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:13:13,364 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:13:13,364 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:13:13,365 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:13:13,365 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:13:13,368 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:13:13,368 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:13:13,368 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:13:13,369 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:13:13,369 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:13:13,369 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:13:13,370 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:13:13,370 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:13:13,370 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 09:13:13,370 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 09:13:13,372 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:13:13,372 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 09:13:13,372 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:13:13,372 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:13:13,373 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:13:13,373 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:13:13,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:13:13,373 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:13:13,374 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:13:13,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:13:13,374 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:13:13,375 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:13:13,375 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:13:13,376 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 09:13:13,376 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 09:13:13,376 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:13:13,377 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:13:13,377 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:13:13,377 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:13:13,377 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 09:13:13,377 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 -> cc33f209bced6c0c817f0d79521a5290f75a385be3ec8e5ae9230238355f74ff [2024-10-11 09:13:13,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:13:13,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:13:13,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:13:13,719 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:13:13,720 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:13:13,722 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-9.i [2024-10-11 09:13:15,409 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:13:15,633 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:13:15,633 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-9.i [2024-10-11 09:13:15,648 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/13a7db990/eb95dbdef8a54de7b15878833beed594/FLAGd29214f20 [2024-10-11 09:13:15,674 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/13a7db990/eb95dbdef8a54de7b15878833beed594 [2024-10-11 09:13:15,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:13:15,679 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:13:15,682 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:13:15,682 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:13:15,687 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:13:15,688 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:13:15" (1/1) ... [2024-10-11 09:13:15,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f4354c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:13:15, skipping insertion in model container [2024-10-11 09:13:15,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:13:15" (1/1) ... [2024-10-11 09:13:15,722 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:13:15,912 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_fillercode_fillercodestructure_filler-pe-cn_file-9.i[918,931] [2024-10-11 09:13:16,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:13:16,044 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:13:16,059 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_fillercode_fillercodestructure_filler-pe-cn_file-9.i[918,931] [2024-10-11 09:13:16,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:13:16,127 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:13:16,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:13:16 WrapperNode [2024-10-11 09:13:16,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:13:16,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:13:16,129 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:13:16,129 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:13:16,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:13:16" (1/1) ... [2024-10-11 09:13:16,153 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:13:16" (1/1) ... [2024-10-11 09:13:16,193 INFO L138 Inliner]: procedures = 27, calls = 50, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 218 [2024-10-11 09:13:16,195 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:13:16,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:13:16,196 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:13:16,196 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:13:16,207 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:13:16" (1/1) ... [2024-10-11 09:13:16,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:13:16" (1/1) ... [2024-10-11 09:13:16,214 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:13:16" (1/1) ... [2024-10-11 09:13:16,233 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 09:13:16,234 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:13:16" (1/1) ... [2024-10-11 09:13:16,234 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:13:16" (1/1) ... [2024-10-11 09:13:16,245 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:13:16" (1/1) ... [2024-10-11 09:13:16,253 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:13:16" (1/1) ... [2024-10-11 09:13:16,256 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:13:16" (1/1) ... [2024-10-11 09:13:16,260 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:13:16" (1/1) ... [2024-10-11 09:13:16,269 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:13:16,270 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:13:16,270 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:13:16,270 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:13:16,271 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:13:16" (1/1) ... [2024-10-11 09:13:16,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:13:16,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:13:16,319 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 09:13:16,338 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 09:13:16,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:13:16,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 09:13:16,383 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:13:16,383 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:13:16,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:13:16,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:13:16,495 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:13:16,497 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:13:23,307 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-11 09:13:23,308 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:13:23,380 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:13:23,381 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:13:23,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:13:23 BoogieIcfgContainer [2024-10-11 09:13:23,382 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:13:23,385 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:13:23,385 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:13:23,388 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:13:23,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:13:15" (1/3) ... [2024-10-11 09:13:23,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16020ff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:13:23, skipping insertion in model container [2024-10-11 09:13:23,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:13:16" (2/3) ... [2024-10-11 09:13:23,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16020ff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:13:23, skipping insertion in model container [2024-10-11 09:13:23,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:13:23" (3/3) ... [2024-10-11 09:13:23,393 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-cn_file-9.i [2024-10-11 09:13:23,412 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:13:23,412 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:13:23,495 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:13:23,502 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;@49fcd10e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:13:23,503 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:13:23,507 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-11 09:13:23,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-11 09:13:23,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:13:23,528 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:13:23,529 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:13:23,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:13:23,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1174675331, now seen corresponding path program 1 times [2024-10-11 09:13:23,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:13:23,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [101649178] [2024-10-11 09:13:23,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:13:23,547 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 09:13:23,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:13:23,551 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 09:13:23,553 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 09:13:24,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:24,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 09:13:24,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:13:24,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 1172 proven. 0 refuted. 0 times theorem prover too weak. 1492 trivial. 0 not checked. [2024-10-11 09:13:24,334 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:13:24,335 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:13:24,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [101649178] [2024-10-11 09:13:24,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [101649178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:13:24,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:13:24,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:13:24,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728144056] [2024-10-11 09:13:24,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:13:24,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:13:24,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:13:24,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:13:24,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:13:24,380 INFO L87 Difference]: Start difference. First operand has 96 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-10-11 09:13:24,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:13:24,488 INFO L93 Difference]: Finished difference Result 189 states and 349 transitions. [2024-10-11 09:13:24,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:13:24,497 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 225 [2024-10-11 09:13:24,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:13:24,511 INFO L225 Difference]: With dead ends: 189 [2024-10-11 09:13:24,512 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 09:13:24,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 224 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 09:13:24,520 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:13:24,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 09:13:24,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 09:13:24,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-11 09:13:24,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 55 states have (on average 1.4) internal successors, (77), 55 states have internal predecessors, (77), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-11 09:13:24,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 151 transitions. [2024-10-11 09:13:24,582 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 151 transitions. Word has length 225 [2024-10-11 09:13:24,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:13:24,583 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 151 transitions. [2024-10-11 09:13:24,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-10-11 09:13:24,583 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 151 transitions. [2024-10-11 09:13:24,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-10-11 09:13:24,589 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:13:24,589 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:13:24,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 09:13:24,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:13:24,790 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:13:24,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:13:24,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1141650275, now seen corresponding path program 1 times [2024-10-11 09:13:24,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:13:24,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1545514892] [2024-10-11 09:13:24,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:13:24,793 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 09:13:24,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:13:24,796 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 09:13:24,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 09:13:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:25,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 09:13:25,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:13:25,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-10-11 09:13:25,655 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:13:25,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:13:25,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1545514892] [2024-10-11 09:13:25,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1545514892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:13:25,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:13:25,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:13:25,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973096359] [2024-10-11 09:13:25,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:13:25,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:13:25,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:13:25,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:13:25,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:13:25,667 INFO L87 Difference]: Start difference. First operand 94 states and 151 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-10-11 09:13:26,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:13:26,136 INFO L93 Difference]: Finished difference Result 236 states and 377 transitions. [2024-10-11 09:13:26,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:13:26,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 226 [2024-10-11 09:13:26,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:13:26,140 INFO L225 Difference]: With dead ends: 236 [2024-10-11 09:13:26,141 INFO L226 Difference]: Without dead ends: 143 [2024-10-11 09:13:26,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 224 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 09:13:26,143 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 73 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 09:13:26,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 324 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 09:13:26,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-11 09:13:26,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2024-10-11 09:13:26,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 81 states have (on average 1.382716049382716) internal successors, (112), 82 states have internal predecessors, (112), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-11 09:13:26,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 224 transitions. [2024-10-11 09:13:26,179 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 224 transitions. Word has length 226 [2024-10-11 09:13:26,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:13:26,187 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 224 transitions. [2024-10-11 09:13:26,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-10-11 09:13:26,188 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 224 transitions. [2024-10-11 09:13:26,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-10-11 09:13:26,196 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:13:26,197 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:13:26,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 09:13:26,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:13:26,398 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:13:26,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:13:26,399 INFO L85 PathProgramCache]: Analyzing trace with hash 780579221, now seen corresponding path program 1 times [2024-10-11 09:13:26,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:13:26,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1634052391] [2024-10-11 09:13:26,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:13:26,400 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 09:13:26,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:13:26,402 INFO L229 MonitoredProcess]: Starting monitored process 4 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 09:13:26,404 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 (4)] Waiting until timeout for monitored process [2024-10-11 09:13:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:13:27,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 09:13:27,141 INFO L278 TraceCheckSpWp]: Computing forward predicates...