./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-96.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-96.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 3090961677c94988a83046f2eaa2a3ede8184fc6a7310dc94aff0923cdf09d53 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:49:27,939 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:49:28,019 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 13:49:28,022 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:49:28,026 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:49:28,050 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:49:28,051 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:49:28,051 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:49:28,052 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:49:28,052 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:49:28,053 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:49:28,053 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:49:28,053 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:49:28,053 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:49:28,054 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:49:28,054 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:49:28,054 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:49:28,054 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:49:28,054 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:49:28,054 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:49:28,054 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:49:28,054 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:49:28,055 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:49:28,055 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:49:28,055 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:49:28,055 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:49:28,055 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:49:28,055 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:49:28,055 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:49:28,055 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:49:28,056 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:49:28,056 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:49:28,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:49:28,056 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:49:28,056 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:49:28,056 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:49:28,056 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:49:28,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:49:28,056 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:49:28,056 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:49:28,056 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:49:28,056 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:49:28,057 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:49:28,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:49:28,057 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:49:28,057 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:49:28,057 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:49:28,057 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:49:28,057 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 3090961677c94988a83046f2eaa2a3ede8184fc6a7310dc94aff0923cdf09d53 [2025-01-09 13:49:28,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:49:28,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:49:28,281 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:49:28,282 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:49:28,282 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:49:28,283 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-96.i [2025-01-09 13:49:29,614 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/067023262/42735add35d141b2ba2a6fa858c4b12f/FLAG56e295f2e [2025-01-09 13:49:29,902 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:49:29,903 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-96.i [2025-01-09 13:49:29,910 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/067023262/42735add35d141b2ba2a6fa858c4b12f/FLAG56e295f2e [2025-01-09 13:49:30,199 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/067023262/42735add35d141b2ba2a6fa858c4b12f [2025-01-09 13:49:30,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:49:30,203 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:49:30,204 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:49:30,204 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:49:30,208 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:49:30,209 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:49:30" (1/1) ... [2025-01-09 13:49:30,210 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@283cf62a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:30, skipping insertion in model container [2025-01-09 13:49:30,210 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:49:30" (1/1) ... [2025-01-09 13:49:30,225 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:49:30,317 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-96.i[915,928] [2025-01-09 13:49:30,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:49:30,388 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:49:30,399 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-96.i[915,928] [2025-01-09 13:49:30,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:49:30,458 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:49:30,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:30 WrapperNode [2025-01-09 13:49:30,461 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:49:30,462 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:49:30,462 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:49:30,463 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:49:30,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:30" (1/1) ... [2025-01-09 13:49:30,482 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:30" (1/1) ... [2025-01-09 13:49:30,528 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 162 [2025-01-09 13:49:30,530 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:49:30,530 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:49:30,531 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:49:30,531 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:49:30,540 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:30" (1/1) ... [2025-01-09 13:49:30,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:30" (1/1) ... [2025-01-09 13:49:30,545 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:30" (1/1) ... [2025-01-09 13:49:30,564 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]. [2025-01-09 13:49:30,565 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:30" (1/1) ... [2025-01-09 13:49:30,565 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:30" (1/1) ... [2025-01-09 13:49:30,571 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:30" (1/1) ... [2025-01-09 13:49:30,572 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:30" (1/1) ... [2025-01-09 13:49:30,575 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:30" (1/1) ... [2025-01-09 13:49:30,576 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:30" (1/1) ... [2025-01-09 13:49:30,577 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:30" (1/1) ... [2025-01-09 13:49:30,579 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:49:30,580 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:49:30,580 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:49:30,580 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:49:30,581 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:30" (1/1) ... [2025-01-09 13:49:30,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:49:30,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:49:30,617 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 13:49:30,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 13:49:30,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:49:30,647 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:49:30,647 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:49:30,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:49:30,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:49:30,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:49:30,725 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:49:30,727 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:49:30,953 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-01-09 13:49:30,953 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:49:30,966 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:49:30,968 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:49:30,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:49:30 BoogieIcfgContainer [2025-01-09 13:49:30,968 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:49:30,971 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:49:30,971 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:49:30,975 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:49:30,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:49:30" (1/3) ... [2025-01-09 13:49:30,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@108e8e2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:49:30, skipping insertion in model container [2025-01-09 13:49:30,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:30" (2/3) ... [2025-01-09 13:49:30,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@108e8e2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:49:30, skipping insertion in model container [2025-01-09 13:49:30,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:49:30" (3/3) ... [2025-01-09 13:49:30,979 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-96.i [2025-01-09 13:49:30,993 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:49:30,994 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-96.i that has 2 procedures, 72 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:49:31,046 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:49:31,057 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;@25e92a29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:49:31,057 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:49:31,062 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 43 states have internal predecessors, (55), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 13:49:31,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 13:49:31,073 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:49:31,074 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:49:31,074 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:49:31,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:49:31,080 INFO L85 PathProgramCache]: Analyzing trace with hash 291962211, now seen corresponding path program 1 times [2025-01-09 13:49:31,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:49:31,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338720676] [2025-01-09 13:49:31,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:49:31,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:49:31,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 13:49:31,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 13:49:31,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:49:31,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:49:31,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-01-09 13:49:31,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:49:31,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338720676] [2025-01-09 13:49:31,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338720676] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:49:31,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639135441] [2025-01-09 13:49:31,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:49:31,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:49:31,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:49:31,373 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 13:49:31,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 13:49:31,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 13:49:31,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 13:49:31,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:49:31,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:49:31,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:49:31,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:49:31,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-01-09 13:49:31,614 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:49:31,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639135441] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:49:31,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:49:31,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:49:31,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486799494] [2025-01-09 13:49:31,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:49:31,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:49:31,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:49:31,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:49:31,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:49:31,638 INFO L87 Difference]: Start difference. First operand has 72 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 43 states have internal predecessors, (55), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 13:49:31,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:49:31,666 INFO L93 Difference]: Finished difference Result 138 states and 236 transitions. [2025-01-09 13:49:31,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:49:31,670 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 167 [2025-01-09 13:49:31,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:49:31,678 INFO L225 Difference]: With dead ends: 138 [2025-01-09 13:49:31,678 INFO L226 Difference]: Without dead ends: 66 [2025-01-09 13:49:31,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:49:31,683 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:49:31,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:49:31,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-01-09 13:49:31,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-01-09 13:49:31,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 13:49:31,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 97 transitions. [2025-01-09 13:49:31,711 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 97 transitions. Word has length 167 [2025-01-09 13:49:31,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:49:31,712 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 97 transitions. [2025-01-09 13:49:31,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 13:49:31,712 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 97 transitions. [2025-01-09 13:49:31,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 13:49:31,714 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:49:31,714 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:49:31,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 13:49:31,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 13:49:31,915 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:49:31,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:49:31,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1522275043, now seen corresponding path program 1 times [2025-01-09 13:49:31,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:49:31,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821703620] [2025-01-09 13:49:31,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:49:31,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:49:31,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 13:49:31,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 13:49:31,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:49:31,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:49:32,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 13:49:32,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:49:32,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821703620] [2025-01-09 13:49:32,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821703620] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:49:32,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:49:32,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:49:32,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45739541] [2025-01-09 13:49:32,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:49:32,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:49:32,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:49:32,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:49:32,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:49:32,322 INFO L87 Difference]: Start difference. First operand 66 states and 97 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 13:49:32,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:49:32,560 INFO L93 Difference]: Finished difference Result 193 states and 286 transitions. [2025-01-09 13:49:32,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:49:32,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 167 [2025-01-09 13:49:32,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:49:32,563 INFO L225 Difference]: With dead ends: 193 [2025-01-09 13:49:32,563 INFO L226 Difference]: Without dead ends: 130 [2025-01-09 13:49:32,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:49:32,567 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 52 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:49:32,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 271 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:49:32,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-01-09 13:49:32,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 115. [2025-01-09 13:49:32,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 58 states have (on average 1.103448275862069) internal successors, (64), 58 states have internal predecessors, (64), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 13:49:32,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2025-01-09 13:49:32,605 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 167 [2025-01-09 13:49:32,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:49:32,607 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2025-01-09 13:49:32,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 13:49:32,608 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2025-01-09 13:49:32,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 13:49:32,612 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:49:32,613 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:49:32,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 13:49:32,613 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:49:32,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:49:32,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1264109605, now seen corresponding path program 1 times [2025-01-09 13:49:32,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:49:32,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298521216] [2025-01-09 13:49:32,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:49:32,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:49:32,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 13:49:32,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 13:49:32,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:49:32,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:49:33,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 84 proven. 66 refuted. 0 times theorem prover too weak. 1254 trivial. 0 not checked. [2025-01-09 13:49:33,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:49:33,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298521216] [2025-01-09 13:49:33,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298521216] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:49:33,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283905552] [2025-01-09 13:49:33,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:49:33,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:49:33,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:49:33,359 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 13:49:33,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 13:49:33,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 13:49:33,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 13:49:33,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:49:33,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:49:33,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 13:49:33,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:49:34,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 934 proven. 105 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-01-09 13:49:34,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:49:34,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 84 proven. 69 refuted. 0 times theorem prover too weak. 1251 trivial. 0 not checked. [2025-01-09 13:49:34,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283905552] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 13:49:34,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 13:49:34,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 9] total 26 [2025-01-09 13:49:34,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777459480] [2025-01-09 13:49:34,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 13:49:34,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 13:49:34,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:49:34,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 13:49:34,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2025-01-09 13:49:34,930 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand has 26 states, 26 states have (on average 4.538461538461538) internal successors, (118), 25 states have internal predecessors, (118), 10 states have call successors, (81), 5 states have call predecessors, (81), 10 states have return successors, (81), 10 states have call predecessors, (81), 10 states have call successors, (81) [2025-01-09 13:49:37,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:49:37,104 INFO L93 Difference]: Finished difference Result 531 states and 721 transitions. [2025-01-09 13:49:37,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-01-09 13:49:37,105 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.538461538461538) internal successors, (118), 25 states have internal predecessors, (118), 10 states have call successors, (81), 5 states have call predecessors, (81), 10 states have return successors, (81), 10 states have call predecessors, (81), 10 states have call successors, (81) Word has length 167 [2025-01-09 13:49:37,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:49:37,109 INFO L225 Difference]: With dead ends: 531 [2025-01-09 13:49:37,109 INFO L226 Difference]: Without dead ends: 468 [2025-01-09 13:49:37,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2389 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1635, Invalid=5505, Unknown=0, NotChecked=0, Total=7140 [2025-01-09 13:49:37,112 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 423 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 463 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 1492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 463 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:49:37,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 556 Invalid, 1492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [463 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 13:49:37,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-01-09 13:49:37,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 334. [2025-01-09 13:49:37,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 187 states have (on average 1.106951871657754) internal successors, (207), 191 states have internal predecessors, (207), 129 states have call successors, (129), 17 states have call predecessors, (129), 17 states have return successors, (129), 125 states have call predecessors, (129), 129 states have call successors, (129) [2025-01-09 13:49:37,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 465 transitions. [2025-01-09 13:49:37,174 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 465 transitions. Word has length 167 [2025-01-09 13:49:37,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:49:37,175 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 465 transitions. [2025-01-09 13:49:37,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.538461538461538) internal successors, (118), 25 states have internal predecessors, (118), 10 states have call successors, (81), 5 states have call predecessors, (81), 10 states have return successors, (81), 10 states have call predecessors, (81), 10 states have call successors, (81) [2025-01-09 13:49:37,175 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 465 transitions. [2025-01-09 13:49:37,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 13:49:37,176 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:49:37,176 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:49:37,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 13:49:37,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:49:37,377 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:49:37,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:49:37,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1262262563, now seen corresponding path program 1 times [2025-01-09 13:49:37,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:49:37,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492864652] [2025-01-09 13:49:37,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:49:37,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:49:37,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 13:49:37,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 13:49:37,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:49:37,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:49:37,444 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 13:49:37,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 13:49:37,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 13:49:37,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:49:37,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:49:37,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 13:49:37,591 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 13:49:37,592 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:49:37,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 13:49:37,595 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 13:49:37,686 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:49:37,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:49:37 BoogieIcfgContainer [2025-01-09 13:49:37,689 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:49:37,690 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:49:37,690 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:49:37,690 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:49:37,692 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:49:30" (3/4) ... [2025-01-09 13:49:37,693 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 13:49:37,694 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:49:37,695 INFO L158 Benchmark]: Toolchain (without parser) took 7491.47ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 103.8MB in the beginning and 251.1MB in the end (delta: -147.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2025-01-09 13:49:37,695 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:49:37,696 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.20ms. Allocated memory is still 142.6MB. Free memory was 103.0MB in the beginning and 89.0MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 13:49:37,696 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.43ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 86.0MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:49:37,697 INFO L158 Benchmark]: Boogie Preprocessor took 49.35ms. Allocated memory is still 142.6MB. Free memory was 86.0MB in the beginning and 81.2MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:49:37,697 INFO L158 Benchmark]: RCFGBuilder took 388.03ms. Allocated memory is still 142.6MB. Free memory was 81.2MB in the beginning and 61.6MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 13:49:37,697 INFO L158 Benchmark]: TraceAbstraction took 6718.71ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 60.8MB in the beginning and 254.3MB in the end (delta: -193.5MB). Peak memory consumption was 140.5MB. Max. memory is 16.1GB. [2025-01-09 13:49:37,697 INFO L158 Benchmark]: Witness Printer took 4.05ms. Allocated memory is still 310.4MB. Free memory was 251.2MB in the beginning and 251.1MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:49:37,698 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.22ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 257.20ms. Allocated memory is still 142.6MB. Free memory was 103.0MB in the beginning and 89.0MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.43ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 86.0MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.35ms. Allocated memory is still 142.6MB. Free memory was 86.0MB in the beginning and 81.2MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 388.03ms. Allocated memory is still 142.6MB. Free memory was 81.2MB in the beginning and 61.6MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6718.71ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 60.8MB in the beginning and 254.3MB in the end (delta: -193.5MB). Peak memory consumption was 140.5MB. Max. memory is 16.1GB. * Witness Printer took 4.05ms. Allocated memory is still 310.4MB. Free memory was 251.2MB in the beginning and 251.1MB in the end (delta: 92.4kB). 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 someBinaryFLOATComparisonOperation at line 135, overapproximation of someBinaryDOUBLEComparisonOperation at line 129, overapproximation of someBinaryDOUBLEComparisonOperation at line 125, overapproximation of someBinaryDOUBLEComparisonOperation at line 127, overapproximation of someBinaryDOUBLEComparisonOperation at line 135. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 16; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_6 = 1; [L25] signed char var_1_8 = -10; [L26] unsigned short int var_1_9 = 4; [L27] signed char var_1_10 = 8; [L28] unsigned short int var_1_12 = 64314; [L29] unsigned short int var_1_13 = 26169; [L30] signed char var_1_17 = 50; [L31] signed char var_1_18 = 16; [L32] signed char var_1_19 = 5; [L33] signed char var_1_20 = 0; [L34] signed char var_1_21 = 50; [L35] signed char var_1_22 = 16; [L36] unsigned char var_1_23 = 16; [L37] unsigned char var_1_24 = 1; [L38] unsigned char var_1_25 = 0; [L39] double var_1_27 = 0.25; [L40] double var_1_28 = 10.25; [L41] double var_1_29 = 1000.25; [L42] double var_1_30 = 9.5; [L43] float var_1_31 = 63.5; [L44] unsigned short int last_1_var_1_9 = 4; VAL [isInitial=0, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-10, var_1_9=4] [L139] isInitial = 1 [L140] FCALL initially() [L141] int k_loop; [L142] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-10, var_1_9=4] [L142] COND TRUE k_loop < 1 [L143] CALL updateLastVariables() [L132] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-10, var_1_9=4] [L143] RET updateLastVariables() [L144] CALL updateVariables() [L88] var_1_4 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_6=1, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_6=1, var_1_8=-10, var_1_9=4] [L89] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_6=1, var_1_8=-10, var_1_9=4] [L90] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-10, var_1_9=4] [L90] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-10, var_1_9=4] [L91] var_1_6 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_8=-10, var_1_9=4] [L92] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_8=-10, var_1_9=4] [L93] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-10, var_1_9=4] [L93] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-10, var_1_9=4] [L94] var_1_8 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L95] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L96] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L96] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L97] var_1_10 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L98] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L99] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L99] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L100] var_1_12 = __VERIFIER_nondet_ushort() [L101] CALL assume_abort_if_not(var_1_12 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L101] RET assume_abort_if_not(var_1_12 >= 49150) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L102] CALL assume_abort_if_not(var_1_12 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L102] RET assume_abort_if_not(var_1_12 <= 65534) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L103] var_1_13 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_13 >= 24575) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L104] RET assume_abort_if_not(var_1_13 >= 24575) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L105] CALL assume_abort_if_not(var_1_13 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L105] RET assume_abort_if_not(var_1_13 <= 32767) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L106] var_1_18 = __VERIFIER_nondet_char() [L107] CALL assume_abort_if_not(var_1_18 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L107] RET assume_abort_if_not(var_1_18 >= -1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L108] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L108] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L109] var_1_19 = __VERIFIER_nondet_char() [L110] CALL assume_abort_if_not(var_1_19 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L110] RET assume_abort_if_not(var_1_19 >= -1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L111] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L111] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L112] var_1_20 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=63, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=63, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L113] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=63, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L114] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=63, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=63, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L114] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=63, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L115] var_1_21 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_21 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L116] RET assume_abort_if_not(var_1_21 >= 31) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L117] CALL assume_abort_if_not(var_1_21 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L117] RET assume_abort_if_not(var_1_21 <= 63) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L118] var_1_22 = __VERIFIER_nondet_char() [L119] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L119] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L120] CALL assume_abort_if_not(var_1_22 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L120] RET assume_abort_if_not(var_1_22 <= 31) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L121] var_1_25 = __VERIFIER_nondet_uchar() [L122] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L122] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L123] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L123] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L124] var_1_28 = __VERIFIER_nondet_double() [L125] CALL assume_abort_if_not((var_1_28 >= -230584.3009213691390e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 2305843.009213691390e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L125] RET assume_abort_if_not((var_1_28 >= -230584.3009213691390e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 2305843.009213691390e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L126] var_1_29 = __VERIFIER_nondet_double() [L127] CALL assume_abort_if_not((var_1_29 >= -230584.3009213691390e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 2305843.009213691390e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L127] RET assume_abort_if_not((var_1_29 >= -230584.3009213691390e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 2305843.009213691390e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=19/2, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L128] var_1_30 = __VERIFIER_nondet_double() [L129] CALL assume_abort_if_not((var_1_30 >= -461168.6018427382800e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L129] RET assume_abort_if_not((var_1_30 >= -461168.6018427382800e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L144] RET updateVariables() [L145] CALL step() [L48] COND FALSE !((- last_1_var_1_9) < (last_1_var_1_9 + -500)) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=50, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L51] var_1_17 = (((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) - (var_1_20 + (var_1_21 - var_1_22))) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=-1, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L52] COND FALSE !(\read(var_1_4)) [L55] var_1_24 = (var_1_6 && ((var_1_10 >= var_1_17) && var_1_25)) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=-1, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=0, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L57] var_1_31 = var_1_30 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=-1, var_1_18=126, var_1_19=125, var_1_1=16, var_1_20=63, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=0, var_1_25=0, var_1_27=1/4, var_1_30=2147532804, var_1_31=2147532804, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L58] COND FALSE !(var_1_23 < var_1_23) [L69] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=-1, var_1_18=126, var_1_19=125, var_1_1=-1, var_1_20=63, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=0, var_1_25=0, var_1_27=1/4, var_1_30=2147532804, var_1_31=2147532804, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L71] signed char stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_9=4, stepLocal_0=-1, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=-1, var_1_18=126, var_1_19=125, var_1_1=-1, var_1_20=63, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=0, var_1_25=0, var_1_27=1/4, var_1_30=2147532804, var_1_31=2147532804, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=4] [L72] COND FALSE !(stepLocal_0 < (-1 - var_1_10)) [L79] var_1_9 = var_1_13 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=-1, var_1_18=126, var_1_19=125, var_1_1=-1, var_1_20=63, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=0, var_1_25=0, var_1_27=1/4, var_1_30=2147532804, var_1_31=2147532804, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=-32769] [L81] COND FALSE !(var_1_9 < (var_1_21 + var_1_23)) [L84] var_1_27 = var_1_28 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=-1, var_1_18=126, var_1_19=125, var_1_1=-1, var_1_20=63, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=0, var_1_25=0, var_1_27=2147532803, var_1_28=2147532803, var_1_30=2147532804, var_1_31=2147532804, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=-32769] [L145] RET step() [L146] CALL, EXPR property() [L135-L136] return (((((((var_1_23 < var_1_23) ? ((var_1_24 && var_1_24) ? (var_1_24 ? ((var_1_24 && (var_1_24 || var_1_24)) ? (var_1_1 == ((signed char) -5)) : 1) : 1) : (var_1_1 == ((signed char) var_1_8))) : (var_1_1 == ((signed char) var_1_8))) && ((var_1_1 < (-1 - var_1_10)) ? (var_1_24 ? (var_1_9 == ((unsigned short int) (var_1_10 + ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))))) : (var_1_9 == ((unsigned short int) ((var_1_12 - var_1_10) - ((var_1_13 - var_1_23) - ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))))))) : (var_1_9 == ((unsigned short int) var_1_13)))) && (var_1_17 == ((signed char) (((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) - (var_1_20 + (var_1_21 - var_1_22)))))) && (((- last_1_var_1_9) < (last_1_var_1_9 + -500)) ? (var_1_23 == ((unsigned char) var_1_20)) : 1)) && (var_1_4 ? (var_1_24 == ((unsigned char) (! var_1_25))) : (var_1_24 == ((unsigned char) (var_1_6 && ((var_1_10 >= var_1_17) && var_1_25)))))) && ((var_1_9 < (var_1_21 + var_1_23)) ? (var_1_27 == ((double) ((var_1_28 + var_1_29) + var_1_30))) : (var_1_27 == ((double) var_1_28)))) && (var_1_31 == ((float) var_1_30)) ; VAL [\result=0, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=-1, var_1_18=126, var_1_19=125, var_1_1=-1, var_1_20=63, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=0, var_1_25=0, var_1_27=2147532803, var_1_28=2147532803, var_1_30=2147532804, var_1_31=2147532804, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=-32769] [L146] RET, EXPR property() [L146] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=-1, var_1_18=126, var_1_19=125, var_1_1=-1, var_1_20=63, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=0, var_1_25=0, var_1_27=2147532803, var_1_28=2147532803, var_1_30=2147532804, var_1_31=2147532804, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=-32769] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=2147532798, var_1_13=-32769, var_1_17=-1, var_1_18=126, var_1_19=125, var_1_1=-1, var_1_20=63, var_1_21=63, var_1_22=0, var_1_23=16, var_1_24=0, var_1_25=0, var_1_27=2147532803, var_1_28=2147532803, var_1_30=2147532804, var_1_31=2147532804, var_1_4=0, var_1_6=1, var_1_8=-1, var_1_9=-32769] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 4, TraceHistogramMax: 27, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 498 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 475 mSDsluCounter, 927 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 621 mSDsCounter, 545 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1043 IncrementalHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 545 mSolverCounterUnsat, 306 mSDtfsCounter, 1043 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 586 GetRequests, 500 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2389 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=334occurred in iteration=3, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 149 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1002 NumberOfCodeBlocks, 1002 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 996 ConstructedInterpolants, 0 QuantifiedInterpolants, 3958 SizeOfPredicates, 6 NumberOfNonLiveVariables, 746 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 8132/8424 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 13:49:37,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-96.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 3090961677c94988a83046f2eaa2a3ede8184fc6a7310dc94aff0923cdf09d53 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:49:39,686 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:49:39,778 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 13:49:39,783 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:49:39,787 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:49:39,808 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:49:39,810 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:49:39,810 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:49:39,810 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:49:39,810 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:49:39,810 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:49:39,810 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:49:39,810 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:49:39,810 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:49:39,810 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:49:39,810 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:49:39,810 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:49:39,811 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:49:39,811 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:49:39,811 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:49:39,811 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:49:39,811 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:49:39,811 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:49:39,811 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 13:49:39,811 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 13:49:39,811 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 13:49:39,811 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:49:39,811 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:49:39,811 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:49:39,811 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:49:39,811 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:49:39,811 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:49:39,811 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:49:39,811 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:49:39,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:49:39,811 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:49:39,811 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:49:39,811 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:49:39,811 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:49:39,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:49:39,812 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:49:39,812 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:49:39,812 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:49:39,812 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:49:39,812 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 13:49:39,812 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 13:49:39,812 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:49:39,812 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:49:39,812 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:49:39,812 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:49:39,812 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 3090961677c94988a83046f2eaa2a3ede8184fc6a7310dc94aff0923cdf09d53 [2025-01-09 13:49:40,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:49:40,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:49:40,147 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:49:40,147 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:49:40,148 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:49:40,148 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-96.i [2025-01-09 13:49:41,435 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/83486aa1a/3547b47e071143b9b81ad1b239a7e07f/FLAG9fa7fa5af [2025-01-09 13:49:41,643 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:49:41,643 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-96.i [2025-01-09 13:49:41,653 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/83486aa1a/3547b47e071143b9b81ad1b239a7e07f/FLAG9fa7fa5af [2025-01-09 13:49:41,674 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/83486aa1a/3547b47e071143b9b81ad1b239a7e07f [2025-01-09 13:49:41,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:49:41,679 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:49:41,681 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:49:41,681 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:49:41,685 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:49:41,689 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:49:41" (1/1) ... [2025-01-09 13:49:41,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6912826a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:41, skipping insertion in model container [2025-01-09 13:49:41,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:49:41" (1/1) ... [2025-01-09 13:49:41,712 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:49:41,824 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-96.i[915,928] [2025-01-09 13:49:41,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:49:41,877 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:49:41,888 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-96.i[915,928] [2025-01-09 13:49:41,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:49:41,934 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:49:41,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:41 WrapperNode [2025-01-09 13:49:41,935 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:49:41,936 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:49:41,936 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:49:41,936 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:49:41,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:41" (1/1) ... [2025-01-09 13:49:41,951 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:41" (1/1) ... [2025-01-09 13:49:41,981 INFO L138 Inliner]: procedures = 27, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 155 [2025-01-09 13:49:41,981 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:49:41,982 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:49:41,982 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:49:41,982 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:49:41,998 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:41" (1/1) ... [2025-01-09 13:49:41,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:41" (1/1) ... [2025-01-09 13:49:42,003 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:41" (1/1) ... [2025-01-09 13:49:42,020 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]. [2025-01-09 13:49:42,024 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:41" (1/1) ... [2025-01-09 13:49:42,024 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:41" (1/1) ... [2025-01-09 13:49:42,040 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:41" (1/1) ... [2025-01-09 13:49:42,045 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:41" (1/1) ... [2025-01-09 13:49:42,048 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:41" (1/1) ... [2025-01-09 13:49:42,050 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:41" (1/1) ... [2025-01-09 13:49:42,051 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:41" (1/1) ... [2025-01-09 13:49:42,053 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:49:42,053 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:49:42,054 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:49:42,054 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:49:42,054 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:41" (1/1) ... [2025-01-09 13:49:42,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:49:42,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:49:42,078 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 13:49:42,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 13:49:42,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:49:42,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 13:49:42,096 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:49:42,096 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:49:42,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:49:42,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:49:42,159 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:49:42,161 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:49:44,307 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-01-09 13:49:44,308 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:49:44,315 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:49:44,316 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:49:44,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:49:44 BoogieIcfgContainer [2025-01-09 13:49:44,316 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:49:44,318 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:49:44,319 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:49:44,323 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:49:44,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:49:41" (1/3) ... [2025-01-09 13:49:44,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36884a18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:49:44, skipping insertion in model container [2025-01-09 13:49:44,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:41" (2/3) ... [2025-01-09 13:49:44,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36884a18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:49:44, skipping insertion in model container [2025-01-09 13:49:44,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:49:44" (3/3) ... [2025-01-09 13:49:44,328 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-96.i [2025-01-09 13:49:44,343 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:49:44,345 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-96.i that has 2 procedures, 72 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:49:44,395 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:49:44,405 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;@3c959bf5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:49:44,406 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:49:44,410 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 43 states have internal predecessors, (55), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 13:49:44,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 13:49:44,421 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:49:44,422 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:49:44,422 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:49:44,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:49:44,427 INFO L85 PathProgramCache]: Analyzing trace with hash 291962211, now seen corresponding path program 1 times [2025-01-09 13:49:44,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:49:44,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [364731069] [2025-01-09 13:49:44,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:49:44,439 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 [2025-01-09 13:49:44,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:49:44,442 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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) [2025-01-09 13:49:44,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 [2025-01-09 13:49:44,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 13:49:44,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 13:49:44,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:49:44,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:49:44,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:49:44,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:49:44,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 584 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2025-01-09 13:49:44,887 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:49:44,887 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:49:44,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [364731069] [2025-01-09 13:49:44,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [364731069] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:49:44,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:49:44,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 13:49:44,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466395550] [2025-01-09 13:49:44,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:49:44,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:49:44,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:49:44,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:49:44,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:49:44,909 INFO L87 Difference]: Start difference. First operand has 72 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 43 states have internal predecessors, (55), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 13:49:44,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:49:44,932 INFO L93 Difference]: Finished difference Result 138 states and 236 transitions. [2025-01-09 13:49:44,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:49:44,934 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 167 [2025-01-09 13:49:44,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:49:44,939 INFO L225 Difference]: With dead ends: 138 [2025-01-09 13:49:44,939 INFO L226 Difference]: Without dead ends: 66 [2025-01-09 13:49:44,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:49:44,945 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:49:44,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:49:44,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-01-09 13:49:44,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-01-09 13:49:44,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 13:49:44,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 97 transitions. [2025-01-09 13:49:44,981 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 97 transitions. Word has length 167 [2025-01-09 13:49:44,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:49:44,982 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 97 transitions. [2025-01-09 13:49:44,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 13:49:44,982 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 97 transitions. [2025-01-09 13:49:44,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 13:49:44,986 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:49:44,986 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:49:44,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 [2025-01-09 13:49:45,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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 [2025-01-09 13:49:45,187 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:49:45,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:49:45,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1522275043, now seen corresponding path program 1 times [2025-01-09 13:49:45,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:49:45,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [159225287] [2025-01-09 13:49:45,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:49:45,190 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 [2025-01-09 13:49:45,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:49:45,192 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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) [2025-01-09 13:49:45,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 [2025-01-09 13:49:45,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 13:49:45,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 13:49:45,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:49:45,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:49:45,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 13:49:45,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:49:45,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 13:49:45,836 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:49:45,836 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:49:45,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [159225287] [2025-01-09 13:49:45,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [159225287] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:49:45,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:49:45,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 13:49:45,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369657476] [2025-01-09 13:49:45,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:49:45,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:49:45,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:49:45,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:49:45,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:49:45,842 INFO L87 Difference]: Start difference. First operand 66 states and 97 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 13:49:48,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:49:50,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:49:50,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:49:50,164 INFO L93 Difference]: Finished difference Result 193 states and 286 transitions. [2025-01-09 13:49:50,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:49:50,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 167 [2025-01-09 13:49:50,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:49:50,184 INFO L225 Difference]: With dead ends: 193 [2025-01-09 13:49:50,184 INFO L226 Difference]: Without dead ends: 130 [2025-01-09 13:49:50,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:49:50,185 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 49 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-01-09 13:49:50,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 271 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-01-09 13:49:50,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-01-09 13:49:50,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 115. [2025-01-09 13:49:50,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 58 states have (on average 1.103448275862069) internal successors, (64), 58 states have internal predecessors, (64), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 13:49:50,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2025-01-09 13:49:50,212 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 167 [2025-01-09 13:49:50,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:49:50,212 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2025-01-09 13:49:50,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 13:49:50,212 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2025-01-09 13:49:50,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 13:49:50,214 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:49:50,214 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:49:50,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 [2025-01-09 13:49:50,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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 [2025-01-09 13:49:50,418 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:49:50,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:49:50,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1264109605, now seen corresponding path program 1 times [2025-01-09 13:49:50,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:49:50,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [723151344] [2025-01-09 13:49:50,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:49:50,421 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 [2025-01-09 13:49:50,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:49:50,423 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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) [2025-01-09 13:49:50,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 13:49:50,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 13:49:50,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 13:49:50,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:49:50,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:49:50,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 13:49:50,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:49:51,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 928 proven. 108 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2025-01-09 13:49:51,480 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:49:51,629 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:49:51,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [723151344] [2025-01-09 13:49:51,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [723151344] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:49:51,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [823341223] [2025-01-09 13:49:51,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:49:51,629 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 13:49:51,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 13:49:51,635 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 13:49:51,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-01-09 13:49:51,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 13:49:52,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 13:49:52,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:49:52,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:49:52,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 13:49:52,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:49:52,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 686 proven. 48 refuted. 0 times theorem prover too weak. 670 trivial. 0 not checked. [2025-01-09 13:49:52,475 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:49:52,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [823341223] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:49:52,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 13:49:52,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 13 [2025-01-09 13:49:52,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903424310] [2025-01-09 13:49:52,613 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 13:49:52,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 13:49:52,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:49:52,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 13:49:52,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-01-09 13:49:52,615 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 4 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) [2025-01-09 13:49:57,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:49:59,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:50:00,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:50:00,869 INFO L93 Difference]: Finished difference Result 289 states and 398 transitions. [2025-01-09 13:50:00,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-09 13:50:00,870 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 4 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) Word has length 167 [2025-01-09 13:50:00,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:50:00,874 INFO L225 Difference]: With dead ends: 289 [2025-01-09 13:50:00,877 INFO L226 Difference]: Without dead ends: 226 [2025-01-09 13:50:00,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=351, Invalid=909, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 13:50:00,882 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 146 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2025-01-09 13:50:00,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 385 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2025-01-09 13:50:00,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-01-09 13:50:00,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 207. [2025-01-09 13:50:00,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 112 states have (on average 1.0625) internal successors, (119), 113 states have internal predecessors, (119), 81 states have call successors, (81), 13 states have call predecessors, (81), 13 states have return successors, (81), 80 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 13:50:00,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 281 transitions. [2025-01-09 13:50:00,923 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 281 transitions. Word has length 167 [2025-01-09 13:50:00,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:50:00,924 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 281 transitions. [2025-01-09 13:50:00,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 4 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) [2025-01-09 13:50:00,924 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 281 transitions. [2025-01-09 13:50:00,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 13:50:00,932 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:50:00,932 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:50:00,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 13:50:01,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2025-01-09 13:50:01,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/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 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-01-09 13:50:01,337 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:50:01,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:50:01,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1262262563, now seen corresponding path program 1 times [2025-01-09 13:50:01,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:50:01,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [554497881] [2025-01-09 13:50:01,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:50:01,338 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 [2025-01-09 13:50:01,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:50:01,340 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/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) [2025-01-09 13:50:01,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-01-09 13:50:01,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 13:50:01,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 13:50:01,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:50:01,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:50:01,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-09 13:50:01,559 INFO L279 TraceCheckSpWp]: Computing forward predicates...