./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-50.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-50.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 c4a52f5cd92f62bf93f5dc90929bc5553e1570b7f06b79b6f8e4705ffe1aa663 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:55:39,287 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:55:39,342 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 23:55:39,347 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:55:39,348 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:55:39,370 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:55:39,370 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:55:39,370 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:55:39,372 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:55:39,372 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:55:39,372 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:55:39,373 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:55:39,373 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:55:39,373 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:55:39,373 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:55:39,373 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:55:39,374 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:55:39,374 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:55:39,374 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 23:55:39,374 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:55:39,374 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:55:39,374 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:55:39,374 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:55:39,374 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:55:39,374 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:55:39,375 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:55:39,375 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:55:39,375 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:55:39,375 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:55:39,375 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:55:39,375 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:55:39,375 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:55:39,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:55:39,375 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:55:39,376 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:55:39,376 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:55:39,376 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:55:39,376 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 23:55:39,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 23:55:39,376 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:55:39,376 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:55:39,376 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:55:39,376 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:55:39,376 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/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 -> c4a52f5cd92f62bf93f5dc90929bc5553e1570b7f06b79b6f8e4705ffe1aa663 [2025-03-16 23:55:39,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:55:39,593 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:55:39,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:55:39,596 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:55:39,596 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:55:39,597 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-50.i [2025-03-16 23:55:40,683 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84a135e41/2ab21a1346cc4d148026e54a164d1eca/FLAG9544f8883 [2025-03-16 23:55:40,894 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:55:40,910 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-50.i [2025-03-16 23:55:40,918 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84a135e41/2ab21a1346cc4d148026e54a164d1eca/FLAG9544f8883 [2025-03-16 23:55:41,254 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84a135e41/2ab21a1346cc4d148026e54a164d1eca [2025-03-16 23:55:41,256 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:55:41,257 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:55:41,257 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:55:41,257 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:55:41,260 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:55:41,261 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:55:41" (1/1) ... [2025-03-16 23:55:41,261 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf0269b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:41, skipping insertion in model container [2025-03-16 23:55:41,262 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:55:41" (1/1) ... [2025-03-16 23:55:41,278 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:55:41,392 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-50.i[915,928] [2025-03-16 23:55:41,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:55:41,471 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:55:41,479 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-50.i[915,928] [2025-03-16 23:55:41,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:55:41,527 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:55:41,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:41 WrapperNode [2025-03-16 23:55:41,528 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:55:41,529 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:55:41,529 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:55:41,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:55:41,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:41" (1/1) ... [2025-03-16 23:55:41,542 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:41" (1/1) ... [2025-03-16 23:55:41,570 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 156 [2025-03-16 23:55:41,571 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:55:41,571 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:55:41,571 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:55:41,571 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:55:41,577 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:41" (1/1) ... [2025-03-16 23:55:41,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:41" (1/1) ... [2025-03-16 23:55:41,580 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:41" (1/1) ... [2025-03-16 23:55:41,591 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-03-16 23:55:41,592 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:41" (1/1) ... [2025-03-16 23:55:41,592 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:41" (1/1) ... [2025-03-16 23:55:41,598 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:41" (1/1) ... [2025-03-16 23:55:41,599 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:41" (1/1) ... [2025-03-16 23:55:41,601 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:41" (1/1) ... [2025-03-16 23:55:41,602 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:41" (1/1) ... [2025-03-16 23:55:41,607 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:55:41,607 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:55:41,608 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:55:41,608 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:55:41,610 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:41" (1/1) ... [2025-03-16 23:55:41,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:55:41,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:55:41,640 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 23:55:41,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 23:55:41,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:55:41,658 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:55:41,658 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:55:41,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 23:55:41,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:55:41,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:55:41,725 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:55:41,726 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:55:41,952 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-16 23:55:41,952 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:55:41,964 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:55:41,965 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:55:41,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:55:41 BoogieIcfgContainer [2025-03-16 23:55:41,965 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:55:41,967 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:55:41,967 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:55:41,970 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:55:41,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:55:41" (1/3) ... [2025-03-16 23:55:41,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75e01831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:55:41, skipping insertion in model container [2025-03-16 23:55:41,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:41" (2/3) ... [2025-03-16 23:55:41,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75e01831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:55:41, skipping insertion in model container [2025-03-16 23:55:41,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:55:41" (3/3) ... [2025-03-16 23:55:41,972 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-50.i [2025-03-16 23:55:41,983 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:55:41,985 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-50.i that has 2 procedures, 64 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:55:42,032 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:55:42,042 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;@eba6b5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:55:42,043 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:55:42,046 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-16 23:55:42,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-16 23:55:42,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:55:42,057 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 23:55:42,057 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:55:42,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:55:42,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1573577981, now seen corresponding path program 1 times [2025-03-16 23:55:42,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:55:42,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920125160] [2025-03-16 23:55:42,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:55:42,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:55:42,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-16 23:55:42,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-16 23:55:42,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:55:42,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:55:42,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-16 23:55:42,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:55:42,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920125160] [2025-03-16 23:55:42,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920125160] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:55:42,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164543812] [2025-03-16 23:55:42,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:55:42,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:55:42,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:55:42,352 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 23:55:42,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 23:55:42,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-16 23:55:42,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-16 23:55:42,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:55:42,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:55:42,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:55:42,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:55:42,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-16 23:55:42,488 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:55:42,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164543812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:55:42,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:55:42,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 23:55:42,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050190653] [2025-03-16 23:55:42,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:55:42,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:55:42,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:55:42,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:55:42,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:55:42,512 INFO L87 Difference]: Start difference. First operand has 64 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-16 23:55:42,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:55:42,528 INFO L93 Difference]: Finished difference Result 125 states and 217 transitions. [2025-03-16 23:55:42,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:55:42,530 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 145 [2025-03-16 23:55:42,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:55:42,534 INFO L225 Difference]: With dead ends: 125 [2025-03-16 23:55:42,534 INFO L226 Difference]: Without dead ends: 62 [2025-03-16 23:55:42,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 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-03-16 23:55:42,538 INFO L435 NwaCegarLoop]: 94 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, 94 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-03-16 23:55:42,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:55:42,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-16 23:55:42,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-16 23:55:42,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-16 23:55:42,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 94 transitions. [2025-03-16 23:55:42,574 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 94 transitions. Word has length 145 [2025-03-16 23:55:42,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:55:42,574 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 94 transitions. [2025-03-16 23:55:42,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-16 23:55:42,575 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 94 transitions. [2025-03-16 23:55:42,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-16 23:55:42,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:55:42,577 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 23:55:42,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 23:55:42,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-16 23:55:42,781 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:55:42,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:55:42,782 INFO L85 PathProgramCache]: Analyzing trace with hash -2133352122, now seen corresponding path program 1 times [2025-03-16 23:55:42,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:55:42,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559869536] [2025-03-16 23:55:42,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:55:42,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:55:42,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-16 23:55:42,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-16 23:55:42,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:55:42,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:55:43,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-16 23:55:43,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:55:43,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559869536] [2025-03-16 23:55:43,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559869536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:55:43,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:55:43,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 23:55:43,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122999436] [2025-03-16 23:55:43,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:55:43,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 23:55:43,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:55:43,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 23:55:43,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 23:55:43,167 INFO L87 Difference]: Start difference. First operand 62 states and 94 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-16 23:55:43,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:55:43,335 INFO L93 Difference]: Finished difference Result 183 states and 278 transitions. [2025-03-16 23:55:43,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 23:55:43,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 145 [2025-03-16 23:55:43,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:55:43,338 INFO L225 Difference]: With dead ends: 183 [2025-03-16 23:55:43,339 INFO L226 Difference]: Without dead ends: 122 [2025-03-16 23:55:43,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03-16 23:55:43,341 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 87 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 23:55:43,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 213 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 23:55:43,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-16 23:55:43,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 66. [2025-03-16 23:55:43,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-16 23:55:43,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 99 transitions. [2025-03-16 23:55:43,356 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 99 transitions. Word has length 145 [2025-03-16 23:55:43,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:55:43,357 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 99 transitions. [2025-03-16 23:55:43,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-16 23:55:43,357 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 99 transitions. [2025-03-16 23:55:43,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-16 23:55:43,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:55:43,358 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 23:55:43,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 23:55:43,358 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:55:43,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:55:43,359 INFO L85 PathProgramCache]: Analyzing trace with hash -2104722971, now seen corresponding path program 1 times [2025-03-16 23:55:43,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:55:43,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900331020] [2025-03-16 23:55:43,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:55:43,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:55:43,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-16 23:55:43,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-16 23:55:43,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:55:43,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:55:44,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 105 proven. 21 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2025-03-16 23:55:44,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:55:44,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900331020] [2025-03-16 23:55:44,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900331020] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:55:44,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034617830] [2025-03-16 23:55:44,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:55:44,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:55:44,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:55:44,164 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 23:55:44,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 23:55:44,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-16 23:55:44,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-16 23:55:44,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:55:44,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:55:44,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-16 23:55:44,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:55:44,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 417 proven. 21 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2025-03-16 23:55:44,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 23:55:45,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 105 proven. 24 refuted. 0 times theorem prover too weak. 883 trivial. 0 not checked. [2025-03-16 23:55:45,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034617830] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 23:55:45,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 23:55:45,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 12] total 23 [2025-03-16 23:55:45,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828641019] [2025-03-16 23:55:45,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 23:55:45,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-16 23:55:45,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:55:45,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-16 23:55:45,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2025-03-16 23:55:45,206 INFO L87 Difference]: Start difference. First operand 66 states and 99 transitions. Second operand has 23 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 23 states have internal predecessors, (76), 6 states have call successors, (33), 3 states have call predecessors, (33), 7 states have return successors, (34), 6 states have call predecessors, (34), 6 states have call successors, (34) [2025-03-16 23:55:46,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:55:46,535 INFO L93 Difference]: Finished difference Result 268 states and 377 transitions. [2025-03-16 23:55:46,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-16 23:55:46,536 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 23 states have internal predecessors, (76), 6 states have call successors, (33), 3 states have call predecessors, (33), 7 states have return successors, (34), 6 states have call predecessors, (34), 6 states have call successors, (34) Word has length 145 [2025-03-16 23:55:46,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:55:46,538 INFO L225 Difference]: With dead ends: 268 [2025-03-16 23:55:46,538 INFO L226 Difference]: Without dead ends: 203 [2025-03-16 23:55:46,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=630, Invalid=2022, Unknown=0, NotChecked=0, Total=2652 [2025-03-16 23:55:46,540 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 534 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 495 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 495 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 23:55:46,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 540 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [495 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 23:55:46,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-16 23:55:46,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 168. [2025-03-16 23:55:46,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 97 states have (on average 1.1855670103092784) internal successors, (115), 99 states have internal predecessors, (115), 62 states have call successors, (62), 8 states have call predecessors, (62), 8 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-16 23:55:46,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 239 transitions. [2025-03-16 23:55:46,574 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 239 transitions. Word has length 145 [2025-03-16 23:55:46,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:55:46,575 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 239 transitions. [2025-03-16 23:55:46,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 23 states have internal predecessors, (76), 6 states have call successors, (33), 3 states have call predecessors, (33), 7 states have return successors, (34), 6 states have call predecessors, (34), 6 states have call successors, (34) [2025-03-16 23:55:46,576 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 239 transitions. [2025-03-16 23:55:46,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-16 23:55:46,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:55:46,578 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 23:55:46,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 23:55:46,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-16 23:55:46,783 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:55:46,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:55:46,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1965101669, now seen corresponding path program 1 times [2025-03-16 23:55:46,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:55:46,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530769490] [2025-03-16 23:55:46,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:55:46,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:55:46,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-16 23:55:46,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-16 23:55:46,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:55:46,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:55:46,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-16 23:55:46,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:55:46,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530769490] [2025-03-16 23:55:46,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530769490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:55:46,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:55:46,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 23:55:46,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973056343] [2025-03-16 23:55:46,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:55:46,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 23:55:46,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:55:46,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 23:55:46,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 23:55:46,895 INFO L87 Difference]: Start difference. First operand 168 states and 239 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-16 23:55:46,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:55:46,983 INFO L93 Difference]: Finished difference Result 306 states and 433 transitions. [2025-03-16 23:55:46,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 23:55:46,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 145 [2025-03-16 23:55:46,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:55:46,987 INFO L225 Difference]: With dead ends: 306 [2025-03-16 23:55:46,987 INFO L226 Difference]: Without dead ends: 168 [2025-03-16 23:55:46,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03-16 23:55:46,988 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 87 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 23:55:46,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 127 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 23:55:46,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-16 23:55:47,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 164. [2025-03-16 23:55:47,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 93 states have (on average 1.1612903225806452) internal successors, (108), 95 states have internal predecessors, (108), 62 states have call successors, (62), 8 states have call predecessors, (62), 8 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-16 23:55:47,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 232 transitions. [2025-03-16 23:55:47,007 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 232 transitions. Word has length 145 [2025-03-16 23:55:47,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:55:47,008 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 232 transitions. [2025-03-16 23:55:47,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-16 23:55:47,008 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 232 transitions. [2025-03-16 23:55:47,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-16 23:55:47,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:55:47,009 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 23:55:47,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 23:55:47,010 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:55:47,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:55:47,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1993730820, now seen corresponding path program 1 times [2025-03-16 23:55:47,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:55:47,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282342602] [2025-03-16 23:55:47,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:55:47,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:55:47,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-16 23:55:47,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-16 23:55:47,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:55:47,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 23:55:47,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [257904147] [2025-03-16 23:55:47,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:55:47,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:55:47,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:55:47,099 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 23:55:47,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 23:55:47,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-16 23:55:47,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-16 23:55:47,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:55:47,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:55:47,280 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 23:55:47,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-16 23:55:47,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-16 23:55:47,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:55:47,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:55:47,434 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 23:55:47,434 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 23:55:47,435 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 23:55:47,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 23:55:47,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:55:47,642 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-16 23:55:47,737 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 23:55:47,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 11:55:47 BoogieIcfgContainer [2025-03-16 23:55:47,743 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 23:55:47,743 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 23:55:47,743 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 23:55:47,743 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 23:55:47,744 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:55:41" (3/4) ... [2025-03-16 23:55:47,745 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 23:55:47,746 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 23:55:47,747 INFO L158 Benchmark]: Toolchain (without parser) took 6490.10ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 113.1MB in the beginning and 94.4MB in the end (delta: 18.7MB). Peak memory consumption was 58.1MB. Max. memory is 16.1GB. [2025-03-16 23:55:47,747 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 226.5MB. Free memory is still 149.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:55:47,747 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.06ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 98.4MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 23:55:47,748 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.76ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 94.6MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:55:47,748 INFO L158 Benchmark]: Boogie Preprocessor took 35.94ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 88.1MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 23:55:47,748 INFO L158 Benchmark]: IcfgBuilder took 357.51ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 64.9MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 23:55:47,748 INFO L158 Benchmark]: TraceAbstraction took 5775.99ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 63.8MB in the beginning and 94.4MB in the end (delta: -30.6MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2025-03-16 23:55:47,749 INFO L158 Benchmark]: Witness Printer took 3.05ms. Allocated memory is still 184.5MB. Free memory was 94.4MB in the beginning and 94.4MB in the end (delta: 36.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:55:47,750 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 226.5MB. Free memory is still 149.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.06ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 98.4MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.76ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 94.6MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.94ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 88.1MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 357.51ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 64.9MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5775.99ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 63.8MB in the beginning and 94.4MB in the end (delta: -30.6MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * Witness Printer took 3.05ms. Allocated memory is still 184.5MB. Free memory was 94.4MB in the beginning and 94.4MB in the end (delta: 36.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 113, overapproximation of someBinaryFLOATComparisonOperation at line 144, overapproximation of someBinaryFLOATComparisonOperation at line 64, overapproximation of someBinaryFLOATComparisonOperation at line 115, overapproximation of someBinaryFLOATComparisonOperation at line 111, overapproximation of someBinaryDOUBLEComparisonOperation at line 139, overapproximation of someBinaryArithmeticFLOAToperation at line 64, overapproximation of someUnaryFLOAToperation at line 64. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_7 = 0; [L24] unsigned char var_1_8 = 1; [L25] signed short int var_1_9 = -2; [L26] float var_1_13 = 999.4; [L27] float var_1_14 = 100.425; [L28] float var_1_15 = 3.375; [L29] float var_1_16 = 15.9; [L30] signed short int var_1_17 = -10; [L31] signed short int var_1_18 = 18060; [L32] unsigned char var_1_20 = 0; [L33] unsigned long int var_1_21 = 4; [L34] unsigned char var_1_23 = 0; [L35] unsigned char var_1_24 = 0; [L36] unsigned char var_1_25 = 100; [L37] unsigned char var_1_26 = 32; [L38] unsigned char var_1_27 = 10; [L39] unsigned char var_1_28 = 1; [L40] unsigned short int var_1_29 = 256; [L41] unsigned char var_1_30 = 1; [L42] unsigned char var_1_31 = 4; [L43] unsigned char var_1_32 = 200; [L44] double var_1_33 = 31.625; [L45] double var_1_34 = 99999.67; [L46] signed long int var_1_35 = 10; [L47] unsigned short int var_1_36 = 5; [L48] unsigned long int var_1_38 = 10; [L49] unsigned short int var_1_39 = 0; [L148] isInitial = 1 [L149] FCALL initially() [L150] COND TRUE 1 [L151] FCALL updateLastVariables() [L152] CALL updateVariables() [L104] var_1_7 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L105] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L106] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L106] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L107] var_1_8 = __VERIFIER_nondet_uchar() [L108] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L108] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L109] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L109] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L110] var_1_14 = __VERIFIER_nondet_float() [L111] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L111] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L112] var_1_15 = __VERIFIER_nondet_float() [L113] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L113] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L114] var_1_16 = __VERIFIER_nondet_float() [L115] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L115] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L116] var_1_18 = __VERIFIER_nondet_short() [L117] CALL assume_abort_if_not(var_1_18 >= 16382) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L117] RET assume_abort_if_not(var_1_18 >= 16382) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L118] CALL assume_abort_if_not(var_1_18 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L118] RET assume_abort_if_not(var_1_18 <= 32766) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L119] var_1_21 = __VERIFIER_nondet_ulong() [L120] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L120] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L121] CALL assume_abort_if_not(var_1_21 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L121] RET assume_abort_if_not(var_1_21 <= 4294967295) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L122] CALL assume_abort_if_not(var_1_21 != 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L122] RET assume_abort_if_not(var_1_21 != 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L123] var_1_23 = __VERIFIER_nondet_uchar() [L124] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L124] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L125] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L125] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L126] var_1_24 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L127] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L128] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L128] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L129] var_1_26 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L130] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L131] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=257, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=257, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L131] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=257, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L132] var_1_27 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=257, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=257, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L133] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=257, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L134] CALL assume_abort_if_not(var_1_27 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=257, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=257, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L134] RET assume_abort_if_not(var_1_27 <= 127) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=257, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=200, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L135] var_1_32 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=257, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=257, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L136] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=257, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L137] CALL assume_abort_if_not(var_1_32 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=257, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=257, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L137] RET assume_abort_if_not(var_1_32 <= 254) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=257, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_34=9999967/100, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L138] var_1_34 = __VERIFIER_nondet_double() [L139] CALL assume_abort_if_not((var_1_34 >= -922337.2036854765600e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=257, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=257, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L139] RET assume_abort_if_not((var_1_34 >= -922337.2036854765600e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=257, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_32=0, var_1_33=253/8, var_1_35=10, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L152] RET updateVariables() [L153] CALL step() [L53] var_1_31 = var_1_32 [L54] var_1_33 = var_1_34 [L55] var_1_35 = var_1_31 VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=257, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=2, var_1_35=0, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L56] COND FALSE !(var_1_32 < var_1_35) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=257, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=2, var_1_35=0, var_1_36=5, var_1_38=10, var_1_39=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L61] var_1_38 = var_1_36 [L62] var_1_39 = 256 VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=257, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=2, var_1_35=0, var_1_36=5, var_1_38=5, var_1_39=256, var_1_7=1, var_1_8=1, var_1_9=-2] [L63] COND TRUE \read(var_1_8) [L64] var_1_13 = (((((var_1_14 + var_1_15)) < (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16))))) ? ((var_1_14 + var_1_15)) : (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16)))))) VAL [isInitial=1, var_1_13=3, var_1_16=0, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=257, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=2, var_1_35=0, var_1_36=5, var_1_38=5, var_1_39=256, var_1_7=1, var_1_8=1, var_1_9=-2] [L66] COND TRUE \read(var_1_8) [L67] var_1_25 = (var_1_26 + var_1_27) VAL [isInitial=1, var_1_13=3, var_1_16=0, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=257, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=2, var_1_35=0, var_1_36=5, var_1_38=5, var_1_39=256, var_1_7=1, var_1_8=1, var_1_9=-2] [L69] var_1_29 = var_1_27 [L70] var_1_30 = var_1_8 VAL [isInitial=1, var_1_13=3, var_1_16=0, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=257, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=2, var_1_35=0, var_1_36=5, var_1_38=5, var_1_39=256, var_1_7=1, var_1_8=1, var_1_9=-2] [L71] COND FALSE !((var_1_29 > var_1_25) && var_1_30) [L74] var_1_9 = ((((var_1_25) > ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25))))) ? (var_1_25) : ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25)))))) VAL [isInitial=1, var_1_13=3, var_1_16=0, var_1_17=-10, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=257, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=2, var_1_35=0, var_1_36=5, var_1_38=5, var_1_39=256, var_1_7=1, var_1_8=1, var_1_9=1] [L76] var_1_17 = ((var_1_18 - 25) - var_1_25) [L77] signed long int stepLocal_2 = var_1_25 + var_1_17; VAL [isInitial=1, stepLocal_2=32734, var_1_13=3, var_1_16=0, var_1_17=32733, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=257, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=2, var_1_35=0, var_1_36=5, var_1_38=5, var_1_39=256, var_1_7=1, var_1_8=1, var_1_9=1] [L78] COND TRUE ((var_1_18 % var_1_21) & ((((1u) < 0 ) ? -(1u) : (1u)))) < stepLocal_2 [L79] var_1_20 = (var_1_23 || var_1_24) VAL [isInitial=1, var_1_13=3, var_1_16=0, var_1_17=32733, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=257, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=2, var_1_35=0, var_1_36=5, var_1_38=5, var_1_39=256, var_1_7=1, var_1_8=1, var_1_9=1] [L83] signed short int stepLocal_3 = var_1_9; VAL [isInitial=1, stepLocal_3=1, var_1_13=3, var_1_16=0, var_1_17=32733, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=257, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=2, var_1_35=0, var_1_36=5, var_1_38=5, var_1_39=256, var_1_7=1, var_1_8=1, var_1_9=1] [L84] COND FALSE !((~ var_1_29) > stepLocal_3) [L87] var_1_28 = (var_1_20 || ((! var_1_23) && (var_1_24 || var_1_7))) VAL [isInitial=1, var_1_13=3, var_1_16=0, var_1_17=32733, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=257, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=2, var_1_35=0, var_1_36=5, var_1_38=5, var_1_39=256, var_1_7=1, var_1_8=1, var_1_9=1] [L89] signed long int stepLocal_1 = (((var_1_9) > (var_1_25)) ? (var_1_9) : (var_1_25)); [L90] unsigned char stepLocal_0 = var_1_25; VAL [isInitial=1, stepLocal_0=1, stepLocal_1=1, var_1_13=3, var_1_16=0, var_1_17=32733, var_1_18=32759, var_1_1=1, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=257, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=2, var_1_35=0, var_1_36=5, var_1_38=5, var_1_39=256, var_1_7=1, var_1_8=1, var_1_9=1] [L91] COND FALSE !(stepLocal_1 <= (var_1_25 - var_1_25)) [L100] var_1_1 = 0 VAL [isInitial=1, stepLocal_0=1, var_1_13=3, var_1_16=0, var_1_17=32733, var_1_18=32759, var_1_1=0, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=257, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=2, var_1_35=0, var_1_36=5, var_1_38=5, var_1_39=256, var_1_7=1, var_1_8=1, var_1_9=1] [L153] RET step() [L154] CALL, EXPR property() [L144-L145] return (((((((((((((var_1_9) > (var_1_25)) ? (var_1_9) : (var_1_25))) <= (var_1_25 - var_1_25)) ? ((var_1_25 < var_1_25) ? (var_1_20 ? (var_1_1 == ((unsigned char) var_1_7)) : (var_1_1 == ((unsigned char) var_1_8))) : 1) : (var_1_1 == ((unsigned char) 0))) && (((var_1_29 > var_1_25) && var_1_30) ? (var_1_9 == ((signed short int) var_1_25)) : (var_1_9 == ((signed short int) ((((var_1_25) > ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25))))) ? (var_1_25) : ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25)))))))))) && (var_1_8 ? (var_1_13 == ((float) (((((var_1_14 + var_1_15)) < (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16))))) ? ((var_1_14 + var_1_15)) : (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16)))))))) : 1)) && (var_1_17 == ((signed short int) ((var_1_18 - 25) - var_1_25)))) && ((((var_1_18 % var_1_21) & ((((1u) < 0 ) ? -(1u) : (1u)))) < (var_1_25 + var_1_17)) ? (var_1_20 == ((unsigned char) (var_1_23 || var_1_24))) : (var_1_20 == ((unsigned char) var_1_7)))) && (var_1_8 ? (var_1_25 == ((unsigned char) (var_1_26 + var_1_27))) : 1)) && (((~ var_1_29) > var_1_9) ? (var_1_28 == ((unsigned char) (! var_1_7))) : (var_1_28 == ((unsigned char) (var_1_20 || ((! var_1_23) && (var_1_24 || var_1_7))))))) && (var_1_29 == ((unsigned short int) var_1_27))) && (var_1_30 == ((unsigned char) var_1_8)) ; [L154] RET, EXPR property() [L154] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_13=3, var_1_16=0, var_1_17=32733, var_1_18=32759, var_1_1=0, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=257, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=2, var_1_35=0, var_1_36=5, var_1_38=5, var_1_39=256, var_1_7=1, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_13=3, var_1_16=0, var_1_17=32733, var_1_18=32759, var_1_1=0, var_1_20=0, var_1_21=8190, var_1_23=0, var_1_24=0, var_1_25=1, var_1_26=257, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=2, var_1_34=2, var_1_35=0, var_1_36=5, var_1_38=5, var_1_39=256, var_1_7=1, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 64 locations, 121 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 5, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 728 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 708 mSDsluCounter, 974 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 594 mSDsCounter, 498 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 811 IncrementalHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 498 mSolverCounterUnsat, 380 mSDtfsCounter, 811 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 490 GetRequests, 434 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168occurred in iteration=3, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 95 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1160 NumberOfCodeBlocks, 1160 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1008 ConstructedInterpolants, 0 QuantifiedInterpolants, 1905 SizeOfPredicates, 5 NumberOfNonLiveVariables, 714 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 6974/7084 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-03-16 23:55:47,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-50.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 c4a52f5cd92f62bf93f5dc90929bc5553e1570b7f06b79b6f8e4705ffe1aa663 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:55:49,576 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:55:49,641 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 23:55:49,648 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:55:49,648 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:55:49,694 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:55:49,694 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:55:49,694 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:55:49,695 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:55:49,695 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:55:49,695 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:55:49,695 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:55:49,695 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:55:49,695 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:55:49,695 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:55:49,695 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:55:49,695 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:55:49,695 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:55:49,695 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:55:49,695 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:55:49,695 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:55:49,695 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:55:49,696 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:55:49,696 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 23:55:49,696 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 23:55:49,696 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 23:55:49,696 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:55:49,696 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:55:49,696 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:55:49,696 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:55:49,696 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:55:49,696 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:55:49,696 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:55:49,696 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:55:49,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:55:49,696 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:55:49,696 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:55:49,702 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:55:49,702 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:55:49,702 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 23:55:49,702 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 23:55:49,702 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:55:49,702 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:55:49,706 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:55:49,707 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:55:49,707 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/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 -> c4a52f5cd92f62bf93f5dc90929bc5553e1570b7f06b79b6f8e4705ffe1aa663 [2025-03-16 23:55:49,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:55:49,917 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:55:49,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:55:49,920 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:55:49,920 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:55:49,922 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-50.i [2025-03-16 23:55:51,092 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a82637d5a/7d9df9a03cbc4ada8343968e9e281f96/FLAGc6312cb1a [2025-03-16 23:55:51,354 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:55:51,355 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-50.i [2025-03-16 23:55:51,366 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a82637d5a/7d9df9a03cbc4ada8343968e9e281f96/FLAGc6312cb1a [2025-03-16 23:55:51,672 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a82637d5a/7d9df9a03cbc4ada8343968e9e281f96 [2025-03-16 23:55:51,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:55:51,676 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:55:51,677 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:55:51,677 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:55:51,680 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:55:51,680 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:55:51" (1/1) ... [2025-03-16 23:55:51,681 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17cf6295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:51, skipping insertion in model container [2025-03-16 23:55:51,681 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:55:51" (1/1) ... [2025-03-16 23:55:51,696 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:55:51,798 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-50.i[915,928] [2025-03-16 23:55:51,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:55:51,847 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:55:51,855 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-50.i[915,928] [2025-03-16 23:55:51,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:55:51,887 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:55:51,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:51 WrapperNode [2025-03-16 23:55:51,888 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:55:51,889 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:55:51,889 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:55:51,889 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:55:51,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:51" (1/1) ... [2025-03-16 23:55:51,901 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:51" (1/1) ... [2025-03-16 23:55:51,917 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 155 [2025-03-16 23:55:51,917 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:55:51,918 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:55:51,918 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:55:51,918 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:55:51,923 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:51" (1/1) ... [2025-03-16 23:55:51,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:51" (1/1) ... [2025-03-16 23:55:51,926 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:51" (1/1) ... [2025-03-16 23:55:51,934 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-03-16 23:55:51,934 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:51" (1/1) ... [2025-03-16 23:55:51,934 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:51" (1/1) ... [2025-03-16 23:55:51,940 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:51" (1/1) ... [2025-03-16 23:55:51,941 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:51" (1/1) ... [2025-03-16 23:55:51,943 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:51" (1/1) ... [2025-03-16 23:55:51,943 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:51" (1/1) ... [2025-03-16 23:55:51,945 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:55:51,946 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:55:51,946 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:55:51,946 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:55:51,947 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:51" (1/1) ... [2025-03-16 23:55:51,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:55:51,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:55:51,977 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 23:55:51,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 23:55:52,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:55:52,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 23:55:52,001 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:55:52,001 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:55:52,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:55:52,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:55:52,072 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:55:52,074 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:55:52,522 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-16 23:55:52,522 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:55:52,529 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:55:52,529 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:55:52,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:55:52 BoogieIcfgContainer [2025-03-16 23:55:52,529 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:55:52,531 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:55:52,531 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:55:52,536 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:55:52,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:55:51" (1/3) ... [2025-03-16 23:55:52,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1027f5fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:55:52, skipping insertion in model container [2025-03-16 23:55:52,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:55:51" (2/3) ... [2025-03-16 23:55:52,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1027f5fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:55:52, skipping insertion in model container [2025-03-16 23:55:52,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:55:52" (3/3) ... [2025-03-16 23:55:52,538 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-50.i [2025-03-16 23:55:52,548 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:55:52,549 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-50.i that has 2 procedures, 64 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:55:52,587 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:55:52,607 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;@f776a38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:55:52,608 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:55:52,611 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-16 23:55:52,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-16 23:55:52,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:55:52,620 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 23:55:52,620 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:55:52,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:55:52,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1573577981, now seen corresponding path program 1 times [2025-03-16 23:55:52,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:55:52,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [367783252] [2025-03-16 23:55:52,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:55:52,631 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-03-16 23:55:52,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:55:52,633 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-03-16 23:55:52,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 23:55:52,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-16 23:55:52,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-16 23:55:52,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:55:52,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:55:52,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:55:52,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:55:52,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 528 proven. 0 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2025-03-16 23:55:52,931 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:55:52,931 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:55:52,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [367783252] [2025-03-16 23:55:52,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [367783252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:55:52,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:55:52,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 23:55:52,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182655460] [2025-03-16 23:55:52,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:55:52,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:55:52,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:55:52,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:55:52,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:55:52,957 INFO L87 Difference]: Start difference. First operand has 64 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-16 23:55:52,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:55:52,981 INFO L93 Difference]: Finished difference Result 125 states and 217 transitions. [2025-03-16 23:55:52,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:55:52,983 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 145 [2025-03-16 23:55:52,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:55:52,990 INFO L225 Difference]: With dead ends: 125 [2025-03-16 23:55:52,990 INFO L226 Difference]: Without dead ends: 62 [2025-03-16 23:55:52,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 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-03-16 23:55:52,996 INFO L435 NwaCegarLoop]: 94 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, 94 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-03-16 23:55:52,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:55:53,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-16 23:55:53,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-16 23:55:53,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-16 23:55:53,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 94 transitions. [2025-03-16 23:55:53,032 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 94 transitions. Word has length 145 [2025-03-16 23:55:53,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:55:53,032 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 94 transitions. [2025-03-16 23:55:53,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-16 23:55:53,033 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 94 transitions. [2025-03-16 23:55:53,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-16 23:55:53,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:55:53,035 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 23:55:53,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 23:55:53,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-03-16 23:55:53,235 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:55:53,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:55:53,236 INFO L85 PathProgramCache]: Analyzing trace with hash -2133352122, now seen corresponding path program 1 times [2025-03-16 23:55:53,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:55:53,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [913812227] [2025-03-16 23:55:53,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:55:53,237 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-03-16 23:55:53,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:55:53,239 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-03-16 23:55:53,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 23:55:53,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-16 23:55:53,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-16 23:55:53,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:55:53,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:55:53,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 23:55:53,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:55:53,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-16 23:55:53,590 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:55:53,590 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:55:53,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [913812227] [2025-03-16 23:55:53,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [913812227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:55:53,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:55:53,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 23:55:53,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773066744] [2025-03-16 23:55:53,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:55:53,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 23:55:53,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:55:53,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 23:55:53,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 23:55:53,592 INFO L87 Difference]: Start difference. First operand 62 states and 94 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-16 23:55:53,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:55:53,871 INFO L93 Difference]: Finished difference Result 171 states and 262 transitions. [2025-03-16 23:55:53,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 23:55:53,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 145 [2025-03-16 23:55:53,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:55:53,875 INFO L225 Difference]: With dead ends: 171 [2025-03-16 23:55:53,876 INFO L226 Difference]: Without dead ends: 110 [2025-03-16 23:55:53,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 142 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-03-16 23:55:53,877 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 88 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 23:55:53,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 399 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 23:55:53,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-16 23:55:53,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 62. [2025-03-16 23:55:53,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-16 23:55:53,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 93 transitions. [2025-03-16 23:55:53,922 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 93 transitions. Word has length 145 [2025-03-16 23:55:53,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:55:53,926 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 93 transitions. [2025-03-16 23:55:53,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-16 23:55:53,926 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 93 transitions. [2025-03-16 23:55:53,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-16 23:55:53,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:55:53,927 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 23:55:53,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 23:55:54,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-03-16 23:55:54,128 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:55:54,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:55:54,128 INFO L85 PathProgramCache]: Analyzing trace with hash -2104722971, now seen corresponding path program 1 times [2025-03-16 23:55:54,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:55:54,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1889660925] [2025-03-16 23:55:54,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:55:54,129 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-03-16 23:55:54,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:55:54,130 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-03-16 23:55:54,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-16 23:55:54,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-16 23:55:54,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-16 23:55:54,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:55:54,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:55:54,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-16 23:55:54,367 INFO L279 TraceCheckSpWp]: Computing forward predicates...