./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-15.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_codestructure_dependencies_file-15.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 6568da6d70491d0e7c183d700177071276bba2ccead1095511d807fbd8d57527 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:24:02,202 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:24:02,253 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 08:24:02,257 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:24:02,258 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:24:02,277 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:24:02,278 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:24:02,280 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:24:02,280 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:24:02,281 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:24:02,281 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:24:02,282 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:24:02,283 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:24:02,283 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:24:02,283 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:24:02,283 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:24:02,283 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:24:02,283 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 08:24:02,283 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 08:24:02,283 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 08:24:02,283 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:24:02,283 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:24:02,283 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:24:02,283 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:24:02,283 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 08:24:02,283 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:24:02,283 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:24:02,283 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:24:02,284 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:24:02,284 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:24:02,284 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:24:02,284 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:24:02,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:24:02,284 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:24:02,284 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:24:02,284 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:24:02,284 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:24:02,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:24:02,284 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:24:02,284 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:24:02,284 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:24:02,284 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:24:02,284 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 08:24:02,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 08:24:02,284 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:24:02,284 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:24:02,284 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:24:02,284 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:24:02,284 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 -> 6568da6d70491d0e7c183d700177071276bba2ccead1095511d807fbd8d57527 [2025-01-09 08:24:02,546 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:24:02,553 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:24:02,555 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:24:02,556 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:24:02,556 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:24:02,557 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-15.i [2025-01-09 08:24:03,748 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/686af4521/24f4ca999b9e4ee59e3378d3974b5c3f/FLAG11bfad7a7 [2025-01-09 08:24:04,020 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:24:04,021 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-15.i [2025-01-09 08:24:04,037 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/686af4521/24f4ca999b9e4ee59e3378d3974b5c3f/FLAG11bfad7a7 [2025-01-09 08:24:04,054 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/686af4521/24f4ca999b9e4ee59e3378d3974b5c3f [2025-01-09 08:24:04,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:24:04,057 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:24:04,059 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:24:04,059 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:24:04,063 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:24:04,063 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:24:04" (1/1) ... [2025-01-09 08:24:04,064 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6057e6de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:04, skipping insertion in model container [2025-01-09 08:24:04,064 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:24:04" (1/1) ... [2025-01-09 08:24:04,078 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:24:04,177 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_codestructure_dependencies_file-15.i[919,932] [2025-01-09 08:24:04,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:24:04,223 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:24:04,231 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_codestructure_dependencies_file-15.i[919,932] [2025-01-09 08:24:04,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:24:04,257 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:24:04,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:04 WrapperNode [2025-01-09 08:24:04,258 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:24:04,259 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:24:04,259 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:24:04,259 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:24:04,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:04" (1/1) ... [2025-01-09 08:24:04,268 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:04" (1/1) ... [2025-01-09 08:24:04,289 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2025-01-09 08:24:04,289 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:24:04,290 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:24:04,290 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:24:04,290 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:24:04,298 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:04" (1/1) ... [2025-01-09 08:24:04,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:04" (1/1) ... [2025-01-09 08:24:04,301 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:04" (1/1) ... [2025-01-09 08:24:04,313 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 08:24:04,313 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:04" (1/1) ... [2025-01-09 08:24:04,314 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:04" (1/1) ... [2025-01-09 08:24:04,317 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:04" (1/1) ... [2025-01-09 08:24:04,317 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:04" (1/1) ... [2025-01-09 08:24:04,319 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:04" (1/1) ... [2025-01-09 08:24:04,320 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:04" (1/1) ... [2025-01-09 08:24:04,321 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:04" (1/1) ... [2025-01-09 08:24:04,322 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:24:04,323 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:24:04,323 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:24:04,323 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:24:04,324 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:04" (1/1) ... [2025-01-09 08:24:04,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:24:04,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:24:04,359 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 08:24:04,369 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 08:24:04,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:24:04,381 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 08:24:04,381 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 08:24:04,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 08:24:04,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:24:04,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:24:04,435 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:24:04,436 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:24:04,653 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 08:24:04,654 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:24:04,672 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:24:04,672 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:24:04,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:24:04 BoogieIcfgContainer [2025-01-09 08:24:04,672 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:24:04,675 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:24:04,675 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:24:04,678 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:24:04,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:24:04" (1/3) ... [2025-01-09 08:24:04,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f2b584 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:24:04, skipping insertion in model container [2025-01-09 08:24:04,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:04" (2/3) ... [2025-01-09 08:24:04,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f2b584 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:24:04, skipping insertion in model container [2025-01-09 08:24:04,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:24:04" (3/3) ... [2025-01-09 08:24:04,680 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-15.i [2025-01-09 08:24:04,690 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:24:04,694 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-15.i that has 2 procedures, 63 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:24:04,741 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:24:04,751 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;@3665a35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:24:04,752 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:24:04,754 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 08:24:04,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 08:24:04,761 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:24:04,762 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:24:04,762 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:24:04,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:24:04,766 INFO L85 PathProgramCache]: Analyzing trace with hash 412004348, now seen corresponding path program 1 times [2025-01-09 08:24:04,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:24:04,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635295492] [2025-01-09 08:24:04,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:24:04,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:24:04,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 08:24:04,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 08:24:04,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:24:04,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:24:04,991 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-01-09 08:24:04,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:24:04,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635295492] [2025-01-09 08:24:04,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635295492] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:24:04,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881241496] [2025-01-09 08:24:04,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:24:04,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:24:04,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:24:04,995 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 08:24:04,996 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 08:24:05,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 08:24:05,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 08:24:05,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:24:05,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:24:05,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 08:24:05,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:24:05,167 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-01-09 08:24:05,168 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:24:05,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881241496] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:24:05,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 08:24:05,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 08:24:05,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871381919] [2025-01-09 08:24:05,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:24:05,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 08:24:05,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:24:05,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 08:24:05,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 08:24:05,185 INFO L87 Difference]: Start difference. First operand has 63 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 08:24:05,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:24:05,199 INFO L93 Difference]: Finished difference Result 120 states and 205 transitions. [2025-01-09 08:24:05,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 08:24:05,200 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 129 [2025-01-09 08:24:05,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:24:05,206 INFO L225 Difference]: With dead ends: 120 [2025-01-09 08:24:05,207 INFO L226 Difference]: Without dead ends: 60 [2025-01-09 08:24:05,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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 08:24:05,210 INFO L435 NwaCegarLoop]: 90 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, 90 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 08:24:05,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:24:05,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-09 08:24:05,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-01-09 08:24:05,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 08:24:05,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 90 transitions. [2025-01-09 08:24:05,250 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 90 transitions. Word has length 129 [2025-01-09 08:24:05,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:24:05,250 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 90 transitions. [2025-01-09 08:24:05,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 08:24:05,251 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 90 transitions. [2025-01-09 08:24:05,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 08:24:05,255 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:24:05,255 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:24:05,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 08:24:05,460 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 08:24:05,460 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:24:05,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:24:05,462 INFO L85 PathProgramCache]: Analyzing trace with hash 2016048176, now seen corresponding path program 1 times [2025-01-09 08:24:05,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:24:05,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886263211] [2025-01-09 08:24:05,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:24:05,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:24:05,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 08:24:05,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 08:24:05,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:24:05,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:24:05,739 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 08:24:05,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:24:05,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886263211] [2025-01-09 08:24:05,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886263211] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:24:05,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:24:05,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:24:05,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961040849] [2025-01-09 08:24:05,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:24:05,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:24:05,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:24:05,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:24:05,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:24:05,741 INFO L87 Difference]: Start difference. First operand 60 states and 90 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 08:24:05,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:24:05,857 INFO L93 Difference]: Finished difference Result 176 states and 266 transitions. [2025-01-09 08:24:05,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:24:05,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2025-01-09 08:24:05,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:24:05,860 INFO L225 Difference]: With dead ends: 176 [2025-01-09 08:24:05,861 INFO L226 Difference]: Without dead ends: 119 [2025-01-09 08:24:05,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 08:24:05,863 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 57 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:24:05,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 243 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:24:05,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-01-09 08:24:05,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 100. [2025-01-09 08:24:05,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 08:24:05,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 149 transitions. [2025-01-09 08:24:05,883 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 149 transitions. Word has length 129 [2025-01-09 08:24:05,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:24:05,883 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 149 transitions. [2025-01-09 08:24:05,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 08:24:05,884 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 149 transitions. [2025-01-09 08:24:05,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 08:24:05,885 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:24:05,885 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:24:05,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 08:24:05,885 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:24:05,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:24:05,886 INFO L85 PathProgramCache]: Analyzing trace with hash -715095816, now seen corresponding path program 1 times [2025-01-09 08:24:05,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:24:05,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688358649] [2025-01-09 08:24:05,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:24:05,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:24:05,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 08:24:05,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 08:24:05,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:24:05,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:24:05,973 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 08:24:05,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 08:24:06,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 08:24:06,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:24:06,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:24:06,078 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 08:24:06,078 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 08:24:06,079 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 08:24:06,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 08:24:06,082 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 08:24:06,139 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 08:24:06,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 08:24:06 BoogieIcfgContainer [2025-01-09 08:24:06,160 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 08:24:06,161 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 08:24:06,161 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 08:24:06,161 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 08:24:06,161 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:24:04" (3/4) ... [2025-01-09 08:24:06,163 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 08:24:06,163 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 08:24:06,164 INFO L158 Benchmark]: Toolchain (without parser) took 2106.44ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 136.3MB in the end (delta: -3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:24:06,164 INFO L158 Benchmark]: CDTParser took 1.16ms. Allocated memory is still 226.5MB. Free memory is still 145.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:24:06,164 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.51ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 119.0MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 08:24:06,164 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.64ms. Allocated memory is still 167.8MB. Free memory was 119.0MB in the beginning and 116.9MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 08:24:06,164 INFO L158 Benchmark]: Boogie Preprocessor took 32.29ms. Allocated memory is still 167.8MB. Free memory was 116.9MB in the beginning and 114.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:24:06,164 INFO L158 Benchmark]: RCFGBuilder took 349.63ms. Allocated memory is still 167.8MB. Free memory was 114.7MB in the beginning and 97.4MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 08:24:06,164 INFO L158 Benchmark]: TraceAbstraction took 1485.39ms. Allocated memory is still 167.8MB. Free memory was 96.8MB in the beginning and 136.4MB in the end (delta: -39.5MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2025-01-09 08:24:06,165 INFO L158 Benchmark]: Witness Printer took 2.68ms. Allocated memory is still 167.8MB. Free memory was 136.4MB in the beginning and 136.3MB in the end (delta: 37.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:24:06,165 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.16ms. Allocated memory is still 226.5MB. Free memory is still 145.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 199.51ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 119.0MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.64ms. Allocated memory is still 167.8MB. Free memory was 119.0MB in the beginning and 116.9MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.29ms. Allocated memory is still 167.8MB. Free memory was 116.9MB in the beginning and 114.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 349.63ms. Allocated memory is still 167.8MB. Free memory was 114.7MB in the beginning and 97.4MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1485.39ms. Allocated memory is still 167.8MB. Free memory was 96.8MB in the beginning and 136.4MB in the end (delta: -39.5MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Witness Printer took 2.68ms. Allocated memory is still 167.8MB. Free memory was 136.4MB in the beginning and 136.3MB in the end (delta: 37.3kB). 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 someBinaryArithmeticDOUBLEoperation at line 55, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 112, overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryFLOATComparisonOperation at line 54, overapproximation of someBinaryFLOATComparisonOperation at line 133, overapproximation of someBinaryFLOATComparisonOperation at line 110, overapproximation of someUnaryDOUBLEoperation at line 55, overapproximation of someBinaryDOUBLEComparisonOperation at line 116, overapproximation of someBinaryDOUBLEComparisonOperation at line 59, overapproximation of someBinaryDOUBLEComparisonOperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 55, overapproximation of someBinaryDOUBLEComparisonOperation at line 133, overapproximation of someBinaryDOUBLEComparisonOperation at line 114. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -10; [L23] float var_1_3 = 32.4; [L24] float var_1_4 = 49.2; [L25] signed short int var_1_7 = 10; [L26] signed short int var_1_8 = 64; [L27] signed short int var_1_9 = 256; [L28] signed char var_1_10 = -5; [L29] signed char var_1_11 = 5; [L30] double var_1_12 = 256.4; [L31] float var_1_13 = 2.6; [L32] float var_1_14 = 128.125; [L33] double var_1_15 = 32.5; [L34] double var_1_16 = 10000000000.25; [L35] signed char var_1_17 = -5; [L36] unsigned char var_1_19 = 0; [L37] unsigned char var_1_20 = 0; [L38] signed long int var_1_21 = 1; [L39] signed short int var_1_22 = 17178; [L40] signed short int var_1_23 = 5; [L41] signed long int var_1_25 = -4; [L42] signed char last_1_var_1_10 = -5; [L43] signed long int last_1_var_1_21 = 1; [L44] signed long int last_1_var_1_25 = -4; VAL [isInitial=0, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_3=162/5, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L137] isInitial = 1 [L138] FCALL initially() [L140] CALL updateLastVariables() [L128] last_1_var_1_10 = var_1_10 [L129] last_1_var_1_21 = var_1_21 [L130] last_1_var_1_25 = var_1_25 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_3=162/5, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L140] RET updateLastVariables() [L141] CALL updateVariables() [L93] var_1_3 = __VERIFIER_nondet_float() [L94] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L94] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L95] var_1_4 = __VERIFIER_nondet_float() [L96] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=10, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=10, var_1_8=64, var_1_9=256] [L96] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=10, var_1_8=64, var_1_9=256] [L97] var_1_7 = __VERIFIER_nondet_short() [L98] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=64, var_1_9=256] [L98] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=64, var_1_9=256] [L99] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=64, var_1_9=256] [L99] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=64, var_1_9=256] [L100] var_1_8 = __VERIFIER_nondet_short() [L101] CALL assume_abort_if_not(var_1_8 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=256] [L101] RET assume_abort_if_not(var_1_8 >= -1) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=256] [L102] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=256] [L102] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=256] [L103] var_1_9 = __VERIFIER_nondet_short() [L104] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L104] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L105] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L105] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L106] var_1_11 = __VERIFIER_nondet_char() [L107] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L107] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L108] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L108] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L109] var_1_13 = __VERIFIER_nondet_float() [L110] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L110] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L111] var_1_14 = __VERIFIER_nondet_float() [L112] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L112] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L113] var_1_15 = __VERIFIER_nondet_double() [L114] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L114] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L115] var_1_16 = __VERIFIER_nondet_double() [L116] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L116] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L117] var_1_20 = __VERIFIER_nondet_uchar() [L118] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L118] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L119] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L119] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L120] var_1_22 = __VERIFIER_nondet_short() [L121] CALL assume_abort_if_not(var_1_22 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L121] RET assume_abort_if_not(var_1_22 >= 16383) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L122] CALL assume_abort_if_not(var_1_22 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L122] RET assume_abort_if_not(var_1_22 <= 32767) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L123] var_1_23 = __VERIFIER_nondet_short() [L124] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L124] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L125] CALL assume_abort_if_not(var_1_23 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L125] RET assume_abort_if_not(var_1_23 <= 16384) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L141] RET updateVariables() [L142] CALL step() [L48] COND TRUE last_1_var_1_10 < last_1_var_1_25 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L49] COND TRUE var_1_11 <= last_1_var_1_25 [L50] var_1_19 = var_1_20 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L53] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L54] COND TRUE var_1_4 >= (var_1_3 * (var_1_13 + var_1_14)) [L55] var_1_12 = (((((var_1_15 - var_1_16)) < (-0.85)) ? ((var_1_15 - var_1_16)) : (-0.85))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L59] COND FALSE !(var_1_12 <= ((((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12)))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L66] COND FALSE !(\read(var_1_19)) [L69] var_1_25 = var_1_10 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L71] COND TRUE var_1_19 || (var_1_12 > var_1_12) [L72] var_1_1 = (var_1_17 + var_1_17) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L76] COND FALSE !(\read(var_1_20)) [L89] var_1_21 = var_1_9 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=16383, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L142] RET step() [L143] CALL, EXPR property() [L133-L134] return (((((((var_1_19 || (var_1_12 > var_1_12)) ? (var_1_1 == ((signed short int) (var_1_17 + var_1_17))) : (var_1_1 == ((signed short int) ((((((var_1_7 + 1)) < (var_1_8)) ? ((var_1_7 + 1)) : (var_1_8))) - (24762 - var_1_9))))) && (var_1_10 == ((signed char) var_1_11))) && ((var_1_4 >= (var_1_3 * (var_1_13 + var_1_14))) ? (var_1_12 == ((double) (((((var_1_15 - var_1_16)) < (-0.85)) ? ((var_1_15 - var_1_16)) : (-0.85))))) : (var_1_12 == ((double) var_1_16)))) && ((var_1_12 <= ((((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12)))) ? ((var_1_19 || var_1_19) ? (var_1_17 == ((signed char) var_1_11)) : (var_1_17 == ((signed char) var_1_11))) : 1)) && ((last_1_var_1_10 < last_1_var_1_25) ? ((var_1_11 <= last_1_var_1_25) ? (var_1_19 == ((unsigned char) var_1_20)) : 1) : 1)) && (var_1_20 ? ((var_1_10 < ((var_1_22 - var_1_23) - var_1_9)) ? (var_1_19 ? ((last_1_var_1_21 == (var_1_22 + var_1_11)) ? (var_1_21 == ((signed long int) var_1_1)) : 1) : (var_1_21 == ((signed long int) var_1_10))) : (var_1_21 == ((signed long int) var_1_11))) : (var_1_21 == ((signed long int) var_1_9)))) && (var_1_19 ? (var_1_25 == ((signed long int) (var_1_17 + ((((var_1_17) < (((((var_1_8) < (var_1_17)) ? (var_1_8) : (var_1_17))))) ? (var_1_17) : (((((var_1_8) < (var_1_17)) ? (var_1_8) : (var_1_17))))))))) : (var_1_25 == ((signed long int) var_1_10))) ; VAL [\result=0, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=16383, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L143] RET, EXPR property() [L143] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=16383, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=16383, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_7=16383, var_1_8=16384, var_1_9=16383] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 3, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 57 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 mSDsluCounter, 333 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 158 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18 IncrementalHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 175 mSDtfsCounter, 18 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=2, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 19 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 517 NumberOfCodeBlocks, 517 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 384 ConstructedInterpolants, 0 QuantifiedInterpolants, 536 SizeOfPredicates, 0 NumberOfNonLiveVariables, 309 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2242/2280 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 08:24:06,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_codestructure_dependencies_file-15.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 6568da6d70491d0e7c183d700177071276bba2ccead1095511d807fbd8d57527 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:24:08,115 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:24:08,220 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 08:24:08,229 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:24:08,232 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:24:08,265 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:24:08,269 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:24:08,269 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:24:08,269 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:24:08,269 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:24:08,270 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:24:08,270 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:24:08,270 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:24:08,270 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:24:08,270 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:24:08,270 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:24:08,270 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:24:08,271 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 08:24:08,271 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 08:24:08,272 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:24:08,273 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:24:08,273 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:24:08,273 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:24:08,273 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 08:24:08,273 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 08:24:08,273 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 08:24:08,273 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 08:24:08,273 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:24:08,273 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:24:08,273 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:24:08,274 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:24:08,274 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:24:08,274 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:24:08,274 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:24:08,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:24:08,274 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:24:08,274 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:24:08,274 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:24:08,274 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:24:08,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:24:08,274 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:24:08,274 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:24:08,274 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:24:08,274 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:24:08,275 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 08:24:08,275 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 08:24:08,275 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:24:08,275 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:24:08,275 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:24:08,275 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:24:08,275 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 -> 6568da6d70491d0e7c183d700177071276bba2ccead1095511d807fbd8d57527 [2025-01-09 08:24:08,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:24:08,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:24:08,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:24:08,610 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:24:08,611 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:24:08,612 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-15.i [2025-01-09 08:24:09,820 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/68cd21bc0/b9b6fc6fb1b842a7a6be8237baafab34/FLAG99439fd0d [2025-01-09 08:24:10,009 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:24:10,011 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-15.i [2025-01-09 08:24:10,019 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/68cd21bc0/b9b6fc6fb1b842a7a6be8237baafab34/FLAG99439fd0d [2025-01-09 08:24:10,375 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/68cd21bc0/b9b6fc6fb1b842a7a6be8237baafab34 [2025-01-09 08:24:10,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:24:10,378 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:24:10,383 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:24:10,383 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:24:10,387 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:24:10,391 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:24:10" (1/1) ... [2025-01-09 08:24:10,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2a5d8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:10, skipping insertion in model container [2025-01-09 08:24:10,393 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:24:10" (1/1) ... [2025-01-09 08:24:10,407 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:24:10,517 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_codestructure_dependencies_file-15.i[919,932] [2025-01-09 08:24:10,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:24:10,562 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:24:10,569 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_codestructure_dependencies_file-15.i[919,932] [2025-01-09 08:24:10,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:24:10,602 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:24:10,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:10 WrapperNode [2025-01-09 08:24:10,603 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:24:10,603 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:24:10,603 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:24:10,603 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:24:10,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:10" (1/1) ... [2025-01-09 08:24:10,613 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:10" (1/1) ... [2025-01-09 08:24:10,642 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2025-01-09 08:24:10,643 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:24:10,643 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:24:10,643 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:24:10,643 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:24:10,650 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:10" (1/1) ... [2025-01-09 08:24:10,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:10" (1/1) ... [2025-01-09 08:24:10,658 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:10" (1/1) ... [2025-01-09 08:24:10,673 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 08:24:10,673 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:10" (1/1) ... [2025-01-09 08:24:10,673 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:10" (1/1) ... [2025-01-09 08:24:10,683 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:10" (1/1) ... [2025-01-09 08:24:10,683 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:10" (1/1) ... [2025-01-09 08:24:10,685 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:10" (1/1) ... [2025-01-09 08:24:10,690 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:10" (1/1) ... [2025-01-09 08:24:10,691 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:10" (1/1) ... [2025-01-09 08:24:10,693 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:24:10,697 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:24:10,697 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:24:10,697 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:24:10,698 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:10" (1/1) ... [2025-01-09 08:24:10,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:24:10,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:24:10,723 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 08:24:10,731 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 08:24:10,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:24:10,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 08:24:10,750 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 08:24:10,750 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 08:24:10,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:24:10,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:24:10,812 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:24:10,813 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:24:13,168 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 08:24:13,168 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:24:13,175 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:24:13,175 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:24:13,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:24:13 BoogieIcfgContainer [2025-01-09 08:24:13,176 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:24:13,178 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:24:13,178 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:24:13,181 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:24:13,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:24:10" (1/3) ... [2025-01-09 08:24:13,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa2d178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:24:13, skipping insertion in model container [2025-01-09 08:24:13,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:10" (2/3) ... [2025-01-09 08:24:13,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa2d178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:24:13, skipping insertion in model container [2025-01-09 08:24:13,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:24:13" (3/3) ... [2025-01-09 08:24:13,183 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-15.i [2025-01-09 08:24:13,200 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:24:13,202 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-15.i that has 2 procedures, 63 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:24:13,241 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:24:13,249 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;@9eef549, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:24:13,249 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:24:13,252 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 08:24:13,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 08:24:13,262 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:24:13,263 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:24:13,265 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:24:13,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:24:13,271 INFO L85 PathProgramCache]: Analyzing trace with hash 412004348, now seen corresponding path program 1 times [2025-01-09 08:24:13,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:24:13,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1700917794] [2025-01-09 08:24:13,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:24:13,281 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 08:24:13,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 08:24:13,283 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 08:24:13,285 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 08:24:13,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 08:24:13,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 08:24:13,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:24:13,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:24:13,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 08:24:13,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:24:13,632 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2025-01-09 08:24:13,632 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:24:13,632 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 08:24:13,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1700917794] [2025-01-09 08:24:13,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1700917794] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:24:13,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:24:13,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 08:24:13,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482532851] [2025-01-09 08:24:13,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:24:13,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 08:24:13,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 08:24:13,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 08:24:13,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 08:24:13,657 INFO L87 Difference]: Start difference. First operand has 63 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 08:24:13,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:24:13,681 INFO L93 Difference]: Finished difference Result 120 states and 205 transitions. [2025-01-09 08:24:13,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 08:24:13,682 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 129 [2025-01-09 08:24:13,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:24:13,690 INFO L225 Difference]: With dead ends: 120 [2025-01-09 08:24:13,690 INFO L226 Difference]: Without dead ends: 60 [2025-01-09 08:24:13,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 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 08:24:13,696 INFO L435 NwaCegarLoop]: 90 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, 90 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 08:24:13,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:24:13,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-09 08:24:13,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-01-09 08:24:13,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 08:24:13,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 90 transitions. [2025-01-09 08:24:13,737 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 90 transitions. Word has length 129 [2025-01-09 08:24:13,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:24:13,741 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 90 transitions. [2025-01-09 08:24:13,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 08:24:13,741 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 90 transitions. [2025-01-09 08:24:13,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 08:24:13,743 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:24:13,743 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:24:13,755 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 08:24:13,944 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 08:24:13,944 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:24:13,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:24:13,945 INFO L85 PathProgramCache]: Analyzing trace with hash 2016048176, now seen corresponding path program 1 times [2025-01-09 08:24:13,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:24:13,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1199172741] [2025-01-09 08:24:13,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:24:13,946 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 08:24:13,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 08:24:13,948 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 08:24:13,949 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 08:24:13,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 08:24:14,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 08:24:14,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:24:14,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:24:14,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 08:24:14,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:24:15,370 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 08:24:15,370 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:24:15,370 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 08:24:15,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1199172741] [2025-01-09 08:24:15,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1199172741] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:24:15,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:24:15,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 08:24:15,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388646179] [2025-01-09 08:24:15,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:24:15,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:24:15,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 08:24:15,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:24:15,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:24:15,372 INFO L87 Difference]: Start difference. First operand 60 states and 90 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 08:24:17,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 08:24:20,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 08:24:20,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:24:20,343 INFO L93 Difference]: Finished difference Result 175 states and 265 transitions. [2025-01-09 08:24:20,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:24:20,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2025-01-09 08:24:20,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:24:20,373 INFO L225 Difference]: With dead ends: 175 [2025-01-09 08:24:20,373 INFO L226 Difference]: Without dead ends: 118 [2025-01-09 08:24:20,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 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 08:24:20,375 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 51 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-01-09 08:24:20,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 245 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-01-09 08:24:20,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-01-09 08:24:20,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 100. [2025-01-09 08:24:20,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 08:24:20,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 149 transitions. [2025-01-09 08:24:20,404 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 149 transitions. Word has length 129 [2025-01-09 08:24:20,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:24:20,405 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 149 transitions. [2025-01-09 08:24:20,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 08:24:20,405 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 149 transitions. [2025-01-09 08:24:20,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 08:24:20,406 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:24:20,407 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:24:20,426 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 (3)] Ended with exit code 0 [2025-01-09 08:24:20,607 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 08:24:20,607 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:24:20,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:24:20,608 INFO L85 PathProgramCache]: Analyzing trace with hash -715095816, now seen corresponding path program 1 times [2025-01-09 08:24:20,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:24:20,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [615869560] [2025-01-09 08:24:20,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:24:20,609 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 08:24:20,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 08:24:20,611 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 08:24:20,612 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 08:24:20,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 08:24:20,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 08:24:20,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:24:20,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:24:20,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 08:24:20,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:24:22,470 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 08:24:22,470 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:24:22,470 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 08:24:22,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [615869560] [2025-01-09 08:24:22,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [615869560] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:24:22,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:24:22,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 08:24:22,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431062462] [2025-01-09 08:24:22,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:24:22,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:24:22,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 08:24:22,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:24:22,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:24:22,472 INFO L87 Difference]: Start difference. First operand 100 states and 149 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 08:24:24,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 08:24:26,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 08:24:31,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 08:24:34,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 08:24:35,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 08:24:35,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:24:35,654 INFO L93 Difference]: Finished difference Result 214 states and 323 transitions. [2025-01-09 08:24:35,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:24:35,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 130 [2025-01-09 08:24:35,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:24:35,671 INFO L225 Difference]: With dead ends: 214 [2025-01-09 08:24:35,671 INFO L226 Difference]: Without dead ends: 157 [2025-01-09 08:24:35,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:24:35,672 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 73 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2025-01-09 08:24:35,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 222 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 12.6s Time] [2025-01-09 08:24:35,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-01-09 08:24:35,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 101. [2025-01-09 08:24:35,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 58 states have (on average 1.206896551724138) internal successors, (70), 58 states have internal predecessors, (70), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 08:24:35,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 150 transitions. [2025-01-09 08:24:35,699 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 150 transitions. Word has length 130 [2025-01-09 08:24:35,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:24:35,700 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 150 transitions. [2025-01-09 08:24:35,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 08:24:35,700 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 150 transitions. [2025-01-09 08:24:35,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 08:24:35,701 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:24:35,701 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:24:35,714 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 08:24:35,906 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 [2025-01-09 08:24:35,906 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:24:35,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:24:35,909 INFO L85 PathProgramCache]: Analyzing trace with hash -35037446, now seen corresponding path program 1 times [2025-01-09 08:24:35,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:24:35,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [216407062] [2025-01-09 08:24:35,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:24:35,910 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 08:24:35,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 08:24:35,912 INFO L229 MonitoredProcess]: Starting monitored process 5 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 08:24:35,913 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 (5)] Waiting until timeout for monitored process [2025-01-09 08:24:35,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 08:24:36,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 08:24:36,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:24:36,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:24:36,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 08:24:36,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:24:37,079 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 39 proven. 336 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2025-01-09 08:24:37,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:24:37,628 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 39 proven. 18 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-01-09 08:24:37,629 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 08:24:37,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [216407062] [2025-01-09 08:24:37,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [216407062] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:24:37,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 08:24:37,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-01-09 08:24:37,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917091127] [2025-01-09 08:24:37,629 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 08:24:37,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 08:24:37,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 08:24:37,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 08:24:37,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-09 08:24:37,631 INFO L87 Difference]: Start difference. First operand 101 states and 150 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 4 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2025-01-09 08:24:43,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 08:24:44,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:24:44,454 INFO L93 Difference]: Finished difference Result 233 states and 338 transitions. [2025-01-09 08:24:44,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 08:24:44,465 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 4 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) Word has length 130 [2025-01-09 08:24:44,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:24:44,467 INFO L225 Difference]: With dead ends: 233 [2025-01-09 08:24:44,467 INFO L226 Difference]: Without dead ends: 175 [2025-01-09 08:24:44,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=196, Invalid=404, Unknown=0, NotChecked=0, Total=600 [2025-01-09 08:24:44,468 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 267 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:24:44,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 236 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2025-01-09 08:24:44,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-01-09 08:24:44,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 108. [2025-01-09 08:24:44,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 63 states have (on average 1.1746031746031746) internal successors, (74), 63 states have internal predecessors, (74), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 08:24:44,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 154 transitions. [2025-01-09 08:24:44,487 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 154 transitions. Word has length 130 [2025-01-09 08:24:44,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:24:44,488 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 154 transitions. [2025-01-09 08:24:44,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 4 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2025-01-09 08:24:44,488 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 154 transitions. [2025-01-09 08:24:44,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 08:24:44,491 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:24:44,491 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:24:44,504 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 (5)] Ended with exit code 0 [2025-01-09 08:24:44,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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 08:24:44,692 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:24:44,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:24:44,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1110759305, now seen corresponding path program 1 times [2025-01-09 08:24:44,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:24:44,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451624441] [2025-01-09 08:24:44,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:24:44,694 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 08:24:44,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 08:24:44,696 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 08:24:44,698 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 08:24:44,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 08:24:44,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 08:24:44,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:24:44,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:24:44,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 08:24:44,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:24:45,076 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 289 proven. 12 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2025-01-09 08:24:45,077 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:24:45,285 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 45 proven. 12 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-01-09 08:24:45,285 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 08:24:45,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [451624441] [2025-01-09 08:24:45,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [451624441] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:24:45,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 08:24:45,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-01-09 08:24:45,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715677474] [2025-01-09 08:24:45,286 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 08:24:45,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 08:24:45,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 08:24:45,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 08:24:45,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:24:45,287 INFO L87 Difference]: Start difference. First operand 108 states and 154 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 08:24:47,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 08:24:47,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:24:47,205 INFO L93 Difference]: Finished difference Result 182 states and 251 transitions. [2025-01-09 08:24:47,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 08:24:47,220 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 131 [2025-01-09 08:24:47,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:24:47,221 INFO L225 Difference]: With dead ends: 182 [2025-01-09 08:24:47,221 INFO L226 Difference]: Without dead ends: 121 [2025-01-09 08:24:47,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 254 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-01-09 08:24:47,224 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 132 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 08:24:47,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 112 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 08:24:47,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-01-09 08:24:47,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 113. [2025-01-09 08:24:47,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 08:24:47,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 150 transitions. [2025-01-09 08:24:47,269 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 150 transitions. Word has length 131 [2025-01-09 08:24:47,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:24:47,269 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 150 transitions. [2025-01-09 08:24:47,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-09 08:24:47,270 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 150 transitions. [2025-01-09 08:24:47,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 08:24:47,270 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:24:47,270 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:24:47,284 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 (6)] Ended with exit code 0 [2025-01-09 08:24:47,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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 08:24:47,471 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:24:47,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:24:47,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1862847629, now seen corresponding path program 1 times [2025-01-09 08:24:47,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:24:47,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [240563556] [2025-01-09 08:24:47,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:24:47,473 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 08:24:47,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 08:24:47,475 INFO L229 MonitoredProcess]: Starting monitored process 7 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 08:24:47,476 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 (7)] Waiting until timeout for monitored process [2025-01-09 08:24:47,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 08:24:47,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 08:24:47,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:24:47,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:24:47,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 08:24:47,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:25:18,611 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)