./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-78.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-78.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 389c0a502a3185807f3b8690c73a08390109bda5b59f3ae6d40c34b48d123843 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:10:16,281 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:10:16,344 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:10:16,350 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:10:16,352 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:10:16,376 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:10:16,376 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:10:16,377 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:10:16,377 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:10:16,378 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:10:16,378 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:10:16,378 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:10:16,379 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:10:16,379 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:10:16,379 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:10:16,380 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:10:16,380 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:10:16,381 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:10:16,381 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:10:16,381 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:10:16,381 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:10:16,386 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:10:16,386 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:10:16,386 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:10:16,386 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:10:16,387 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:10:16,387 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:10:16,387 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:10:16,387 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:10:16,388 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:10:16,388 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:10:16,388 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:10:16,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:10:16,388 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:10:16,389 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:10:16,389 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:10:16,389 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:10:16,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:10:16,389 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:10:16,390 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:10:16,390 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:10:16,390 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:10:16,390 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 -> 389c0a502a3185807f3b8690c73a08390109bda5b59f3ae6d40c34b48d123843 [2024-10-11 11:10:16,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:10:16,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:10:16,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:10:16,663 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:10:16,663 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:10:16,664 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-78.i [2024-10-11 11:10:18,201 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:10:18,414 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:10:18,414 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-78.i [2024-10-11 11:10:18,426 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/937425661/a7cc64a2ac6249ea82f23eacfdc3ce2b/FLAG51d739bf4 [2024-10-11 11:10:18,778 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/937425661/a7cc64a2ac6249ea82f23eacfdc3ce2b [2024-10-11 11:10:18,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:10:18,783 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:10:18,785 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:10:18,785 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:10:18,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:10:18,793 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:10:18" (1/1) ... [2024-10-11 11:10:18,796 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11a3d079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:18, skipping insertion in model container [2024-10-11 11:10:18,796 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:10:18" (1/1) ... [2024-10-11 11:10:18,835 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:10:19,012 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-78.i[916,929] [2024-10-11 11:10:19,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:10:19,141 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:10:19,153 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-78.i[916,929] [2024-10-11 11:10:19,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:10:19,293 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:10:19,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:19 WrapperNode [2024-10-11 11:10:19,297 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:10:19,298 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:10:19,302 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:10:19,302 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:10:19,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:19" (1/1) ... [2024-10-11 11:10:19,322 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:19" (1/1) ... [2024-10-11 11:10:19,370 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 255 [2024-10-11 11:10:19,370 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:10:19,375 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:10:19,375 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:10:19,375 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:10:19,387 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:19" (1/1) ... [2024-10-11 11:10:19,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:19" (1/1) ... [2024-10-11 11:10:19,395 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:19" (1/1) ... [2024-10-11 11:10:19,425 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:10:19,426 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:19" (1/1) ... [2024-10-11 11:10:19,426 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:19" (1/1) ... [2024-10-11 11:10:19,442 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:19" (1/1) ... [2024-10-11 11:10:19,450 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:19" (1/1) ... [2024-10-11 11:10:19,458 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:19" (1/1) ... [2024-10-11 11:10:19,464 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:19" (1/1) ... [2024-10-11 11:10:19,471 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:10:19,472 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:10:19,472 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:10:19,472 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:10:19,473 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:19" (1/1) ... [2024-10-11 11:10:19,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:10:19,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:10:19,506 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:10:19,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:10:19,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:10:19,549 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:10:19,549 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:10:19,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:10:19,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:10:19,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:10:19,631 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:10:19,633 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:10:20,098 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-11 11:10:20,099 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:10:20,143 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:10:20,144 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:10:20,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:10:20 BoogieIcfgContainer [2024-10-11 11:10:20,145 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:10:20,147 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:10:20,147 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:10:20,151 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:10:20,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:10:18" (1/3) ... [2024-10-11 11:10:20,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1adf4f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:10:20, skipping insertion in model container [2024-10-11 11:10:20,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:19" (2/3) ... [2024-10-11 11:10:20,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1adf4f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:10:20, skipping insertion in model container [2024-10-11 11:10:20,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:10:20" (3/3) ... [2024-10-11 11:10:20,155 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-78.i [2024-10-11 11:10:20,172 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:10:20,172 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:10:20,236 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:10:20,243 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;@7e4f0bb7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:10:20,243 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:10:20,247 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 67 states have internal predecessors, (97), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-11 11:10:20,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-11 11:10:20,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:10:20,270 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:10:20,270 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:10:20,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:10:20,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1617100037, now seen corresponding path program 1 times [2024-10-11 11:10:20,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:10:20,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338277419] [2024-10-11 11:10:20,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:10:20,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:10:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:20,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:10:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:20,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:10:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:20,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:10:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:20,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:10:20,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:20,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:10:20,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:20,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:10:20,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:20,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:10:20,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:20,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 11:10:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:20,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 11:10:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:20,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 11:10:20,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:20,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 11:10:20,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:20,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 11:10:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:20,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 11:10:20,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:20,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 11:10:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:20,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 11:10:20,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:20,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 11:10:20,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:20,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 11:10:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:20,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 11:10:20,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:20,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 11:10:20,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:20,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 11:10:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:20,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 11:10:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:20,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 11:10:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:20,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:10:20,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:20,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:10:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:20,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 11:10:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:20,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:10:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:20,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 11:10:20,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:20,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:10:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:20,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 11:10:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:20,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-11 11:10:20,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:20,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 11:10:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:20,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 11:10:20,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:20,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 11:10:20,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:20,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-11 11:10:20,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:10:20,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338277419] [2024-10-11 11:10:20,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338277419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:10:20,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:10:20,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:10:20,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987727657] [2024-10-11 11:10:20,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:10:20,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:10:20,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:10:21,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:10:21,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:10:21,004 INFO L87 Difference]: Start difference. First operand has 102 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 67 states have internal predecessors, (97), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-11 11:10:21,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:10:21,056 INFO L93 Difference]: Finished difference Result 203 states and 358 transitions. [2024-10-11 11:10:21,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:10:21,059 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 208 [2024-10-11 11:10:21,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:10:21,067 INFO L225 Difference]: With dead ends: 203 [2024-10-11 11:10:21,068 INFO L226 Difference]: Without dead ends: 100 [2024-10-11 11:10:21,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:10:21,079 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:10:21,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:10:21,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-11 11:10:21,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-10-11 11:10:21,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 65 states have (on average 1.4153846153846155) internal successors, (92), 65 states have internal predecessors, (92), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-11 11:10:21,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 158 transitions. [2024-10-11 11:10:21,156 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 158 transitions. Word has length 208 [2024-10-11 11:10:21,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:10:21,158 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 158 transitions. [2024-10-11 11:10:21,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-11 11:10:21,158 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 158 transitions. [2024-10-11 11:10:21,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-11 11:10:21,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:10:21,166 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:10:21,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:10:21,166 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:10:21,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:10:21,167 INFO L85 PathProgramCache]: Analyzing trace with hash -173832459, now seen corresponding path program 1 times [2024-10-11 11:10:21,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:10:21,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060931053] [2024-10-11 11:10:21,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:10:21,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:10:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:21,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:10:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:21,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:10:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:21,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:10:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:21,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:10:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:21,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:10:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:21,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:10:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:21,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:10:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:21,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 11:10:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:21,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 11:10:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:21,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 11:10:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:21,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 11:10:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:21,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 11:10:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:21,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 11:10:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:21,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 11:10:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:21,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 11:10:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:21,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 11:10:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:21,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 11:10:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:21,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 11:10:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:21,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 11:10:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:21,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 11:10:21,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:21,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 11:10:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:21,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 11:10:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:21,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:10:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:21,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:10:21,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:21,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 11:10:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:21,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:10:21,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:21,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 11:10:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:21,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:10:21,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:21,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 11:10:21,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:21,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-11 11:10:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:21,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 11:10:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:21,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 11:10:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:21,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 11:10:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:21,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-11 11:10:21,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:10:21,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060931053] [2024-10-11 11:10:21,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060931053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:10:21,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:10:21,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:10:21,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074234871] [2024-10-11 11:10:21,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:10:21,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:10:21,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:10:21,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:10:21,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:10:21,584 INFO L87 Difference]: Start difference. First operand 100 states and 158 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 11:10:21,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:10:21,724 INFO L93 Difference]: Finished difference Result 297 states and 470 transitions. [2024-10-11 11:10:21,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:10:21,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 208 [2024-10-11 11:10:21,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:10:21,729 INFO L225 Difference]: With dead ends: 297 [2024-10-11 11:10:21,729 INFO L226 Difference]: Without dead ends: 198 [2024-10-11 11:10:21,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:10:21,731 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 148 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:10:21,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 422 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:10:21,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-10-11 11:10:21,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2024-10-11 11:10:21,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 127 states have (on average 1.3858267716535433) internal successors, (176), 127 states have internal predecessors, (176), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-11 11:10:21,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 308 transitions. [2024-10-11 11:10:21,789 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 308 transitions. Word has length 208 [2024-10-11 11:10:21,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:10:21,790 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 308 transitions. [2024-10-11 11:10:21,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 11:10:21,790 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 308 transitions. [2024-10-11 11:10:21,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-11 11:10:21,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:10:21,797 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:10:21,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:10:21,798 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:10:21,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:10:21,798 INFO L85 PathProgramCache]: Analyzing trace with hash -760638473, now seen corresponding path program 1 times [2024-10-11 11:10:21,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:10:21,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449425648] [2024-10-11 11:10:21,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:10:21,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:10:22,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:22,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:10:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:22,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:10:22,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:22,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:10:22,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:22,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:10:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:22,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:10:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:22,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:10:22,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:22,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:10:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:22,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 11:10:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:22,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 11:10:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:22,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 11:10:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:22,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 11:10:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:22,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 11:10:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:22,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 11:10:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:22,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 11:10:22,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:22,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 11:10:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:22,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 11:10:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:22,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 11:10:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:22,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 11:10:22,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:22,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 11:10:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:22,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 11:10:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:22,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 11:10:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:22,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 11:10:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:22,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:10:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:22,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:10:22,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:22,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 11:10:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:22,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:10:22,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:22,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 11:10:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:22,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:10:22,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:22,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 11:10:22,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:22,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-11 11:10:22,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:23,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 11:10:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:23,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 11:10:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:23,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 11:10:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:23,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 87 proven. 9 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-11 11:10:23,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:10:23,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449425648] [2024-10-11 11:10:23,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449425648] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:10:23,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276619841] [2024-10-11 11:10:23,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:10:23,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:10:23,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:10:23,047 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:10:23,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 11:10:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:23,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-11 11:10:23,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:10:27,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 547 proven. 336 refuted. 0 times theorem prover too weak. 1229 trivial. 0 not checked. [2024-10-11 11:10:27,082 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:10:28,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 87 proven. 9 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-11 11:10:28,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276619841] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 11:10:28,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 11:10:28,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 24, 10] total 38 [2024-10-11 11:10:28,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245256605] [2024-10-11 11:10:28,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 11:10:28,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-11 11:10:28,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:10:28,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-11 11:10:28,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1159, Unknown=0, NotChecked=0, Total=1406 [2024-10-11 11:10:28,463 INFO L87 Difference]: Start difference. First operand 196 states and 308 transitions. Second operand has 38 states, 38 states have (on average 3.0789473684210527) internal successors, (117), 35 states have internal predecessors, (117), 10 states have call successors, (69), 8 states have call predecessors, (69), 11 states have return successors, (70), 9 states have call predecessors, (70), 10 states have call successors, (70) [2024-10-11 11:10:36,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:10:36,269 INFO L93 Difference]: Finished difference Result 1356 states and 2073 transitions. [2024-10-11 11:10:36,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-10-11 11:10:36,273 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.0789473684210527) internal successors, (117), 35 states have internal predecessors, (117), 10 states have call successors, (69), 8 states have call predecessors, (69), 11 states have return successors, (70), 9 states have call predecessors, (70), 10 states have call successors, (70) Word has length 208 [2024-10-11 11:10:36,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:10:36,287 INFO L225 Difference]: With dead ends: 1356 [2024-10-11 11:10:36,288 INFO L226 Difference]: Without dead ends: 1161 [2024-10-11 11:10:36,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 456 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2948 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1566, Invalid=7554, Unknown=0, NotChecked=0, Total=9120 [2024-10-11 11:10:36,294 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 1925 mSDsluCounter, 3483 mSDsCounter, 0 mSdLazyCounter, 3460 mSolverCounterSat, 758 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1985 SdHoareTripleChecker+Valid, 3755 SdHoareTripleChecker+Invalid, 4218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 758 IncrementalHoareTripleChecker+Valid, 3460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:10:36,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1985 Valid, 3755 Invalid, 4218 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [758 Valid, 3460 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-10-11 11:10:36,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2024-10-11 11:10:36,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 522. [2024-10-11 11:10:36,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 351 states have (on average 1.3276353276353277) internal successors, (466), 353 states have internal predecessors, (466), 157 states have call successors, (157), 13 states have call predecessors, (157), 13 states have return successors, (157), 155 states have call predecessors, (157), 157 states have call successors, (157) [2024-10-11 11:10:36,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 780 transitions. [2024-10-11 11:10:36,491 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 780 transitions. Word has length 208 [2024-10-11 11:10:36,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:10:36,494 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 780 transitions. [2024-10-11 11:10:36,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.0789473684210527) internal successors, (117), 35 states have internal predecessors, (117), 10 states have call successors, (69), 8 states have call predecessors, (69), 11 states have return successors, (70), 9 states have call predecessors, (70), 10 states have call successors, (70) [2024-10-11 11:10:36,495 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 780 transitions. [2024-10-11 11:10:36,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-11 11:10:36,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:10:36,498 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:10:36,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 11:10:36,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:10:36,704 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:10:36,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:10:36,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1540184117, now seen corresponding path program 1 times [2024-10-11 11:10:36,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:10:36,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587623390] [2024-10-11 11:10:36,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:10:36,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:10:36,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:39,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:10:39,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:40,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:10:40,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:40,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:10:40,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:40,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:10:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:40,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:10:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:40,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:10:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:40,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:10:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:40,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 11:10:40,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:40,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 11:10:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:40,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 11:10:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:40,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 11:10:40,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:40,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 11:10:40,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:40,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 11:10:40,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:40,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 11:10:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:40,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 11:10:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:40,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 11:10:40,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:40,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 11:10:40,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:40,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 11:10:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:40,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 11:10:40,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:40,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 11:10:40,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:40,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 11:10:40,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:40,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 11:10:40,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:40,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:10:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:40,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:10:40,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:40,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 11:10:40,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:40,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:10:40,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:40,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 11:10:40,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:40,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:10:40,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:40,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 11:10:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:40,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-11 11:10:40,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:40,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 11:10:40,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:40,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 11:10:40,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:40,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 11:10:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:40,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-11 11:10:40,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:10:40,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587623390] [2024-10-11 11:10:40,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587623390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:10:40,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:10:40,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 11:10:40,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989422292] [2024-10-11 11:10:40,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:10:40,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 11:10:40,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:10:40,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 11:10:40,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 11:10:40,745 INFO L87 Difference]: Start difference. First operand 522 states and 780 transitions. Second operand has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-11 11:10:42,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:10:42,333 INFO L93 Difference]: Finished difference Result 894 states and 1337 transitions. [2024-10-11 11:10:42,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 11:10:42,334 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 208 [2024-10-11 11:10:42,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:10:42,340 INFO L225 Difference]: With dead ends: 894 [2024-10-11 11:10:42,340 INFO L226 Difference]: Without dead ends: 642 [2024-10-11 11:10:42,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-11 11:10:42,343 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 356 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:10:42,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 849 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 11:10:42,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-10-11 11:10:42,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 520. [2024-10-11 11:10:42,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 349 states have (on average 1.326647564469914) internal successors, (463), 351 states have internal predecessors, (463), 157 states have call successors, (157), 13 states have call predecessors, (157), 13 states have return successors, (157), 155 states have call predecessors, (157), 157 states have call successors, (157) [2024-10-11 11:10:42,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 777 transitions. [2024-10-11 11:10:42,444 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 777 transitions. Word has length 208 [2024-10-11 11:10:42,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:10:42,445 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 777 transitions. [2024-10-11 11:10:42,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-11 11:10:42,446 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 777 transitions. [2024-10-11 11:10:42,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-11 11:10:42,448 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:10:42,449 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:10:42,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 11:10:42,449 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:10:42,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:10:42,450 INFO L85 PathProgramCache]: Analyzing trace with hash 465518377, now seen corresponding path program 1 times [2024-10-11 11:10:42,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:10:42,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045959211] [2024-10-11 11:10:42,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:10:42,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:10:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:43,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:10:43,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:43,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:10:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:43,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:10:43,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:43,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:10:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:43,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:10:43,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:43,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:10:43,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:43,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:10:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:43,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 11:10:43,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:43,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 11:10:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:43,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 11:10:43,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:43,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 11:10:43,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:43,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 11:10:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:43,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 11:10:43,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:43,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 11:10:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:43,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 11:10:43,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:43,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 11:10:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:43,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 11:10:43,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:43,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 11:10:43,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:43,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 11:10:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:43,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 11:10:43,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:43,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 11:10:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:43,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 11:10:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:43,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:10:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:43,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 11:10:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:43,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 11:10:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:43,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 11:10:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:43,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 11:10:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:43,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 11:10:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:43,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 11:10:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:43,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-11 11:10:43,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:43,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 11:10:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:43,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 11:10:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:43,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 11:10:43,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:43,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-11 11:10:43,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:10:43,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045959211] [2024-10-11 11:10:43,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045959211] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:10:43,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:10:43,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 11:10:43,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686377272] [2024-10-11 11:10:43,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:10:43,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 11:10:43,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:10:43,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 11:10:43,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 11:10:43,166 INFO L87 Difference]: Start difference. First operand 520 states and 777 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, (33), 1 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 11:10:43,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:10:43,587 INFO L93 Difference]: Finished difference Result 961 states and 1435 transitions. [2024-10-11 11:10:43,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 11:10:43,588 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, (33), 1 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2024-10-11 11:10:43,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:10:43,593 INFO L225 Difference]: With dead ends: 961 [2024-10-11 11:10:43,593 INFO L226 Difference]: Without dead ends: 544 [2024-10-11 11:10:43,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-11 11:10:43,597 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 179 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 11:10:43,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 275 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 11:10:43,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2024-10-11 11:10:43,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 526. [2024-10-11 11:10:43,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 353 states have (on average 1.2861189801699717) internal successors, (454), 355 states have internal predecessors, (454), 157 states have call successors, (157), 15 states have call predecessors, (157), 15 states have return successors, (157), 155 states have call predecessors, (157), 157 states have call successors, (157) [2024-10-11 11:10:43,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 768 transitions. [2024-10-11 11:10:43,707 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 768 transitions. Word has length 209 [2024-10-11 11:10:43,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:10:43,708 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 768 transitions. [2024-10-11 11:10:43,708 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, (33), 1 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 11:10:43,708 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 768 transitions. [2024-10-11 11:10:43,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-11 11:10:43,712 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:10:43,712 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:10:43,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 11:10:43,712 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:10:43,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:10:43,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1486586731, now seen corresponding path program 1 times [2024-10-11 11:10:43,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:10:43,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079815270] [2024-10-11 11:10:43,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:10:43,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:10:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 11:10:43,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1699048859] [2024-10-11 11:10:43,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:10:43,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:10:43,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:10:43,984 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:10:43,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 11:10:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:10:44,184 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 11:10:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:10:44,389 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 11:10:44,390 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 11:10:44,391 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:10:44,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 11:10:44,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:10:44,603 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-11 11:10:44,783 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:10:44,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:10:44 BoogieIcfgContainer [2024-10-11 11:10:44,788 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:10:44,789 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:10:44,789 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:10:44,789 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:10:44,790 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:10:20" (3/4) ... [2024-10-11 11:10:44,792 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 11:10:44,793 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:10:44,794 INFO L158 Benchmark]: Toolchain (without parser) took 26010.29ms. Allocated memory was 163.6MB in the beginning and 446.7MB in the end (delta: 283.1MB). Free memory was 94.0MB in the beginning and 255.0MB in the end (delta: -161.0MB). Peak memory consumption was 124.9MB. Max. memory is 16.1GB. [2024-10-11 11:10:44,794 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 119.5MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:10:44,794 INFO L158 Benchmark]: CACSL2BoogieTranslator took 512.57ms. Allocated memory is still 163.6MB. Free memory was 93.8MB in the beginning and 132.4MB in the end (delta: -38.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 11:10:44,794 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.33ms. Allocated memory is still 163.6MB. Free memory was 132.4MB in the beginning and 128.3MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 11:10:44,795 INFO L158 Benchmark]: Boogie Preprocessor took 96.72ms. Allocated memory is still 163.6MB. Free memory was 128.3MB in the beginning and 121.7MB in the end (delta: 6.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 11:10:44,795 INFO L158 Benchmark]: RCFGBuilder took 672.86ms. Allocated memory is still 163.6MB. Free memory was 121.7MB in the beginning and 87.1MB in the end (delta: 34.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-11 11:10:44,795 INFO L158 Benchmark]: TraceAbstraction took 24641.08ms. Allocated memory was 163.6MB in the beginning and 446.7MB in the end (delta: 283.1MB). Free memory was 86.3MB in the beginning and 255.0MB in the end (delta: -168.7MB). Peak memory consumption was 117.0MB. Max. memory is 16.1GB. [2024-10-11 11:10:44,795 INFO L158 Benchmark]: Witness Printer took 4.23ms. Allocated memory is still 446.7MB. Free memory is still 255.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:10:44,797 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 119.5MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 512.57ms. Allocated memory is still 163.6MB. Free memory was 93.8MB in the beginning and 132.4MB in the end (delta: -38.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.33ms. Allocated memory is still 163.6MB. Free memory was 132.4MB in the beginning and 128.3MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.72ms. Allocated memory is still 163.6MB. Free memory was 128.3MB in the beginning and 121.7MB in the end (delta: 6.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 672.86ms. Allocated memory is still 163.6MB. Free memory was 121.7MB in the beginning and 87.1MB in the end (delta: 34.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 24641.08ms. Allocated memory was 163.6MB in the beginning and 446.7MB in the end (delta: 283.1MB). Free memory was 86.3MB in the beginning and 255.0MB in the end (delta: -168.7MB). Peak memory consumption was 117.0MB. Max. memory is 16.1GB. * Witness Printer took 4.23ms. Allocated memory is still 446.7MB. Free memory is still 255.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 203, overapproximation of someBinaryArithmeticDOUBLEoperation at line 71. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 100; [L23] unsigned short int var_1_3 = 63223; [L24] unsigned short int var_1_4 = 63229; [L25] double var_1_6 = 0.5; [L26] double var_1_8 = 9.2; [L27] double var_1_9 = 0.875; [L28] double var_1_10 = 127.5; [L29] double var_1_11 = 100000000000000.5; [L30] double var_1_12 = 64.5; [L31] unsigned long int var_1_13 = 16; [L32] signed char var_1_14 = -128; [L33] signed char var_1_15 = 8; [L34] signed char var_1_16 = 0; [L35] signed char var_1_17 = 100; [L36] signed char var_1_18 = 16; [L37] signed char var_1_19 = 50; [L38] signed char var_1_20 = 0; [L39] signed char var_1_21 = -10; [L40] signed char var_1_23 = 16; [L41] signed char var_1_24 = 5; [L42] unsigned char var_1_25 = 0; [L43] unsigned long int var_1_26 = 3144733050; [L44] unsigned long int var_1_27 = 3793327297; [L45] unsigned char var_1_28 = 25; [L46] unsigned char var_1_29 = 128; [L47] double var_1_30 = 0.4; [L48] double var_1_31 = 999.8; [L49] double var_1_32 = 15.75; [L50] unsigned long int var_1_33 = 5; [L51] unsigned long int var_1_34 = 2432502595; [L52] unsigned char var_1_35 = 1; [L53] unsigned char var_1_37 = 0; [L54] signed short int var_1_38 = -4; [L55] signed char last_1_var_1_21 = -10; [L56] unsigned char last_1_var_1_25 = 0; [L57] unsigned char last_1_var_1_28 = 25; [L207] isInitial = 1 [L208] FCALL initially() [L209] int k_loop; [L210] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_10=255/2, var_1_11=200000000000001/2, var_1_12=129/2, var_1_13=16, var_1_14=-128, var_1_15=8, var_1_16=0, var_1_17=100, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=63223, var_1_4=63229, var_1_6=1/2, var_1_8=46/5, var_1_9=7/8] [L210] COND TRUE k_loop < 1 [L211] CALL updateLastVariables() [L198] last_1_var_1_21 = var_1_21 [L199] last_1_var_1_25 = var_1_25 [L200] last_1_var_1_28 = var_1_28 [L211] RET updateLastVariables() [L212] CALL updateVariables() [L143] var_1_3 = __VERIFIER_nondet_ushort() [L144] CALL assume_abort_if_not(var_1_3 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_10=255/2, var_1_11=200000000000001/2, var_1_12=129/2, var_1_13=16, var_1_14=-128, var_1_15=8, var_1_16=0, var_1_17=100, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=63229, var_1_6=1/2, var_1_8=46/5, var_1_9=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_10=255/2, var_1_11=200000000000001/2, var_1_12=129/2, var_1_13=16, var_1_14=-128, var_1_15=8, var_1_16=0, var_1_17=100, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=63229, var_1_6=1/2, var_1_8=46/5, var_1_9=7/8] [L144] RET assume_abort_if_not(var_1_3 >= 32767) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_10=255/2, var_1_11=200000000000001/2, var_1_12=129/2, var_1_13=16, var_1_14=-128, var_1_15=8, var_1_16=0, var_1_17=100, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=63229, var_1_6=1/2, var_1_8=46/5, var_1_9=7/8] [L145] CALL assume_abort_if_not(var_1_3 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_10=255/2, var_1_11=200000000000001/2, var_1_12=129/2, var_1_13=16, var_1_14=-128, var_1_15=8, var_1_16=0, var_1_17=100, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=63229, var_1_6=1/2, var_1_8=46/5, var_1_9=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_10=255/2, var_1_11=200000000000001/2, var_1_12=129/2, var_1_13=16, var_1_14=-128, var_1_15=8, var_1_16=0, var_1_17=100, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=63229, var_1_6=1/2, var_1_8=46/5, var_1_9=7/8] [L145] RET assume_abort_if_not(var_1_3 <= 65534) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_10=255/2, var_1_11=200000000000001/2, var_1_12=129/2, var_1_13=16, var_1_14=-128, var_1_15=8, var_1_16=0, var_1_17=100, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=63229, var_1_6=1/2, var_1_8=46/5, var_1_9=7/8] [L146] var_1_4 = __VERIFIER_nondet_ushort() [L147] CALL assume_abort_if_not(var_1_4 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_10=255/2, var_1_11=200000000000001/2, var_1_12=129/2, var_1_13=16, var_1_14=-128, var_1_15=8, var_1_16=0, var_1_17=100, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2, var_1_8=46/5, var_1_9=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_10=255/2, var_1_11=200000000000001/2, var_1_12=129/2, var_1_13=16, var_1_14=-128, var_1_15=8, var_1_16=0, var_1_17=100, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2, var_1_8=46/5, var_1_9=7/8] [L147] RET assume_abort_if_not(var_1_4 >= 32767) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_10=255/2, var_1_11=200000000000001/2, var_1_12=129/2, var_1_13=16, var_1_14=-128, var_1_15=8, var_1_16=0, var_1_17=100, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2, var_1_8=46/5, var_1_9=7/8] [L148] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_10=255/2, var_1_11=200000000000001/2, var_1_12=129/2, var_1_13=16, var_1_14=-128, var_1_15=8, var_1_16=0, var_1_17=100, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2, var_1_8=46/5, var_1_9=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_10=255/2, var_1_11=200000000000001/2, var_1_12=129/2, var_1_13=16, var_1_14=-128, var_1_15=8, var_1_16=0, var_1_17=100, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2, var_1_8=46/5, var_1_9=7/8] [L148] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_10=255/2, var_1_11=200000000000001/2, var_1_12=129/2, var_1_13=16, var_1_14=-128, var_1_15=8, var_1_16=0, var_1_17=100, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2, var_1_8=46/5, var_1_9=7/8] [L149] var_1_8 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_10=255/2, var_1_11=200000000000001/2, var_1_12=129/2, var_1_13=16, var_1_14=-128, var_1_15=8, var_1_16=0, var_1_17=100, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2, var_1_9=7/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_10=255/2, var_1_11=200000000000001/2, var_1_12=129/2, var_1_13=16, var_1_14=-128, var_1_15=8, var_1_16=0, var_1_17=100, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2, var_1_9=7/8] [L150] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_10=255/2, var_1_11=200000000000001/2, var_1_12=129/2, var_1_13=16, var_1_14=-128, var_1_15=8, var_1_16=0, var_1_17=100, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2, var_1_9=7/8] [L151] var_1_9 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_10=255/2, var_1_11=200000000000001/2, var_1_12=129/2, var_1_13=16, var_1_14=-128, var_1_15=8, var_1_16=0, var_1_17=100, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_10=255/2, var_1_11=200000000000001/2, var_1_12=129/2, var_1_13=16, var_1_14=-128, var_1_15=8, var_1_16=0, var_1_17=100, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L152] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_10=255/2, var_1_11=200000000000001/2, var_1_12=129/2, var_1_13=16, var_1_14=-128, var_1_15=8, var_1_16=0, var_1_17=100, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L153] var_1_10 = __VERIFIER_nondet_double() [L154] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_11=200000000000001/2, var_1_12=129/2, var_1_13=16, var_1_14=-128, var_1_15=8, var_1_16=0, var_1_17=100, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_11=200000000000001/2, var_1_12=129/2, var_1_13=16, var_1_14=-128, var_1_15=8, var_1_16=0, var_1_17=100, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L154] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_11=200000000000001/2, var_1_12=129/2, var_1_13=16, var_1_14=-128, var_1_15=8, var_1_16=0, var_1_17=100, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L155] var_1_11 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_11 >= -230584.3009213691390e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 2305843.009213691390e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_12=129/2, var_1_13=16, var_1_14=-128, var_1_15=8, var_1_16=0, var_1_17=100, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_12=129/2, var_1_13=16, var_1_14=-128, var_1_15=8, var_1_16=0, var_1_17=100, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L156] RET assume_abort_if_not((var_1_11 >= -230584.3009213691390e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 2305843.009213691390e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_12=129/2, var_1_13=16, var_1_14=-128, var_1_15=8, var_1_16=0, var_1_17=100, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L157] var_1_12 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_12 >= -230584.3009213691390e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 2305843.009213691390e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=8, var_1_16=0, var_1_17=100, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=8, var_1_16=0, var_1_17=100, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L158] RET assume_abort_if_not((var_1_12 >= -230584.3009213691390e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 2305843.009213691390e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=8, var_1_16=0, var_1_17=100, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L159] var_1_15 = __VERIFIER_nondet_char() [L160] CALL assume_abort_if_not(var_1_15 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=0, var_1_17=100, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=0, var_1_17=100, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L160] RET assume_abort_if_not(var_1_15 >= -1) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=0, var_1_17=100, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L161] CALL assume_abort_if_not(var_1_15 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=0, var_1_17=100, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=0, var_1_17=100, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L161] RET assume_abort_if_not(var_1_15 <= 126) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=0, var_1_17=100, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L162] var_1_16 = __VERIFIER_nondet_char() [L163] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=100, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=100, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L163] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=100, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L164] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=100, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=100, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L164] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=100, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L165] var_1_17 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_17 >= 62) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L166] RET assume_abort_if_not(var_1_17 >= 62) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L167] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L167] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=16, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L168] var_1_18 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L169] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L170] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L170] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=50, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L171] var_1_19 = __VERIFIER_nondet_char() [L172] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L172] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L173] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L173] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L174] var_1_20 = __VERIFIER_nondet_char() [L175] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L175] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L176] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L176] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=16, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L177] var_1_23 = __VERIFIER_nondet_char() [L178] CALL assume_abort_if_not(var_1_23 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L178] RET assume_abort_if_not(var_1_23 >= -127) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L179] CALL assume_abort_if_not(var_1_23 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L179] RET assume_abort_if_not(var_1_23 <= 126) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=3144733050, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L180] var_1_26 = __VERIFIER_nondet_ulong() [L181] CALL assume_abort_if_not(var_1_26 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=2147483647, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=2147483647, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L181] RET assume_abort_if_not(var_1_26 >= 2147483647) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=2147483647, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L182] CALL assume_abort_if_not(var_1_26 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=2147483647, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=2147483647, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L182] RET assume_abort_if_not(var_1_26 <= 4294967295) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=2147483647, var_1_27=3793327297, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L183] var_1_27 = __VERIFIER_nondet_ulong() [L184] CALL assume_abort_if_not(var_1_27 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L184] RET assume_abort_if_not(var_1_27 >= 2147483647) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L185] CALL assume_abort_if_not(var_1_27 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L185] RET assume_abort_if_not(var_1_27 <= 4294967295) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_31=4999/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L186] var_1_31 = __VERIFIER_nondet_double() [L187] CALL assume_abort_if_not((var_1_31 >= 0.0F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 4611686.018427382800e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L187] RET assume_abort_if_not((var_1_31 >= 0.0F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 4611686.018427382800e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_32=63/4, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L188] var_1_32 = __VERIFIER_nondet_double() [L189] CALL assume_abort_if_not((var_1_32 >= 0.0F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854765600e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L189] RET assume_abort_if_not((var_1_32 >= 0.0F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854765600e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_33=5, var_1_34=2432502595, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L190] var_1_34 = __VERIFIER_nondet_ulong() [L191] CALL assume_abort_if_not(var_1_34 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_33=5, var_1_34=-32639, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_33=5, var_1_34=-32639, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L191] RET assume_abort_if_not(var_1_34 >= 2147483647) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_33=5, var_1_34=-32639, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L192] CALL assume_abort_if_not(var_1_34 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_33=5, var_1_34=-32639, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_33=5, var_1_34=-32639, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L192] RET assume_abort_if_not(var_1_34 <= 4294967294) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_33=5, var_1_34=-32639, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L193] var_1_37 = __VERIFIER_nondet_uchar() [L194] CALL assume_abort_if_not(var_1_37 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_33=5, var_1_34=-32639, var_1_35=1, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_33=5, var_1_34=-32639, var_1_35=1, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L194] RET assume_abort_if_not(var_1_37 >= 0) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_33=5, var_1_34=-32639, var_1_35=1, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L195] CALL assume_abort_if_not(var_1_37 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_33=5, var_1_34=-32639, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_33=5, var_1_34=-32639, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L195] RET assume_abort_if_not(var_1_37 <= 0) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=100, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_33=5, var_1_34=-32639, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L212] RET updateVariables() [L213] CALL step() [L61] COND TRUE ! last_1_var_1_25 [L62] var_1_1 = (((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))) - (5 + last_1_var_1_28)) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=16, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=32738, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_33=5, var_1_34=-32639, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L66] COND TRUE var_1_10 < (var_1_12 * var_1_9) [L67] var_1_13 = var_1_3 VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=32767, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=32738, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=25, var_1_29=128, var_1_30=2/5, var_1_33=5, var_1_34=-32639, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L71] var_1_30 = (((((var_1_10) > ((var_1_9 + var_1_31))) ? (var_1_10) : ((var_1_9 + var_1_31)))) - var_1_32) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=32767, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=32738, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=25, var_1_29=128, var_1_33=5, var_1_34=-32639, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L72] COND TRUE var_1_12 == (var_1_10 - ((((var_1_9) < (var_1_32)) ? (var_1_9) : (var_1_32)))) [L73] var_1_33 = (var_1_34 - 128u) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=32767, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=32738, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=25, var_1_29=128, var_1_33=-32767, var_1_34=-32639, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L75] var_1_35 = ((var_1_30 < var_1_8) || (! var_1_37)) [L76] signed long int stepLocal_0 = - (- var_1_3); VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, stepLocal_0=32767, var_1_13=32767, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=32738, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=25, var_1_29=128, var_1_33=-32767, var_1_34=-32639, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L77] COND TRUE var_1_33 >= stepLocal_0 VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=32767, var_1_14=-128, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=32738, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=25, var_1_29=128, var_1_33=-32767, var_1_34=-32639, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L78] COND TRUE \read(var_1_35) [L79] var_1_14 = (var_1_15 - var_1_16) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=32767, var_1_14=0, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=32738, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=25, var_1_29=128, var_1_33=-32767, var_1_34=-32639, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L86] unsigned short int stepLocal_3 = var_1_3; [L87] unsigned short int stepLocal_2 = var_1_3; VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, stepLocal_2=32767, stepLocal_3=32767, var_1_13=32767, var_1_14=0, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=32738, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=25, var_1_29=128, var_1_33=-32767, var_1_34=-32639, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L88] COND FALSE !((((((var_1_26) > (var_1_27)) ? (var_1_26) : (var_1_27))) - var_1_4) <= stepLocal_2) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, stepLocal_3=32767, var_1_13=32767, var_1_14=0, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=32738, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=5, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=25, var_1_29=128, var_1_33=-32767, var_1_34=-32639, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L95] COND FALSE !(\read(var_1_25)) [L98] var_1_24 = var_1_17 VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, stepLocal_3=32767, var_1_13=32767, var_1_14=0, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=32738, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=62, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=25, var_1_29=128, var_1_33=-32767, var_1_34=-32639, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L100] unsigned short int stepLocal_4 = var_1_1; VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, stepLocal_3=32767, stepLocal_4=32738, var_1_13=32767, var_1_14=0, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=32738, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=62, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=25, var_1_29=128, var_1_33=-32767, var_1_34=-32639, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L101] COND FALSE !(stepLocal_4 >= ((((var_1_33) < ((- var_1_3))) ? (var_1_33) : ((- var_1_3))))) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, stepLocal_3=32767, var_1_13=32767, var_1_14=0, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=32738, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=62, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=25, var_1_29=128, var_1_33=-32767, var_1_34=-32639, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L106] COND FALSE !(var_1_4 <= var_1_29) [L115] var_1_28 = var_1_20 VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, stepLocal_3=32767, var_1_13=32767, var_1_14=0, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=32738, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=62, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=0, var_1_29=128, var_1_33=-32767, var_1_34=-32639, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L117] COND FALSE !(\read(var_1_25)) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, stepLocal_3=32767, var_1_13=32767, var_1_14=0, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=32738, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=62, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=0, var_1_29=128, var_1_33=-32767, var_1_34=-32639, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L124] unsigned char stepLocal_1 = var_1_28 <= var_1_4; VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, stepLocal_1=1, stepLocal_3=32767, var_1_13=32767, var_1_14=0, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=32738, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=62, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=0, var_1_29=128, var_1_33=-32767, var_1_34=-32639, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L125] COND FALSE !(var_1_9 <= var_1_30) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, stepLocal_1=1, stepLocal_3=32767, var_1_13=32767, var_1_14=0, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=32738, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=62, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=0, var_1_29=128, var_1_33=-32767, var_1_34=-32639, var_1_35=1, var_1_37=0, var_1_38=-4, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L132] COND FALSE !((var_1_18 - var_1_19) < ((var_1_17 / var_1_3) * var_1_33)) [L139] var_1_38 = var_1_21 VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, stepLocal_1=1, stepLocal_3=32767, var_1_13=32767, var_1_14=0, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=32738, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=62, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=0, var_1_29=128, var_1_33=-32767, var_1_34=-32639, var_1_35=1, var_1_37=0, var_1_38=-10, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L213] RET step() [L214] CALL, EXPR property() [L203] EXPR ((((((((! last_1_var_1_25) ? (var_1_1 == ((unsigned short int) (((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))) - (5 + last_1_var_1_28)))) : (var_1_1 == ((unsigned short int) var_1_3))) && (var_1_25 ? (((var_1_28 + var_1_3) >= var_1_29) ? (var_1_6 == ((double) (var_1_8 + (var_1_9 - var_1_10)))) : (var_1_6 == ((double) ((var_1_11 + ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))) + (8.25 - var_1_9))))) : 1)) && ((var_1_10 < (var_1_12 * var_1_9)) ? (var_1_13 == ((unsigned long int) var_1_3)) : (var_1_13 == ((unsigned long int) ((((var_1_3) > (16u)) ? (var_1_3) : (16u))))))) && ((var_1_33 >= (- (- var_1_3))) ? (var_1_35 ? (var_1_14 == ((signed char) (var_1_15 - var_1_16))) : (var_1_14 == ((signed char) ((var_1_17 - var_1_18) - (var_1_19 + var_1_20))))) : (var_1_14 == ((signed char) (((((var_1_19 - 64)) < (var_1_15)) ? ((var_1_19 - 64)) : (var_1_15))))))) && ((var_1_9 <= var_1_30) ? (((var_1_28 <= var_1_4) && (! (var_1_18 == last_1_var_1_21))) ? (var_1_21 == ((signed char) var_1_15)) : (var_1_21 == ((signed char) var_1_23))) : 1)) && (var_1_25 ? (var_1_24 == ((signed char) (var_1_20 + var_1_18))) : (var_1_24 == ((signed char) var_1_17)))) && (((((((var_1_26) > (var_1_27)) ? (var_1_26) : (var_1_27))) - var_1_4) <= var_1_3) ? (((- var_1_16) == var_1_3) ? (var_1_35 ? (var_1_25 == ((unsigned char) 0)) : 1) : 1) : 1)) && ((var_1_4 <= var_1_29) ? ((var_1_26 == (var_1_16 * (var_1_27 & var_1_19))) ? (var_1_25 ? (var_1_28 == ((unsigned char) var_1_20)) : (var_1_28 == ((unsigned char) var_1_19))) : 1) : (var_1_28 == ((unsigned char) var_1_20))) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=32767, var_1_14=0, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=32738, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=62, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=0, var_1_29=128, var_1_33=-32767, var_1_34=-32639, var_1_35=1, var_1_37=0, var_1_38=-10, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L203-L204] return (((((((((((((! last_1_var_1_25) ? (var_1_1 == ((unsigned short int) (((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))) - (5 + last_1_var_1_28)))) : (var_1_1 == ((unsigned short int) var_1_3))) && (var_1_25 ? (((var_1_28 + var_1_3) >= var_1_29) ? (var_1_6 == ((double) (var_1_8 + (var_1_9 - var_1_10)))) : (var_1_6 == ((double) ((var_1_11 + ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))) + (8.25 - var_1_9))))) : 1)) && ((var_1_10 < (var_1_12 * var_1_9)) ? (var_1_13 == ((unsigned long int) var_1_3)) : (var_1_13 == ((unsigned long int) ((((var_1_3) > (16u)) ? (var_1_3) : (16u))))))) && ((var_1_33 >= (- (- var_1_3))) ? (var_1_35 ? (var_1_14 == ((signed char) (var_1_15 - var_1_16))) : (var_1_14 == ((signed char) ((var_1_17 - var_1_18) - (var_1_19 + var_1_20))))) : (var_1_14 == ((signed char) (((((var_1_19 - 64)) < (var_1_15)) ? ((var_1_19 - 64)) : (var_1_15))))))) && ((var_1_9 <= var_1_30) ? (((var_1_28 <= var_1_4) && (! (var_1_18 == last_1_var_1_21))) ? (var_1_21 == ((signed char) var_1_15)) : (var_1_21 == ((signed char) var_1_23))) : 1)) && (var_1_25 ? (var_1_24 == ((signed char) (var_1_20 + var_1_18))) : (var_1_24 == ((signed char) var_1_17)))) && (((((((var_1_26) > (var_1_27)) ? (var_1_26) : (var_1_27))) - var_1_4) <= var_1_3) ? (((- var_1_16) == var_1_3) ? (var_1_35 ? (var_1_25 == ((unsigned char) 0)) : 1) : 1) : 1)) && ((var_1_4 <= var_1_29) ? ((var_1_26 == (var_1_16 * (var_1_27 & var_1_19))) ? (var_1_25 ? (var_1_28 == ((unsigned char) var_1_20)) : (var_1_28 == ((unsigned char) var_1_19))) : 1) : (var_1_28 == ((unsigned char) var_1_20)))) && ((var_1_1 >= ((((var_1_33) < ((- var_1_3))) ? (var_1_33) : ((- var_1_3))))) ? (var_1_25 ? (var_1_29 == ((unsigned char) var_1_17)) : 1) : 1)) && (var_1_30 == ((double) (((((var_1_10) > ((var_1_9 + var_1_31))) ? (var_1_10) : ((var_1_9 + var_1_31)))) - var_1_32)))) && ((var_1_12 == (var_1_10 - ((((var_1_9) < (var_1_32)) ? (var_1_9) : (var_1_32))))) ? (var_1_33 == ((unsigned long int) (var_1_34 - 128u))) : 1)) && (var_1_35 == ((unsigned char) ((var_1_30 < var_1_8) || (! var_1_37))))) && (((var_1_18 - var_1_19) < ((var_1_17 / var_1_3) * var_1_33)) ? ((var_1_32 >= (var_1_10 - var_1_31)) ? (var_1_38 == ((signed short int) var_1_18)) : (var_1_38 == ((signed short int) var_1_19))) : (var_1_38 == ((signed short int) var_1_21))) ; [L214] RET, EXPR property() [L214] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=32767, var_1_14=0, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=32738, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=62, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=0, var_1_29=128, var_1_33=-32767, var_1_34=-32639, var_1_35=1, var_1_37=0, var_1_38=-10, var_1_3=32767, var_1_4=32768, var_1_6=1/2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=-10, last_1_var_1_25=0, last_1_var_1_28=25, var_1_13=32767, var_1_14=0, var_1_15=126, var_1_16=126, var_1_17=62, var_1_18=63, var_1_19=63, var_1_1=32738, var_1_20=0, var_1_21=-10, var_1_23=-127, var_1_24=62, var_1_25=0, var_1_26=2147483647, var_1_27=8589934591, var_1_28=0, var_1_29=128, var_1_33=-32767, var_1_34=-32639, var_1_35=1, var_1_37=0, var_1_38=-10, var_1_3=32767, var_1_4=32768, var_1_6=1/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 102 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.4s, OverallIterations: 6, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2670 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2608 mSDsluCounter, 5456 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4474 mSDsCounter, 1062 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4332 IncrementalHoareTripleChecker+Invalid, 5394 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1062 mSolverCounterUnsat, 982 mSDtfsCounter, 4332 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 887 GetRequests, 765 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2996 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=526occurred in iteration=5, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 5 MinimizatonAttempts, 781 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 11.4s InterpolantComputationTime, 1667 NumberOfCodeBlocks, 1667 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1450 ConstructedInterpolants, 0 QuantifiedInterpolants, 12566 SizeOfPredicates, 6 NumberOfNonLiveVariables, 478 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 14430/14784 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 11:10:44,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-78.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 389c0a502a3185807f3b8690c73a08390109bda5b59f3ae6d40c34b48d123843 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:10:47,151 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:10:47,238 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 11:10:47,244 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:10:47,245 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:10:47,277 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:10:47,279 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:10:47,280 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:10:47,280 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:10:47,280 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:10:47,281 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:10:47,281 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:10:47,282 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:10:47,282 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:10:47,282 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:10:47,282 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:10:47,283 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:10:47,286 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:10:47,286 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:10:47,286 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:10:47,287 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:10:47,288 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:10:47,289 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:10:47,289 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 11:10:47,289 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 11:10:47,289 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:10:47,290 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 11:10:47,290 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:10:47,290 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:10:47,291 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:10:47,291 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:10:47,291 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:10:47,291 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:10:47,292 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:10:47,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:10:47,292 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:10:47,292 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:10:47,293 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:10:47,293 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 11:10:47,293 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 11:10:47,294 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:10:47,294 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:10:47,294 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:10:47,294 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:10:47,295 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 11:10:47,295 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 -> 389c0a502a3185807f3b8690c73a08390109bda5b59f3ae6d40c34b48d123843 [2024-10-11 11:10:47,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:10:47,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:10:47,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:10:47,661 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:10:47,662 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:10:47,664 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-78.i [2024-10-11 11:10:49,215 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:10:49,473 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:10:49,476 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-78.i [2024-10-11 11:10:49,489 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3d69d2295/6cf29a9c25144858be353cdfefa8a00a/FLAG3eac3af5d [2024-10-11 11:10:49,506 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3d69d2295/6cf29a9c25144858be353cdfefa8a00a [2024-10-11 11:10:49,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:10:49,511 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:10:49,513 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:10:49,514 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:10:49,520 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:10:49,521 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:10:49" (1/1) ... [2024-10-11 11:10:49,524 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d3ea1f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:49, skipping insertion in model container [2024-10-11 11:10:49,524 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:10:49" (1/1) ... [2024-10-11 11:10:49,562 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:10:49,761 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-78.i[916,929] [2024-10-11 11:10:49,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:10:49,901 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:10:49,917 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-78.i[916,929] [2024-10-11 11:10:49,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:10:49,997 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:10:49,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:49 WrapperNode [2024-10-11 11:10:49,998 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:10:50,000 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:10:50,000 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:10:50,000 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:10:50,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:49" (1/1) ... [2024-10-11 11:10:50,030 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:49" (1/1) ... [2024-10-11 11:10:50,078 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 220 [2024-10-11 11:10:50,079 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:10:50,080 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:10:50,084 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:10:50,084 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:10:50,095 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:49" (1/1) ... [2024-10-11 11:10:50,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:49" (1/1) ... [2024-10-11 11:10:50,107 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:49" (1/1) ... [2024-10-11 11:10:50,135 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:10:50,136 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:49" (1/1) ... [2024-10-11 11:10:50,136 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:49" (1/1) ... [2024-10-11 11:10:50,154 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:49" (1/1) ... [2024-10-11 11:10:50,163 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:49" (1/1) ... [2024-10-11 11:10:50,166 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:49" (1/1) ... [2024-10-11 11:10:50,169 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:49" (1/1) ... [2024-10-11 11:10:50,173 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:10:50,175 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:10:50,175 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:10:50,175 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:10:50,176 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:49" (1/1) ... [2024-10-11 11:10:50,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:10:50,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:10:50,219 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:10:50,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:10:50,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:10:50,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 11:10:50,266 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:10:50,268 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:10:50,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:10:50,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:10:50,395 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:10:50,398 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:11:04,504 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-10-11 11:11:04,505 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:11:04,564 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:11:04,564 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:11:04,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:11:04 BoogieIcfgContainer [2024-10-11 11:11:04,565 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:11:04,567 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:11:04,567 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:11:04,571 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:11:04,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:10:49" (1/3) ... [2024-10-11 11:11:04,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@520c8a35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:11:04, skipping insertion in model container [2024-10-11 11:11:04,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:49" (2/3) ... [2024-10-11 11:11:04,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@520c8a35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:11:04, skipping insertion in model container [2024-10-11 11:11:04,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:11:04" (3/3) ... [2024-10-11 11:11:04,573 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-78.i [2024-10-11 11:11:04,589 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:11:04,589 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:11:04,645 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:11:04,650 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;@4ceb2957, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:11:04,651 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:11:04,655 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-11 11:11:04,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-11 11:11:04,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:11:04,670 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:11:04,671 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:11:04,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:11:04,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1707922830, now seen corresponding path program 1 times [2024-10-11 11:11:04,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:11:04,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [800725459] [2024-10-11 11:11:04,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:11:04,687 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:11:04,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:11:04,689 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:11:04,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 11:11:05,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:05,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 11:11:05,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:11:05,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 832 proven. 0 refuted. 0 times theorem prover too weak. 1280 trivial. 0 not checked. [2024-10-11 11:11:05,681 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:11:05,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:11:05,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [800725459] [2024-10-11 11:11:05,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [800725459] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:11:05,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:11:05,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:11:05,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407620823] [2024-10-11 11:11:05,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:11:05,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:11:05,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:11:05,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:11:05,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:11:05,728 INFO L87 Difference]: Start difference. First operand has 91 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) 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, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-11 11:11:10,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:11:10,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:11:10,178 INFO L93 Difference]: Finished difference Result 181 states and 324 transitions. [2024-10-11 11:11:10,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:11:10,181 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, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 206 [2024-10-11 11:11:10,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:11:10,188 INFO L225 Difference]: With dead ends: 181 [2024-10-11 11:11:10,188 INFO L226 Difference]: Without dead ends: 89 [2024-10-11 11:11:10,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:11:10,195 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-11 11:11:10,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2024-10-11 11:11:10,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-11 11:11:10,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-11 11:11:10,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 54 states have internal predecessors, (75), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-11 11:11:10,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 141 transitions. [2024-10-11 11:11:10,245 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 141 transitions. Word has length 206 [2024-10-11 11:11:10,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:11:10,246 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 141 transitions. [2024-10-11 11:11:10,246 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, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-11 11:11:10,246 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 141 transitions. [2024-10-11 11:11:10,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-11 11:11:10,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:11:10,251 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:11:10,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 11:11:10,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:11:10,452 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:11:10,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:11:10,453 INFO L85 PathProgramCache]: Analyzing trace with hash 163057672, now seen corresponding path program 1 times [2024-10-11 11:11:10,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:11:10,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1001459243] [2024-10-11 11:11:10,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:11:10,455 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:11:10,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:11:10,458 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:11:10,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 11:11:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:11,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 11:11:11,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:11:12,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 438 proven. 9 refuted. 0 times theorem prover too weak. 1665 trivial. 0 not checked. [2024-10-11 11:11:12,883 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:11:13,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:11:13,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1001459243] [2024-10-11 11:11:13,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1001459243] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:11:13,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1501458757] [2024-10-11 11:11:13,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:11:13,814 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 11:11:13,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 11:11:13,818 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 11:11:13,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-11 11:11:14,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:14,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 11:11:14,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:11:14,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-11 11:11:14,854 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:11:14,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1501458757] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:11:14,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 11:11:14,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-10-11 11:11:14,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529665336] [2024-10-11 11:11:14,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:11:14,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:11:14,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:11:14,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:11:14,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-11 11:11:14,863 INFO L87 Difference]: Start difference. First operand 89 states and 141 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 11:11:19,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:11:23,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:11:27,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:11:27,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:11:27,528 INFO L93 Difference]: Finished difference Result 264 states and 419 transitions. [2024-10-11 11:11:27,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:11:27,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 206 [2024-10-11 11:11:27,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:11:27,534 INFO L225 Difference]: With dead ends: 264 [2024-10-11 11:11:27,534 INFO L226 Difference]: Without dead ends: 176 [2024-10-11 11:11:27,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-11 11:11:27,538 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 131 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2024-10-11 11:11:27,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 380 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 3 Unknown, 0 Unchecked, 12.6s Time] [2024-10-11 11:11:27,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-10-11 11:11:27,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2024-10-11 11:11:27,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 105 states have (on average 1.3523809523809525) internal successors, (142), 105 states have internal predecessors, (142), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-11 11:11:27,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 274 transitions. [2024-10-11 11:11:27,593 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 274 transitions. Word has length 206 [2024-10-11 11:11:27,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:11:27,594 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 274 transitions. [2024-10-11 11:11:27,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-11 11:11:27,594 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 274 transitions. [2024-10-11 11:11:27,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-11 11:11:27,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:11:27,604 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:11:27,638 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 11:11:27,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-10-11 11:11:28,004 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,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 11:11:28,005 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:11:28,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:11:28,006 INFO L85 PathProgramCache]: Analyzing trace with hash 864122250, now seen corresponding path program 1 times [2024-10-11 11:11:28,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:11:28,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [779120490] [2024-10-11 11:11:28,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:11:28,007 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:11:28,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:11:28,011 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 11:11:28,012 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 11:11:28,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:28,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 11:11:28,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:11:30,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 438 proven. 9 refuted. 0 times theorem prover too weak. 1665 trivial. 0 not checked. [2024-10-11 11:11:30,101 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:11:30,953 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:11:30,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [779120490] [2024-10-11 11:11:30,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [779120490] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:11:30,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1561094390] [2024-10-11 11:11:30,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:11:30,954 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 11:11:30,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 11:11:30,957 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 11:11:30,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-11 11:11:32,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:32,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 11:11:32,710 INFO L278 TraceCheckSpWp]: Computing forward predicates...