./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-pr-co_file-13.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-pr-co_file-13.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 5c638eb37fa5d4cd96629d87733c781e3a31a3ebba4446177f78f593aedad992 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:47:04,285 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:47:04,359 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:47:04,367 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:47:04,368 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:47:04,398 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:47:04,399 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:47:04,400 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:47:04,400 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:47:04,400 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:47:04,401 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:47:04,402 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:47:04,402 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:47:04,403 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:47:04,405 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:47:04,405 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:47:04,406 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:47:04,406 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:47:04,406 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 09:47:04,407 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:47:04,407 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:47:04,411 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:47:04,412 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:47:04,412 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:47:04,412 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:47:04,412 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:47:04,413 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:47:04,413 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:47:04,413 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:47:04,413 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:47:04,413 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:47:04,414 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:47:04,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:47:04,415 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:47:04,417 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:47:04,417 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:47:04,417 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 09:47:04,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 09:47:04,418 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:47:04,418 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:47:04,418 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:47:04,419 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:47:04,419 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 -> 5c638eb37fa5d4cd96629d87733c781e3a31a3ebba4446177f78f593aedad992 [2024-10-11 09:47:04,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:47:04,756 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:47:04,759 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:47:04,764 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:47:04,764 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:47:04,766 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-13.i [2024-10-11 09:47:06,469 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:47:06,697 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:47:06,699 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-13.i [2024-10-11 09:47:06,712 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/890f2b785/cf99b9a69c824ca1936a3cb430ee499b/FLAGa720ecfab [2024-10-11 09:47:07,062 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/890f2b785/cf99b9a69c824ca1936a3cb430ee499b [2024-10-11 09:47:07,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:47:07,065 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:47:07,069 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:47:07,069 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:47:07,073 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:47:07,074 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:47:07" (1/1) ... [2024-10-11 09:47:07,075 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a1eed7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:47:07, skipping insertion in model container [2024-10-11 09:47:07,075 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:47:07" (1/1) ... [2024-10-11 09:47:07,103 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:47:07,308 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-pr-co_file-13.i[919,932] [2024-10-11 09:47:07,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:47:07,417 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:47:07,428 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-pr-co_file-13.i[919,932] [2024-10-11 09:47:07,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:47:07,510 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:47:07,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:47:07 WrapperNode [2024-10-11 09:47:07,511 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:47:07,512 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:47:07,512 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:47:07,512 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:47:07,521 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:47:07" (1/1) ... [2024-10-11 09:47:07,542 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:47:07" (1/1) ... [2024-10-11 09:47:07,599 INFO L138 Inliner]: procedures = 26, calls = 50, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 246 [2024-10-11 09:47:07,599 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:47:07,600 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:47:07,604 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:47:07,604 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:47:07,619 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:47:07" (1/1) ... [2024-10-11 09:47:07,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:47:07" (1/1) ... [2024-10-11 09:47:07,625 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:47:07" (1/1) ... [2024-10-11 09:47:07,644 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:47:07,644 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:47:07" (1/1) ... [2024-10-11 09:47:07,644 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:47:07" (1/1) ... [2024-10-11 09:47:07,655 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:47:07" (1/1) ... [2024-10-11 09:47:07,659 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:47:07" (1/1) ... [2024-10-11 09:47:07,662 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:47:07" (1/1) ... [2024-10-11 09:47:07,665 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:47:07" (1/1) ... [2024-10-11 09:47:07,671 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:47:07,672 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:47:07,672 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:47:07,673 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:47:07,673 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:47:07" (1/1) ... [2024-10-11 09:47:07,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:47:07,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:47:07,703 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:47:07,705 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:47:07,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:47:07,741 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:47:07,741 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:47:07,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 09:47:07,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:47:07,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:47:07,842 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:47:07,844 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:47:08,235 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 09:47:08,235 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:47:08,269 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:47:08,269 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:47:08,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:47:08 BoogieIcfgContainer [2024-10-11 09:47:08,270 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:47:08,272 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:47:08,272 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:47:08,275 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:47:08,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:47:07" (1/3) ... [2024-10-11 09:47:08,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@668f8985 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:47:08, skipping insertion in model container [2024-10-11 09:47:08,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:47:07" (2/3) ... [2024-10-11 09:47:08,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@668f8985 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:47:08, skipping insertion in model container [2024-10-11 09:47:08,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:47:08" (3/3) ... [2024-10-11 09:47:08,278 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-13.i [2024-10-11 09:47:08,292 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:47:08,293 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:47:08,348 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:47:08,354 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;@2e6b18a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:47:08,355 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:47:08,360 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 64 states have internal predecessors, (92), 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:47:08,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-10-11 09:47:08,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:47:08,376 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] [2024-10-11 09:47:08,376 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:47:08,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:47:08,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1641084115, now seen corresponding path program 1 times [2024-10-11 09:47:08,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:47:08,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130551264] [2024-10-11 09:47:08,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:47:08,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:47:08,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:08,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:47:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:08,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:47:08,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:08,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:47:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:08,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:47:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:08,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:47:08,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:08,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:47:08,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:08,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:47:08,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:08,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:47:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:08,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:47:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:08,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:47:08,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:08,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:47:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:08,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:47:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:08,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:47:08,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:08,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:47:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:08,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:47:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:08,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 09:47:08,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:08,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:47:08,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:08,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:47:08,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:08,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:47:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:08,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:47:08,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:08,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:47:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:08,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 09:47:08,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:08,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:47:08,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:08,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:47:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:08,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:47:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:08,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:47:08,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:08,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:47:08,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:08,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 09:47:08,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:08,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:47:08,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:08,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 09:47:08,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:08,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:47:08,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:08,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 09:47:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:08,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 09:47:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:08,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 09:47:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:08,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 09:47:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:08,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 09:47:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:08,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-11 09:47:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:08,993 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:47:08,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:47:08,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130551264] [2024-10-11 09:47:08,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130551264] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:47:08,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:47:08,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:47:08,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150289740] [2024-10-11 09:47:08,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:47:09,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:47:09,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:47:09,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:47:09,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:47:09,121 INFO L87 Difference]: Start difference. First operand has 103 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 64 states have internal predecessors, (92), 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 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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:47:09,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:47:09,300 INFO L93 Difference]: Finished difference Result 203 states and 367 transitions. [2024-10-11 09:47:09,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:47:09,306 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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 230 [2024-10-11 09:47:09,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:47:09,326 INFO L225 Difference]: With dead ends: 203 [2024-10-11 09:47:09,330 INFO L226 Difference]: Without dead ends: 101 [2024-10-11 09:47:09,334 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:47:09,342 INFO L432 NwaCegarLoop]: 156 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, 156 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:47:09,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:47:09,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-11 09:47:09,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-11 09:47:09,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 62 states have (on average 1.3709677419354838) internal successors, (85), 62 states have internal predecessors, (85), 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:47:09,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 159 transitions. [2024-10-11 09:47:09,430 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 159 transitions. Word has length 230 [2024-10-11 09:47:09,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:47:09,430 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 159 transitions. [2024-10-11 09:47:09,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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:47:09,434 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 159 transitions. [2024-10-11 09:47:09,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-10-11 09:47:09,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:47:09,443 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] [2024-10-11 09:47:09,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 09:47:09,444 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:47:09,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:47:09,444 INFO L85 PathProgramCache]: Analyzing trace with hash 510027547, now seen corresponding path program 1 times [2024-10-11 09:47:09,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:47:09,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274906770] [2024-10-11 09:47:09,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:47:09,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:47:09,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:09,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:47:09,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:09,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:47:09,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:09,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:47:09,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:09,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:47:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:09,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:47:09,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:09,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:47:09,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:09,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:47:09,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:09,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:47:09,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:09,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:47:09,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:09,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:47:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:09,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:47:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:09,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:47:09,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:09,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:47:09,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:09,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:47:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:09,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:47:09,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:09,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 09:47:09,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:09,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:47:09,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:09,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:47:09,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:09,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:47:09,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:09,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:47:09,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:09,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:47:09,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:09,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 09:47:09,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:09,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:47:09,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:09,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:47:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:09,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:47:09,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:09,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:47:09,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:09,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:47:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:09,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 09:47:09,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:09,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:47:09,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:09,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 09:47:09,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:09,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:47:09,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:09,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 09:47:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:09,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 09:47:09,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:09,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 09:47:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:09,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 09:47:09,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:09,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 09:47:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:09,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-11 09:47:09,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:09,774 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:47:09,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:47:09,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274906770] [2024-10-11 09:47:09,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274906770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:47:09,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:47:09,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:47:09,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660429091] [2024-10-11 09:47:09,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:47:09,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:47:09,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:47:09,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:47:09,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:47:09,782 INFO L87 Difference]: Start difference. First operand 101 states and 159 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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:47:09,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:47:09,855 INFO L93 Difference]: Finished difference Result 243 states and 379 transitions. [2024-10-11 09:47:09,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:47:09,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 232 [2024-10-11 09:47:09,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:47:09,862 INFO L225 Difference]: With dead ends: 243 [2024-10-11 09:47:09,864 INFO L226 Difference]: Without dead ends: 143 [2024-10-11 09:47:09,865 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:47:09,866 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 51 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:47:09,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 342 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:47:09,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-11 09:47:09,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2024-10-11 09:47:09,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 95 states have internal predecessors, (132), 43 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-11 09:47:09,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 218 transitions. [2024-10-11 09:47:09,902 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 218 transitions. Word has length 232 [2024-10-11 09:47:09,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:47:09,903 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 218 transitions. [2024-10-11 09:47:09,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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:47:09,907 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 218 transitions. [2024-10-11 09:47:09,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-10-11 09:47:09,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:47:09,911 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] [2024-10-11 09:47:09,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 09:47:09,911 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:47:09,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:47:09,912 INFO L85 PathProgramCache]: Analyzing trace with hash -307620903, now seen corresponding path program 1 times [2024-10-11 09:47:09,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:47:09,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552030149] [2024-10-11 09:47:09,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:47:09,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:47:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:47:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:47:10,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:47:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:47:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:47:10,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:47:10,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:47:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:47:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:47:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:47:10,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:47:10,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:47:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:47:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:47:10,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:47:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 09:47:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:47:10,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:47:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:47:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:47:10,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:47:10,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 09:47:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:47:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:47:10,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:47:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:47:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:47:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 09:47:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:47:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 09:47:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:47:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 09:47:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 09:47:10,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 09:47:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 09:47:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 09:47:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-11 09:47:10,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,368 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:47:10,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:47:10,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552030149] [2024-10-11 09:47:10,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552030149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:47:10,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:47:10,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:47:10,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225148834] [2024-10-11 09:47:10,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:47:10,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:47:10,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:47:10,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:47:10,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:47:10,372 INFO L87 Difference]: Start difference. First operand 140 states and 218 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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:47:10,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:47:10,412 INFO L93 Difference]: Finished difference Result 418 states and 652 transitions. [2024-10-11 09:47:10,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:47:10,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 232 [2024-10-11 09:47:10,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:47:10,419 INFO L225 Difference]: With dead ends: 418 [2024-10-11 09:47:10,420 INFO L226 Difference]: Without dead ends: 279 [2024-10-11 09:47:10,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 75 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:47:10,422 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 90 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:47:10,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 324 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:47:10,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-10-11 09:47:10,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2024-10-11 09:47:10,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 186 states have (on average 1.3978494623655915) internal successors, (260), 188 states have internal predecessors, (260), 86 states have call successors, (86), 4 states have call predecessors, (86), 4 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2024-10-11 09:47:10,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 432 transitions. [2024-10-11 09:47:10,472 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 432 transitions. Word has length 232 [2024-10-11 09:47:10,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:47:10,474 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 432 transitions. [2024-10-11 09:47:10,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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:47:10,474 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 432 transitions. [2024-10-11 09:47:10,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-10-11 09:47:10,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:47:10,476 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] [2024-10-11 09:47:10,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 09:47:10,476 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:47:10,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:47:10,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1895968805, now seen corresponding path program 1 times [2024-10-11 09:47:10,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:47:10,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489631688] [2024-10-11 09:47:10,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:47:10,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:47:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:47:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:47:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:47:10,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:47:10,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:47:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:47:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:47:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:47:10,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:47:10,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:47:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:47:10,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:47:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:47:10,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:47:10,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:47:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 09:47:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:47:10,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:47:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:47:10,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:47:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:47:10,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 09:47:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:47:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:47:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:47:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:47:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:47:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 09:47:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:47:10,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 09:47:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:47:10,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 09:47:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 09:47:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 09:47:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 09:47:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 09:47:10,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-11 09:47:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:10,775 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:47:10,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:47:10,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489631688] [2024-10-11 09:47:10,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489631688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:47:10,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:47:10,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 09:47:10,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320805460] [2024-10-11 09:47:10,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:47:10,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:47:10,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:47:10,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:47:10,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:47:10,778 INFO L87 Difference]: Start difference. First operand 277 states and 432 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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:47:11,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:47:11,110 INFO L93 Difference]: Finished difference Result 829 states and 1294 transitions. [2024-10-11 09:47:11,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:47:11,111 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 232 [2024-10-11 09:47:11,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:47:11,119 INFO L225 Difference]: With dead ends: 829 [2024-10-11 09:47:11,119 INFO L226 Difference]: Without dead ends: 553 [2024-10-11 09:47:11,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 09:47:11,126 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 117 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:47:11,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 517 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:47:11,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-10-11 09:47:11,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 551. [2024-10-11 09:47:11,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 370 states have (on average 1.3891891891891892) internal successors, (514), 374 states have internal predecessors, (514), 172 states have call successors, (172), 8 states have call predecessors, (172), 8 states have return successors, (172), 168 states have call predecessors, (172), 172 states have call successors, (172) [2024-10-11 09:47:11,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 858 transitions. [2024-10-11 09:47:11,268 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 858 transitions. Word has length 232 [2024-10-11 09:47:11,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:47:11,271 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 858 transitions. [2024-10-11 09:47:11,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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:47:11,274 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 858 transitions. [2024-10-11 09:47:11,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-10-11 09:47:11,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:47:11,281 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] [2024-10-11 09:47:11,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 09:47:11,282 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:47:11,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:47:11,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1387881241, now seen corresponding path program 1 times [2024-10-11 09:47:11,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:47:11,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574686060] [2024-10-11 09:47:11,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:47:11,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:47:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:11,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:47:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:11,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:47:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:11,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:47:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:11,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:47:11,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:11,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:47:11,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:11,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:47:11,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:11,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:47:11,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:11,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:47:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:11,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:47:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:11,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:47:11,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:11,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:47:11,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:11,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:47:11,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:11,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:47:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:11,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:47:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:11,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:47:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:11,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 09:47:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:11,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:47:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:11,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:47:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:12,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:47:12,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:12,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:47:12,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:12,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:47:12,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:12,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 09:47:12,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:12,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:47:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:12,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:47:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:12,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:47:12,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:12,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:47:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:12,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:47:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:12,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 09:47:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:12,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:47:12,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:12,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 09:47:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:12,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:47:12,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:12,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 09:47:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:12,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 09:47:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:12,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 09:47:12,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:12,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 09:47:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:12,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 09:47:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:12,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-11 09:47:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:12,236 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:47:12,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:47:12,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574686060] [2024-10-11 09:47:12,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574686060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:47:12,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:47:12,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 09:47:12,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309995731] [2024-10-11 09:47:12,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:47:12,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 09:47:12,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:47:12,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 09:47:12,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 09:47:12,242 INFO L87 Difference]: Start difference. First operand 551 states and 858 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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:47:12,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:47:12,785 INFO L93 Difference]: Finished difference Result 1300 states and 2022 transitions. [2024-10-11 09:47:12,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 09:47:12,786 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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 232 [2024-10-11 09:47:12,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:47:12,790 INFO L225 Difference]: With dead ends: 1300 [2024-10-11 09:47:12,790 INFO L226 Difference]: Without dead ends: 750 [2024-10-11 09:47:12,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 09:47:12,792 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 118 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 09:47:12,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 575 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 09:47:12,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2024-10-11 09:47:12,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 616. [2024-10-11 09:47:12,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 397 states have (on average 1.3652392947103276) internal successors, (542), 401 states have internal predecessors, (542), 209 states have call successors, (209), 9 states have call predecessors, (209), 9 states have return successors, (209), 205 states have call predecessors, (209), 209 states have call successors, (209) [2024-10-11 09:47:12,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 960 transitions. [2024-10-11 09:47:12,848 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 960 transitions. Word has length 232 [2024-10-11 09:47:12,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:47:12,849 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 960 transitions. [2024-10-11 09:47:12,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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:47:12,849 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 960 transitions. [2024-10-11 09:47:12,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-11 09:47:12,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:47:12,851 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:47:12,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 09:47:12,852 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:47:12,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:47:12,852 INFO L85 PathProgramCache]: Analyzing trace with hash 647398546, now seen corresponding path program 1 times [2024-10-11 09:47:12,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:47:12,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999264350] [2024-10-11 09:47:12,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:47:12,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:47:12,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:13,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:47:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:13,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:47:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:13,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:47:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:13,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:47:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:13,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:47:13,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:13,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:47:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:13,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:47:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:13,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:47:13,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:13,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:47:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:13,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:47:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:13,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:47:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:13,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:47:13,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:13,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:47:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:13,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:47:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:13,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:47:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:13,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 09:47:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:13,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:47:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:13,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:47:13,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:13,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:47:13,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:13,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:47:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:13,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:47:13,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:13,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 09:47:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:13,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:47:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:13,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:47:13,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:13,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:47:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:13,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:47:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:13,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:47:13,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:13,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 09:47:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:13,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:47:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:13,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 09:47:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:13,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:47:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:13,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 09:47:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:13,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 09:47:13,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:13,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 09:47:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:13,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 09:47:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:13,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 09:47:13,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:13,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-11 09:47:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:13,149 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:47:13,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:47:13,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999264350] [2024-10-11 09:47:13,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999264350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:47:13,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:47:13,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 09:47:13,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814679749] [2024-10-11 09:47:13,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:47:13,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:47:13,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:47:13,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:47:13,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:47:13,153 INFO L87 Difference]: Start difference. First operand 616 states and 960 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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:47:13,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:47:13,407 INFO L93 Difference]: Finished difference Result 1404 states and 2186 transitions. [2024-10-11 09:47:13,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 09:47:13,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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:47:13,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:47:13,415 INFO L225 Difference]: With dead ends: 1404 [2024-10-11 09:47:13,416 INFO L226 Difference]: Without dead ends: 854 [2024-10-11 09:47:13,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 09:47:13,419 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 190 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:47:13,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 279 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:47:13,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2024-10-11 09:47:13,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 652. [2024-10-11 09:47:13,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 433 states have (on average 1.371824480369515) internal successors, (594), 437 states have internal predecessors, (594), 209 states have call successors, (209), 9 states have call predecessors, (209), 9 states have return successors, (209), 205 states have call predecessors, (209), 209 states have call successors, (209) [2024-10-11 09:47:13,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 1012 transitions. [2024-10-11 09:47:13,505 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 1012 transitions. Word has length 233 [2024-10-11 09:47:13,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:47:13,505 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 1012 transitions. [2024-10-11 09:47:13,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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:47:13,506 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 1012 transitions. [2024-10-11 09:47:13,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-11 09:47:13,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:47:13,509 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:47:13,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 09:47:13,510 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:47:13,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:47:13,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1346746160, now seen corresponding path program 1 times [2024-10-11 09:47:13,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:47:13,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433746787] [2024-10-11 09:47:13,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:47:13,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:47:13,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 09:47:13,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [321030365] [2024-10-11 09:47:13,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:47:13,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:47:13,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:47:13,738 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:47:13,742 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:47:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:47:13,946 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 09:47:14,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:47:14,114 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 09:47:14,114 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 09:47:14,115 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 09:47:14,134 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:47:14,317 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:47:14,322 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:47:14,465 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 09:47:14,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 09:47:14 BoogieIcfgContainer [2024-10-11 09:47:14,467 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 09:47:14,468 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 09:47:14,468 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 09:47:14,468 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 09:47:14,468 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:47:08" (3/4) ... [2024-10-11 09:47:14,470 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 09:47:14,471 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 09:47:14,472 INFO L158 Benchmark]: Toolchain (without parser) took 7406.44ms. Allocated memory was 180.4MB in the beginning and 385.9MB in the end (delta: 205.5MB). Free memory was 108.4MB in the beginning and 327.4MB in the end (delta: -219.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:47:14,472 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 180.4MB. Free memory is still 131.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:47:14,472 INFO L158 Benchmark]: CACSL2BoogieTranslator took 442.36ms. Allocated memory was 180.4MB in the beginning and 278.9MB in the end (delta: 98.6MB). Free memory was 108.2MB in the beginning and 245.2MB in the end (delta: -137.0MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2024-10-11 09:47:14,472 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.93ms. Allocated memory is still 278.9MB. Free memory was 245.2MB in the beginning and 240.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 09:47:14,472 INFO L158 Benchmark]: Boogie Preprocessor took 71.59ms. Allocated memory is still 278.9MB. Free memory was 240.0MB in the beginning and 231.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 09:47:14,472 INFO L158 Benchmark]: RCFGBuilder took 597.76ms. Allocated memory is still 278.9MB. Free memory was 231.6MB in the beginning and 194.9MB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-11 09:47:14,473 INFO L158 Benchmark]: TraceAbstraction took 6195.68ms. Allocated memory was 278.9MB in the beginning and 385.9MB in the end (delta: 107.0MB). Free memory was 193.8MB in the beginning and 327.4MB in the end (delta: -133.6MB). Peak memory consumption was 174.8MB. Max. memory is 16.1GB. [2024-10-11 09:47:14,473 INFO L158 Benchmark]: Witness Printer took 3.52ms. Allocated memory is still 385.9MB. Free memory is still 327.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:47:14,474 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 180.4MB. Free memory is still 131.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 442.36ms. Allocated memory was 180.4MB in the beginning and 278.9MB in the end (delta: 98.6MB). Free memory was 108.2MB in the beginning and 245.2MB in the end (delta: -137.0MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.93ms. Allocated memory is still 278.9MB. Free memory was 245.2MB in the beginning and 240.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.59ms. Allocated memory is still 278.9MB. Free memory was 240.0MB in the beginning and 231.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 597.76ms. Allocated memory is still 278.9MB. Free memory was 231.6MB in the beginning and 194.9MB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6195.68ms. Allocated memory was 278.9MB in the beginning and 385.9MB in the end (delta: 107.0MB). Free memory was 193.8MB in the beginning and 327.4MB in the end (delta: -133.6MB). Peak memory consumption was 174.8MB. Max. memory is 16.1GB. * Witness Printer took 3.52ms. Allocated memory is still 385.9MB. Free memory is still 327.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 200, overapproximation of shiftRight at line 200. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L23] signed char var_1_4 = 16; [L24] unsigned char var_1_5 = 1; [L25] unsigned char var_1_6 = 1; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_9 = 0; [L28] unsigned char var_1_10 = 128; [L29] unsigned char var_1_11 = 64; [L30] signed char var_1_12 = -10; [L31] signed char var_1_13 = -10; [L32] signed char var_1_14 = -25; [L33] double var_1_15 = 64.875; [L34] double var_1_17 = 1.625; [L35] double var_1_18 = 32.2; [L36] double var_1_19 = 8.6; [L37] double var_1_20 = 10.5; [L38] signed short int var_1_21 = -64; [L39] unsigned char var_1_22 = 25; [L40] unsigned char var_1_23 = 0; [L41] unsigned long int var_1_24 = 5; [L42] double var_1_25 = 0.75; [L43] double var_1_26 = 99999999999999.5; [L44] unsigned char var_1_27 = 4; [L45] unsigned char var_1_30 = 1; [L46] unsigned char var_1_31 = 50; [L47] unsigned char var_1_32 = 0; [L48] unsigned char var_1_33 = 50; [L49] unsigned char var_1_34 = 64; [L50] signed short int var_1_35 = -64; [L51] signed char var_1_36 = -10; [L52] unsigned char var_1_37 = 2; [L53] signed char var_1_38 = -2; [L54] signed long int var_1_39 = 256; [L55] double var_1_40 = 31.6; [L56] double var_1_41 = 5.4; [L57] signed short int var_1_42 = 5; [L58] signed short int last_1_var_1_21 = -64; [L59] unsigned char last_1_var_1_22 = 25; [L204] isInitial = 1 [L205] FCALL initially() [L206] COND TRUE 1 [L207] CALL updateLastVariables() [L196] last_1_var_1_21 = var_1_21 [L197] last_1_var_1_22 = var_1_22 [L207] RET updateLastVariables() [L208] CALL updateVariables() [L136] var_1_4 = __VERIFIER_nondet_char() [L137] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L137] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L138] CALL assume_abort_if_not(var_1_4 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L138] RET assume_abort_if_not(var_1_4 <= 32) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L139] var_1_5 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_6=1, var_1_8=1, var_1_9=0] [L140] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_6=1, var_1_8=1, var_1_9=0] [L141] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L141] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L142] var_1_6 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_8=1, var_1_9=0] [L143] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_8=1, var_1_9=0] [L144] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L144] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L145] var_1_9 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1] [L146] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1] [L147] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L147] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L148] var_1_10 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L149] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L150] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L150] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L151] var_1_11 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_11 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L152] RET assume_abort_if_not(var_1_11 >= 63) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L153] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L153] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L154] var_1_13 = __VERIFIER_nondet_char() [L155] CALL assume_abort_if_not(var_1_13 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L155] RET assume_abort_if_not(var_1_13 >= -31) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L156] CALL assume_abort_if_not(var_1_13 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L156] RET assume_abort_if_not(var_1_13 <= 31) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L157] var_1_14 = __VERIFIER_nondet_char() [L158] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L158] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L159] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L159] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L160] var_1_17 = __VERIFIER_nondet_double() [L161] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L161] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L162] var_1_18 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L163] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L164] var_1_19 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_19 >= -230584.3009213691390e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 2305843.009213691390e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L165] RET assume_abort_if_not((var_1_19 >= -230584.3009213691390e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 2305843.009213691390e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L166] var_1_20 = __VERIFIER_nondet_double() [L167] CALL assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L167] RET assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L168] var_1_26 = __VERIFIER_nondet_double() [L169] CALL assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L169] RET assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=1, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L170] var_1_30 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L171] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L172] CALL assume_abort_if_not(var_1_30 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L172] RET assume_abort_if_not(var_1_30 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=50, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L173] var_1_31 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L174] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L175] CALL assume_abort_if_not(var_1_31 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L175] RET assume_abort_if_not(var_1_31 <= 254) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L176] var_1_32 = __VERIFIER_nondet_uchar() [L177] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L177] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L178] CALL assume_abort_if_not(var_1_32 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L178] RET assume_abort_if_not(var_1_32 <= 254) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L179] var_1_33 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L180] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L181] CALL assume_abort_if_not(var_1_33 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L181] RET assume_abort_if_not(var_1_33 <= 254) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=64, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L182] var_1_34 = __VERIFIER_nondet_uchar() [L183] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L183] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L184] CALL assume_abort_if_not(var_1_34 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L184] RET assume_abort_if_not(var_1_34 <= 127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_37=2, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L185] var_1_37 = __VERIFIER_nondet_uchar() [L186] CALL assume_abort_if_not(var_1_37 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L186] RET assume_abort_if_not(var_1_37 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L187] CALL assume_abort_if_not(var_1_37 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L187] RET assume_abort_if_not(var_1_37 <= 255) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L188] CALL assume_abort_if_not(var_1_37 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_37=4, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_37=4, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L188] RET assume_abort_if_not(var_1_37 != 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_37=4, var_1_38=-2, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L189] var_1_38 = __VERIFIER_nondet_char() [L190] CALL assume_abort_if_not(var_1_38 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_37=4, var_1_38=-64, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_37=4, var_1_38=-64, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L190] RET assume_abort_if_not(var_1_38 >= -127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_37=4, var_1_38=-64, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L191] CALL assume_abort_if_not(var_1_38 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_37=4, var_1_38=-64, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_37=4, var_1_38=-64, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L191] RET assume_abort_if_not(var_1_38 <= 126) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_37=4, var_1_38=-64, var_1_39=256, var_1_40=158/5, var_1_41=27/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L192] var_1_41 = __VERIFIER_nondet_double() [L193] CALL assume_abort_if_not((var_1_41 >= -922337.2036854765600e+13F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854765600e+12F && var_1_41 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_37=4, var_1_38=-64, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_37=4, var_1_38=-64, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L193] RET assume_abort_if_not((var_1_41 >= -922337.2036854765600e+13F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854765600e+12F && var_1_41 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_37=4, var_1_38=-64, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L208] RET updateVariables() [L209] CALL step() [L63] signed long int stepLocal_1 = ~ last_1_var_1_21; [L64] unsigned char stepLocal_0 = var_1_5; VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_0=1, stepLocal_1=63, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_37=4, var_1_38=-64, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L65] EXPR last_1_var_1_22 >> var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_0=1, stepLocal_1=63, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_37=4, var_1_38=-64, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L65] COND TRUE stepLocal_1 != (last_1_var_1_22 >> var_1_4) [L66] COND TRUE stepLocal_0 || var_1_6 [L67] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_37=4, var_1_38=-64, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L74] COND FALSE !(var_1_33 >= (var_1_24 % ((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_37=4, var_1_38=-64, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L81] var_1_42 = var_1_24 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_37=4, var_1_38=-64, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L82] COND FALSE !(\read(var_1_9)) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_37=4, var_1_38=-64, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L85] unsigned short int stepLocal_3 = var_1_1; VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_3=0, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_37=4, var_1_38=-64, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L86] COND FALSE !(var_1_4 > stepLocal_3) [L89] var_1_15 = var_1_17 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_37=4, var_1_38=-64, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L91] COND FALSE !(var_1_12 > var_1_22) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_37=4, var_1_38=-64, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L94] COND FALSE !(var_1_8 < ((((var_1_38) < (-64)) ? (var_1_38) : (-64)))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_37=4, var_1_38=-64, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L97] EXPR var_1_37 | var_1_31 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_37=4, var_1_38=-64, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L97] COND FALSE !((var_1_37 | var_1_31) < (8 + var_1_21)) [L101] COND TRUE ((- var_1_11) < 8) || var_1_9 [L102] var_1_22 = (var_1_4 + ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_37=4, var_1_38=-64, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L104] var_1_25 = var_1_26 [L105] var_1_23 = (var_1_11 + var_1_4) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=5, var_1_25=3, var_1_26=3, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_37=4, var_1_38=-64, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L106] COND TRUE var_1_18 <= var_1_20 [L107] var_1_24 = ((((var_1_8) < ((var_1_8 + var_1_11))) ? (var_1_8) : ((var_1_8 + var_1_11)))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_25=3, var_1_26=3, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_37=4, var_1_38=-64, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L113] COND FALSE !(var_1_6 || var_1_9) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_25=3, var_1_26=3, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_37=4, var_1_38=-64, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L118] signed short int stepLocal_2 = var_1_21; VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_2=-64, var_1_10=127, var_1_11=-449, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_25=3, var_1_26=3, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_37=4, var_1_38=-64, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L119] COND TRUE var_1_10 > stepLocal_2 [L120] var_1_12 = ((var_1_4 + var_1_13) + var_1_14) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=0, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_25=3, var_1_26=3, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_37=4, var_1_38=-64, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L122] COND FALSE !((var_1_26 >= var_1_15) && (var_1_8 >= var_1_24)) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=0, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_25=3, var_1_26=3, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_37=4, var_1_38=-64, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L129] COND FALSE !(var_1_26 > var_1_15) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=0, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_25=3, var_1_26=3, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_37=4, var_1_38=-64, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L209] RET step() [L210] CALL, EXPR property() [L200] EXPR last_1_var_1_22 >> var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=0, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_25=3, var_1_26=3, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_37=4, var_1_38=-64, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L200-L201] return (((((((((~ last_1_var_1_21) != (last_1_var_1_22 >> var_1_4)) ? ((var_1_5 || var_1_6) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) last_1_var_1_22))) : (var_1_1 == ((unsigned short int) 100))) && (var_1_9 ? (var_1_8 == ((unsigned char) (var_1_10 - (var_1_11 - var_1_4)))) : 1)) && ((var_1_10 > var_1_21) ? (var_1_12 == ((signed char) ((var_1_4 + var_1_13) + var_1_14))) : 1)) && ((var_1_4 > var_1_1) ? (var_1_15 == ((double) ((var_1_17 - var_1_18) + (((((var_1_19) > (499.25)) ? (var_1_19) : (499.25))) + var_1_20)))) : (var_1_15 == ((double) var_1_17)))) && ((var_1_6 || var_1_9) ? (((var_1_24 % var_1_10) > var_1_22) ? (var_1_21 == ((signed short int) (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) + var_1_14))) : 1) : 1)) && ((((- var_1_11) < 8) || var_1_9) ? (var_1_22 == ((unsigned char) (var_1_4 + ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) : 1)) && (var_1_23 == ((unsigned char) (var_1_11 + var_1_4)))) && ((var_1_18 <= var_1_20) ? (var_1_24 == ((unsigned long int) ((((var_1_8) < ((var_1_8 + var_1_11))) ? (var_1_8) : ((var_1_8 + var_1_11)))))) : ((9.99999999999998E13 < var_1_20) ? (var_1_24 == ((unsigned long int) var_1_1)) : 1)) ; [L210] RET, EXPR property() [L210] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=0, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_25=3, var_1_26=3, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_37=4, var_1_38=-64, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-449, var_1_12=0, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_25=3, var_1_26=3, var_1_27=4, var_1_30=0, var_1_31=4, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-64, var_1_36=-10, var_1_37=4, var_1_38=-64, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 7, TraceHistogramMax: 37, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 566 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 566 mSDsluCounter, 2193 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1234 mSDsCounter, 116 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 563 IncrementalHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 116 mSolverCounterUnsat, 959 mSDtfsCounter, 563 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 509 GetRequests, 492 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=652occurred in iteration=6, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 6 MinimizatonAttempts, 343 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1857 NumberOfCodeBlocks, 1857 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1385 ConstructedInterpolants, 0 QuantifiedInterpolants, 3873 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 15984/15984 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:47:14,545 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-pr-co_file-13.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 5c638eb37fa5d4cd96629d87733c781e3a31a3ebba4446177f78f593aedad992 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:47:16,844 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:47:16,893 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:47:16,912 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:47:16,914 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:47:16,956 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:47:16,956 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:47:16,960 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:47:16,960 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:47:16,961 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:47:16,961 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:47:16,961 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:47:16,962 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:47:16,962 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:47:16,963 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:47:16,964 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:47:16,965 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:47:16,965 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:47:16,969 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:47:16,969 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:47:16,970 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:47:16,970 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:47:16,970 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:47:16,971 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 09:47:16,971 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 09:47:16,971 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:47:16,971 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 09:47:16,972 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:47:16,972 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:47:16,972 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:47:16,973 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:47:16,973 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:47:16,973 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:47:16,973 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:47:16,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:47:16,974 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:47:16,978 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:47:16,978 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:47:16,979 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 09:47:16,979 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 09:47:16,979 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:47:16,980 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:47:16,980 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:47:16,980 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:47:16,980 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 09:47:16,980 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 -> 5c638eb37fa5d4cd96629d87733c781e3a31a3ebba4446177f78f593aedad992 [2024-10-11 09:47:17,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:47:17,308 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:47:17,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:47:17,312 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:47:17,313 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:47:17,315 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-13.i [2024-10-11 09:47:18,899 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:47:19,230 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:47:19,233 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-13.i [2024-10-11 09:47:19,244 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8b69b11a1/2298baba2a46490f8029bb8609122c07/FLAG7a188e9e2 [2024-10-11 09:47:19,510 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8b69b11a1/2298baba2a46490f8029bb8609122c07 [2024-10-11 09:47:19,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:47:19,516 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:47:19,518 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:47:19,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:47:19,523 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:47:19,524 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:47:19" (1/1) ... [2024-10-11 09:47:19,525 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54068f7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:47:19, skipping insertion in model container [2024-10-11 09:47:19,525 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:47:19" (1/1) ... [2024-10-11 09:47:19,564 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:47:19,754 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-pr-co_file-13.i[919,932] [2024-10-11 09:47:19,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:47:19,885 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:47:19,902 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-pr-co_file-13.i[919,932] [2024-10-11 09:47:19,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:47:19,962 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:47:19,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:47:19 WrapperNode [2024-10-11 09:47:19,962 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:47:19,963 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:47:19,964 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:47:19,964 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:47:19,969 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:47:19" (1/1) ... [2024-10-11 09:47:19,987 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:47:19" (1/1) ... [2024-10-11 09:47:20,017 INFO L138 Inliner]: procedures = 27, calls = 50, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 219 [2024-10-11 09:47:20,017 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:47:20,018 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:47:20,018 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:47:20,018 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:47:20,049 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:47:19" (1/1) ... [2024-10-11 09:47:20,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:47:19" (1/1) ... [2024-10-11 09:47:20,067 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:47:19" (1/1) ... [2024-10-11 09:47:20,112 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:47:20,112 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:47:19" (1/1) ... [2024-10-11 09:47:20,112 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:47:19" (1/1) ... [2024-10-11 09:47:20,123 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:47:19" (1/1) ... [2024-10-11 09:47:20,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:47:19" (1/1) ... [2024-10-11 09:47:20,131 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:47:19" (1/1) ... [2024-10-11 09:47:20,136 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:47:19" (1/1) ... [2024-10-11 09:47:20,143 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:47:20,143 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:47:20,143 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:47:20,144 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:47:20,144 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:47:19" (1/1) ... [2024-10-11 09:47:20,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:47:20,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:47:20,184 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:47:20,186 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:47:20,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:47:20,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 09:47:20,242 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:47:20,242 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:47:20,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:47:20,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:47:20,327 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:47:20,329 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:47:26,605 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 09:47:26,606 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:47:26,654 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:47:26,655 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:47:26,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:47:26 BoogieIcfgContainer [2024-10-11 09:47:26,655 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:47:26,657 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:47:26,657 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:47:26,660 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:47:26,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:47:19" (1/3) ... [2024-10-11 09:47:26,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@594ba2b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:47:26, skipping insertion in model container [2024-10-11 09:47:26,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:47:19" (2/3) ... [2024-10-11 09:47:26,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@594ba2b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:47:26, skipping insertion in model container [2024-10-11 09:47:26,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:47:26" (3/3) ... [2024-10-11 09:47:26,665 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-13.i [2024-10-11 09:47:26,693 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:47:26,693 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:47:26,758 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:47:26,767 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;@617e1b3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:47:26,767 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:47:26,772 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 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:47:26,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-10-11 09:47:26,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:47:26,785 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] [2024-10-11 09:47:26,786 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:47:26,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:47:26,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1167741829, now seen corresponding path program 1 times [2024-10-11 09:47:26,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:47:26,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [684946284] [2024-10-11 09:47:26,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:47:26,802 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:47:26,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:47:26,827 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 09:47:26,829 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:47:27,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:27,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 09:47:27,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:47:27,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 1224 proven. 0 refuted. 0 times theorem prover too weak. 1440 trivial. 0 not checked. [2024-10-11 09:47:27,412 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:47:27,413 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:47:27,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [684946284] [2024-10-11 09:47:27,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [684946284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:47:27,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:47:27,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:47:27,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320168853] [2024-10-11 09:47:27,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:47:27,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:47:27,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:47:27,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:47:27,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:47:27,446 INFO L87 Difference]: Start difference. First operand has 95 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 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 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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:47:31,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.89s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:47:31,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:47:31,403 INFO L93 Difference]: Finished difference Result 187 states and 343 transitions. [2024-10-11 09:47:31,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:47:31,438 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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 227 [2024-10-11 09:47:31,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:47:31,450 INFO L225 Difference]: With dead ends: 187 [2024-10-11 09:47:31,450 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 09:47:31,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 226 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:47:31,456 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-11 09:47:31,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-11 09:47:31,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 09:47:31,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-11 09:47:31,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 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:47:31,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 147 transitions. [2024-10-11 09:47:31,516 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 147 transitions. Word has length 227 [2024-10-11 09:47:31,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:47:31,516 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 147 transitions. [2024-10-11 09:47:31,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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:47:31,517 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 147 transitions. [2024-10-11 09:47:31,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-10-11 09:47:31,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:47:31,522 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] [2024-10-11 09:47:31,546 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:47:31,726 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:47:31,728 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:47:31,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:47:31,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1561889247, now seen corresponding path program 1 times [2024-10-11 09:47:31,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:47:31,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085459386] [2024-10-11 09:47:31,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:47:31,731 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:47:31,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:47:31,738 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:47:31,740 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:47:32,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:32,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 09:47:32,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:47:34,666 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:47:34,666 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:47:34,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:47:34,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085459386] [2024-10-11 09:47:34,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085459386] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:47:34,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:47:34,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:47:34,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141455087] [2024-10-11 09:47:34,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:47:34,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:47:34,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:47:34,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:47:34,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:47:34,670 INFO L87 Difference]: Start difference. First operand 93 states and 147 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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:47:38,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:47:41,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:47:41,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:47:41,057 INFO L93 Difference]: Finished difference Result 278 states and 440 transitions. [2024-10-11 09:47:41,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 09:47:41,089 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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 228 [2024-10-11 09:47:41,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:47:41,093 INFO L225 Difference]: With dead ends: 278 [2024-10-11 09:47:41,093 INFO L226 Difference]: Without dead ends: 186 [2024-10-11 09:47:41,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 09:47:41,095 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 90 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-10-11 09:47:41,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 477 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2024-10-11 09:47:41,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-11 09:47:41,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 168. [2024-10-11 09:47:41,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 91 states have (on average 1.2857142857142858) internal successors, (117), 91 states have internal predecessors, (117), 74 states have call successors, (74), 2 states have call predecessors, (74), 2 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2024-10-11 09:47:41,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 265 transitions. [2024-10-11 09:47:41,132 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 265 transitions. Word has length 228 [2024-10-11 09:47:41,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:47:41,133 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 265 transitions. [2024-10-11 09:47:41,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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:47:41,134 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 265 transitions. [2024-10-11 09:47:41,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-10-11 09:47:41,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:47:41,137 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] [2024-10-11 09:47:41,156 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:47:41,341 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:47:41,342 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:47:41,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:47:41,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1948856377, now seen corresponding path program 1 times [2024-10-11 09:47:41,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:47:41,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1252774432] [2024-10-11 09:47:41,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:47:41,345 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:47:41,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:47:41,348 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:47:41,350 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:47:41,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:41,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 09:47:41,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:47:42,465 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:47:42,466 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:47:42,466 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:47:42,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1252774432] [2024-10-11 09:47:42,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1252774432] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:47:42,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:47:42,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:47:42,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964319308] [2024-10-11 09:47:42,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:47:42,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:47:42,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:47:42,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:47:42,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:47:42,470 INFO L87 Difference]: Start difference. First operand 168 states and 265 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 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:47:44,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:47:44,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:47:44,940 INFO L93 Difference]: Finished difference Result 354 states and 559 transitions. [2024-10-11 09:47:44,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:47:44,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 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 229 [2024-10-11 09:47:44,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:47:44,949 INFO L225 Difference]: With dead ends: 354 [2024-10-11 09:47:44,950 INFO L226 Difference]: Without dead ends: 260 [2024-10-11 09:47:44,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 227 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:47:44,953 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 38 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 09:47:44,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 298 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 09:47:44,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-10-11 09:47:44,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 258. [2024-10-11 09:47:44,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 143 states have (on average 1.3006993006993006) internal successors, (186), 143 states have internal predecessors, (186), 111 states have call successors, (111), 3 states have call predecessors, (111), 3 states have return successors, (111), 111 states have call predecessors, (111), 111 states have call successors, (111) [2024-10-11 09:47:45,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 408 transitions. [2024-10-11 09:47:45,002 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 408 transitions. Word has length 229 [2024-10-11 09:47:45,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:47:45,003 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 408 transitions. [2024-10-11 09:47:45,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 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:47:45,003 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 408 transitions. [2024-10-11 09:47:45,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-10-11 09:47:45,006 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:47:45,006 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] [2024-10-11 09:47:45,025 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 (4)] Ended with exit code 0 [2024-10-11 09:47:45,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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:47:45,207 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:47:45,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:47:45,208 INFO L85 PathProgramCache]: Analyzing trace with hash 937739127, now seen corresponding path program 1 times [2024-10-11 09:47:45,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:47:45,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2045585091] [2024-10-11 09:47:45,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:47:45,209 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:47:45,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:47:45,215 INFO L229 MonitoredProcess]: Starting monitored process 5 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:47:45,216 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 (5)] Waiting until timeout for monitored process [2024-10-11 09:47:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:45,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 09:47:45,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:47:45,706 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:47:45,707 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:47:45,707 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:47:45,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2045585091] [2024-10-11 09:47:45,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2045585091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:47:45,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:47:45,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:47:45,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322593024] [2024-10-11 09:47:45,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:47:45,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:47:45,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:47:45,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:47:45,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:47:45,709 INFO L87 Difference]: Start difference. First operand 258 states and 408 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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:47:48,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:47:48,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:47:48,264 INFO L93 Difference]: Finished difference Result 515 states and 808 transitions. [2024-10-11 09:47:48,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:47:48,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 229 [2024-10-11 09:47:48,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:47:48,272 INFO L225 Difference]: With dead ends: 515 [2024-10-11 09:47:48,276 INFO L226 Difference]: Without dead ends: 333 [2024-10-11 09:47:48,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 227 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:47:48,279 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 43 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 09:47:48,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 311 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 09:47:48,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-10-11 09:47:48,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 329. [2024-10-11 09:47:48,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 200 states have (on average 1.335) internal successors, (267), 202 states have internal predecessors, (267), 123 states have call successors, (123), 5 states have call predecessors, (123), 5 states have return successors, (123), 121 states have call predecessors, (123), 123 states have call successors, (123) [2024-10-11 09:47:48,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 513 transitions. [2024-10-11 09:47:48,348 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 513 transitions. Word has length 229 [2024-10-11 09:47:48,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:47:48,349 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 513 transitions. [2024-10-11 09:47:48,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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:47:48,350 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 513 transitions. [2024-10-11 09:47:48,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-10-11 09:47:48,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:47:48,356 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] [2024-10-11 09:47:48,397 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 (5)] Ended with exit code 0 [2024-10-11 09:47:48,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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:47:48,557 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:47:48,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:47:48,558 INFO L85 PathProgramCache]: Analyzing trace with hash -650608775, now seen corresponding path program 1 times [2024-10-11 09:47:48,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:47:48,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1698143720] [2024-10-11 09:47:48,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:47:48,559 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:47:48,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:47:48,562 INFO L229 MonitoredProcess]: Starting monitored process 6 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:47:48,563 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 (6)] Waiting until timeout for monitored process [2024-10-11 09:47:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:49,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 09:47:49,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:47:50,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 74 proven. 210 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-11 09:47:50,492 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:47:50,928 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:47:50,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:47:50,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1698143720] [2024-10-11 09:47:50,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1698143720] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 09:47:50,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 09:47:50,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2024-10-11 09:47:50,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275919123] [2024-10-11 09:47:50,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:47:50,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:47:50,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:47:50,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:47:50,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-10-11 09:47:50,931 INFO L87 Difference]: Start difference. First operand 329 states and 513 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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:47:52,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:47:55,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:47:58,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.49s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:47:59,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:47:59,121 INFO L93 Difference]: Finished difference Result 694 states and 1080 transitions. [2024-10-11 09:47:59,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:47:59,122 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 229 [2024-10-11 09:47:59,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:47:59,127 INFO L225 Difference]: With dead ends: 694 [2024-10-11 09:47:59,127 INFO L226 Difference]: Without dead ends: 440 [2024-10-11 09:47:59,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 446 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-11 09:47:59,129 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 39 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:47:59,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 401 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2024-10-11 09:47:59,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-10-11 09:47:59,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 356. [2024-10-11 09:47:59,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 227 states have (on average 1.3480176211453745) internal successors, (306), 229 states have internal predecessors, (306), 123 states have call successors, (123), 5 states have call predecessors, (123), 5 states have return successors, (123), 121 states have call predecessors, (123), 123 states have call successors, (123) [2024-10-11 09:47:59,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 552 transitions. [2024-10-11 09:47:59,171 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 552 transitions. Word has length 229 [2024-10-11 09:47:59,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:47:59,172 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 552 transitions. [2024-10-11 09:47:59,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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:47:59,172 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 552 transitions. [2024-10-11 09:47:59,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-10-11 09:47:59,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:47:59,175 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] [2024-10-11 09:47:59,194 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 (6)] Forceful destruction successful, exit code 0 [2024-10-11 09:47:59,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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:47:59,376 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:47:59,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:47:59,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1930472453, now seen corresponding path program 1 times [2024-10-11 09:47:59,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:47:59,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [103229332] [2024-10-11 09:47:59,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:47:59,379 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:47:59,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:47:59,380 INFO L229 MonitoredProcess]: Starting monitored process 7 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:47:59,382 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 (7)] Waiting until timeout for monitored process [2024-10-11 09:47:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:47:59,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-11 09:47:59,880 INFO L278 TraceCheckSpWp]: Computing forward predicates...