./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-0.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_codestructure_normal_file-0.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 75183837198a67904a3a61f480ace7d79976c5c6c2ed857798c72fba443adac4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:03:57,128 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:03:57,168 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 23:03:57,172 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:03:57,172 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:03:57,186 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:03:57,187 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:03:57,187 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:03:57,188 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:03:57,188 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:03:57,188 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:03:57,188 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:03:57,188 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:03:57,188 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:03:57,188 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:03:57,188 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:03:57,188 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:03:57,189 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:03:57,189 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 23:03:57,189 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:03:57,189 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:03:57,189 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:03:57,189 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:03:57,189 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:03:57,189 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:03:57,189 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:03:57,189 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:03:57,189 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:03:57,189 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:03:57,190 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:03:57,190 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:03:57,190 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:03:57,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:03:57,190 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:03:57,190 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:03:57,190 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:03:57,190 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:03:57,190 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 23:03:57,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 23:03:57,191 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:03:57,191 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:03:57,191 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:03:57,191 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:03:57,191 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 -> 75183837198a67904a3a61f480ace7d79976c5c6c2ed857798c72fba443adac4 [2025-03-16 23:03:57,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:03:57,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:03:57,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:03:57,407 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:03:57,407 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:03:57,408 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-0.i [2025-03-16 23:03:58,530 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05913c119/2da169cf3e474aef8bc1539bb934e1cb/FLAG99a31963c [2025-03-16 23:03:58,785 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:03:58,786 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-0.i [2025-03-16 23:03:58,795 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05913c119/2da169cf3e474aef8bc1539bb934e1cb/FLAG99a31963c [2025-03-16 23:03:59,088 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05913c119/2da169cf3e474aef8bc1539bb934e1cb [2025-03-16 23:03:59,090 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:03:59,091 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:03:59,092 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:03:59,092 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:03:59,094 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:03:59,095 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:03:59" (1/1) ... [2025-03-16 23:03:59,095 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@814bc58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:03:59, skipping insertion in model container [2025-03-16 23:03:59,095 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:03:59" (1/1) ... [2025-03-16 23:03:59,107 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:03:59,200 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_codestructure_normal_file-0.i[912,925] [2025-03-16 23:03:59,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:03:59,262 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:03:59,271 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_codestructure_normal_file-0.i[912,925] [2025-03-16 23:03:59,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:03:59,310 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:03:59,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:03:59 WrapperNode [2025-03-16 23:03:59,311 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:03:59,311 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:03:59,311 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:03:59,311 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:03:59,315 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:03:59" (1/1) ... [2025-03-16 23:03:59,326 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:03:59" (1/1) ... [2025-03-16 23:03:59,351 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2025-03-16 23:03:59,356 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:03:59,356 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:03:59,356 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:03:59,356 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:03:59,364 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:03:59" (1/1) ... [2025-03-16 23:03:59,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:03:59" (1/1) ... [2025-03-16 23:03:59,366 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:03:59" (1/1) ... [2025-03-16 23:03:59,384 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:03:59,385 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:03:59" (1/1) ... [2025-03-16 23:03:59,385 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:03:59" (1/1) ... [2025-03-16 23:03:59,391 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:03:59" (1/1) ... [2025-03-16 23:03:59,393 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:03:59" (1/1) ... [2025-03-16 23:03:59,399 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:03:59" (1/1) ... [2025-03-16 23:03:59,400 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:03:59" (1/1) ... [2025-03-16 23:03:59,401 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:03:59,405 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:03:59,405 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:03:59,405 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:03:59,406 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:03:59" (1/1) ... [2025-03-16 23:03:59,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:03:59,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:03:59,436 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:03:59,439 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:03:59,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:03:59,456 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:03:59,457 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:03:59,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 23:03:59,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:03:59,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:03:59,505 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:03:59,507 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:03:59,745 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-16 23:03:59,748 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:03:59,755 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:03:59,755 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:03:59,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:03:59 BoogieIcfgContainer [2025-03-16 23:03:59,756 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:03:59,757 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:03:59,757 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:03:59,760 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:03:59,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:03:59" (1/3) ... [2025-03-16 23:03:59,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fa9ad17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:03:59, skipping insertion in model container [2025-03-16 23:03:59,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:03:59" (2/3) ... [2025-03-16 23:03:59,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fa9ad17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:03:59, skipping insertion in model container [2025-03-16 23:03:59,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:03:59" (3/3) ... [2025-03-16 23:03:59,762 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-0.i [2025-03-16 23:03:59,771 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:03:59,773 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-0.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:03:59,811 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:03:59,818 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;@7ae3490e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:03:59,818 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:03:59,821 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 31 states have internal predecessors, (43), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-16 23:03:59,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 23:03:59,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:03:59,828 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:59,829 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:03:59,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:03:59,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1803720462, now seen corresponding path program 1 times [2025-03-16 23:03:59,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:03:59,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409950593] [2025-03-16 23:03:59,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:03:59,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:03:59,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 23:03:59,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 23:03:59,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:03:59,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:04:00,059 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-16 23:04:00,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:04:00,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409950593] [2025-03-16 23:04:00,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409950593] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:04:00,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797045378] [2025-03-16 23:04:00,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:04:00,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:04:00,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:04:00,066 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:04:00,068 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:04:00,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 23:04:00,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 23:04:00,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:04:00,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:04:00,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:04:00,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:04:00,223 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-16 23:04:00,226 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:04:00,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797045378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:04:00,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:04:00,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 23:04:00,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696232083] [2025-03-16 23:04:00,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:04:00,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:04:00,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:04:00,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:04:00,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:04:00,249 INFO L87 Difference]: Start difference. First operand has 51 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 31 states have internal predecessors, (43), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-16 23:04:00,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:04:00,263 INFO L93 Difference]: Finished difference Result 99 states and 174 transitions. [2025-03-16 23:04:00,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:04:00,264 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 113 [2025-03-16 23:04:00,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:04:00,269 INFO L225 Difference]: With dead ends: 99 [2025-03-16 23:04:00,269 INFO L226 Difference]: Without dead ends: 49 [2025-03-16 23:04:00,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 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:04:00,273 INFO L435 NwaCegarLoop]: 75 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, 75 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:04:00,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:04:00,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-16 23:04:00,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-16 23:04:00,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 states have internal predecessors, (39), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-16 23:04:00,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 75 transitions. [2025-03-16 23:04:00,301 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 75 transitions. Word has length 113 [2025-03-16 23:04:00,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:04:00,301 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 75 transitions. [2025-03-16 23:04:00,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-16 23:04:00,302 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 75 transitions. [2025-03-16 23:04:00,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 23:04:00,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:04:00,303 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:00,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 23:04:00,505 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:04:00,505 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:04:00,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:04:00,506 INFO L85 PathProgramCache]: Analyzing trace with hash -830458416, now seen corresponding path program 1 times [2025-03-16 23:04:00,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:04:00,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308284926] [2025-03-16 23:04:00,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:04:00,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:04:00,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 23:04:00,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 23:04:00,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:04:00,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:04:00,639 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 23:04:00,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 23:04:00,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 23:04:00,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:04:00,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:04:00,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 23:04:00,765 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 23:04:00,766 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 23:04:00,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 23:04:00,769 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-16 23:04:00,835 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 23:04:00,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 11:04:00 BoogieIcfgContainer [2025-03-16 23:04:00,840 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 23:04:00,840 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 23:04:00,841 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 23:04:00,841 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 23:04:00,842 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:03:59" (3/4) ... [2025-03-16 23:04:00,843 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 23:04:00,844 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 23:04:00,845 INFO L158 Benchmark]: Toolchain (without parser) took 1754.16ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 67.7MB in the end (delta: 46.0MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2025-03-16 23:04:00,845 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 201.3MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:04:00,845 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.20ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 100.0MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 23:04:00,846 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.57ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 97.2MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:04:00,846 INFO L158 Benchmark]: Boogie Preprocessor took 48.14ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 93.9MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:04:00,847 INFO L158 Benchmark]: IcfgBuilder took 350.74ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 75.0MB in the end (delta: 18.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 23:04:00,847 INFO L158 Benchmark]: TraceAbstraction took 1082.44ms. Allocated memory is still 142.6MB. Free memory was 74.5MB in the beginning and 67.7MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2025-03-16 23:04:00,848 INFO L158 Benchmark]: Witness Printer took 4.22ms. Allocated memory is still 142.6MB. Free memory was 67.7MB in the beginning and 67.7MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:04:00,849 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.55ms. Allocated memory is still 201.3MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 219.20ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 100.0MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.57ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 97.2MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.14ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 93.9MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 350.74ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 75.0MB in the end (delta: 18.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1082.44ms. Allocated memory is still 142.6MB. Free memory was 74.5MB in the beginning and 67.7MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Witness Printer took 4.22ms. Allocated memory is still 142.6MB. Free memory was 67.7MB in the beginning and 67.7MB in the end (delta: 27.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 103, overapproximation of someBinaryFLOATComparisonOperation at line 113, overapproximation of someBinaryFLOATComparisonOperation at line 105, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 64, overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 113. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 0; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 32; [L25] signed long int var_1_4 = -32; [L26] signed long int var_1_5 = 2; [L27] signed short int var_1_6 = -10; [L28] unsigned long int var_1_7 = 1; [L29] unsigned char var_1_8 = 0; [L30] unsigned long int var_1_9 = 3470417420; [L31] unsigned char var_1_10 = 0; [L32] double var_1_11 = 32.875; [L33] double var_1_12 = 25.6; [L34] double var_1_13 = 1.75; [L35] float var_1_14 = 5.4; [L36] float var_1_15 = 127.5; [L37] float var_1_16 = 3.5; [L38] signed long int var_1_17 = 64; [L39] unsigned char var_1_18 = 64; [L117] isInitial = 1 [L118] FCALL initially() [L119] COND TRUE 1 [L120] FCALL updateLastVariables() [L121] CALL updateVariables() [L80] var_1_2 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_3=32, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_3=32, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L81] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_3=32, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L82] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_3=32, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_3=32, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L82] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_3=32, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L83] var_1_3 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L84] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L85] CALL assume_abort_if_not(var_1_3 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L85] RET assume_abort_if_not(var_1_3 <= 255) VAL [isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-32, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L86] var_1_4 = __VERIFIER_nondet_long() [L87] CALL assume_abort_if_not(var_1_4 >= -1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L87] RET assume_abort_if_not(var_1_4 >= -1073741823) VAL [isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L88] CALL assume_abort_if_not(var_1_4 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L88] RET assume_abort_if_not(var_1_4 <= 1073741823) VAL [isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L89] var_1_9 = __VERIFIER_nondet_ulong() [L90] CALL assume_abort_if_not(var_1_9 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L90] RET assume_abort_if_not(var_1_9 >= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L91] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L91] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, var_1_10=0, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L92] var_1_10 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L93] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, var_1_10=1, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L94] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L94] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=263/8, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L95] var_1_11 = __VERIFIER_nondet_double() [L96] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L96] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L97] var_1_12 = __VERIFIER_nondet_double() [L98] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L98] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L99] CALL assume_abort_if_not(var_1_12 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L99] RET assume_abort_if_not(var_1_12 != 0.0F) VAL [isInitial=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L100] var_1_13 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L101] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L102] var_1_15 = __VERIFIER_nondet_float() [L103] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L103] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L104] var_1_16 = __VERIFIER_nondet_float() [L105] 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_10=1, var_1_14=27/5, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L105] 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_10=1, var_1_14=27/5, var_1_17=64, var_1_18=64, var_1_1=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L106] var_1_18 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L107] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L108] CALL assume_abort_if_not(var_1_18 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L108] RET assume_abort_if_not(var_1_18 <= 255) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L121] RET updateVariables() [L122] CALL step() [L43] COND TRUE var_1_2 > (- var_1_3) [L44] var_1_1 = ((((var_1_3) > ((var_1_2 + var_1_4))) ? (var_1_3) : ((var_1_2 + var_1_4)))) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_2=4, var_1_3=0, var_1_4=-1073741823, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L48] COND TRUE var_1_3 < var_1_2 [L49] var_1_5 = ((var_1_2 - var_1_3) + var_1_4) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_2=4, var_1_3=0, var_1_4=-1073741823, var_1_5=-1073741819, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L51] COND TRUE var_1_2 < (- var_1_5) [L52] var_1_6 = (32 - var_1_3) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_2=4, var_1_3=0, var_1_4=-1073741823, var_1_5=-1073741819, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L54] COND FALSE !(var_1_1 > var_1_3) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_2=4, var_1_3=0, var_1_4=-1073741823, var_1_5=-1073741819, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L59] COND TRUE (- 8u) >= (var_1_9 - var_1_2) [L60] var_1_8 = (! var_1_10) VAL [isInitial=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_1=0, var_1_2=4, var_1_3=0, var_1_4=-1073741823, var_1_5=-1073741819, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L64] COND FALSE !((var_1_12 * var_1_11) > var_1_13) [L71] var_1_14 = var_1_16 VAL [isInitial=1, var_1_10=1, var_1_14=3470417425, var_1_16=3470417425, var_1_17=64, var_1_1=0, var_1_2=4, var_1_3=0, var_1_4=-1073741823, var_1_5=-1073741819, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L73] COND TRUE ((var_1_11 + var_1_14) / 9.2) < ((((var_1_13) < (var_1_16)) ? (var_1_13) : (var_1_16))) [L74] var_1_17 = ((((var_1_2) > (var_1_18)) ? (var_1_2) : (var_1_18))) VAL [isInitial=1, var_1_10=1, var_1_14=3470417425, var_1_16=3470417425, var_1_17=4, var_1_18=4, var_1_1=0, var_1_2=4, var_1_3=0, var_1_4=-1073741823, var_1_5=-1073741819, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L122] RET step() [L123] CALL, EXPR property() [L113-L114] return (((((((var_1_2 > (- var_1_3)) ? (var_1_1 == ((signed long int) ((((var_1_3) > ((var_1_2 + var_1_4))) ? (var_1_3) : ((var_1_2 + var_1_4)))))) : (var_1_1 == ((signed long int) (((((1 - var_1_2)) < (16)) ? ((1 - var_1_2)) : (16)))))) && ((var_1_3 < var_1_2) ? (var_1_5 == ((signed long int) ((var_1_2 - var_1_3) + var_1_4))) : 1)) && ((var_1_2 < (- var_1_5)) ? (var_1_6 == ((signed short int) (32 - var_1_3))) : 1)) && ((var_1_1 > var_1_3) ? ((var_1_4 <= var_1_6) ? (var_1_7 == ((unsigned long int) ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))) : 1) : 1)) && (((- 8u) >= (var_1_9 - var_1_2)) ? (var_1_8 == ((unsigned char) (! var_1_10))) : (var_1_8 == ((unsigned char) (((var_1_11 / var_1_12) >= var_1_13) || var_1_10))))) && (((var_1_12 * var_1_11) > var_1_13) ? ((var_1_9 < var_1_5) ? (var_1_14 == ((float) var_1_15)) : (var_1_14 == ((float) var_1_15))) : (var_1_14 == ((float) var_1_16)))) && ((((var_1_11 + var_1_14) / 9.2) < ((((var_1_13) < (var_1_16)) ? (var_1_13) : (var_1_16)))) ? (var_1_17 == ((signed long int) ((((var_1_2) > (var_1_18)) ? (var_1_2) : (var_1_18))))) : (var_1_17 == ((signed long int) var_1_4))) ; [L123] RET, EXPR property() [L123] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_14=3470417425, var_1_16=3470417425, var_1_17=4, var_1_18=4, var_1_1=0, var_1_2=4, var_1_3=0, var_1_4=-1073741823, var_1_5=-1073741819, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=-1073741819] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_14=3470417425, var_1_16=3470417425, var_1_17=4, var_1_18=4, var_1_1=0, var_1_2=4, var_1_3=0, var_1_4=-1073741823, var_1_5=-1073741819, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=-1073741819] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 97 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 75 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 75 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 339 NumberOfCodeBlocks, 339 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 224 ConstructedInterpolants, 0 QuantifiedInterpolants, 224 SizeOfPredicates, 0 NumberOfNonLiveVariables, 266 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1190/1224 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:04:00,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/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_codestructure_normal_file-0.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 75183837198a67904a3a61f480ace7d79976c5c6c2ed857798c72fba443adac4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:04:02,656 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:04:02,732 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 23:04:02,740 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:04:02,740 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:04:02,758 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:04:02,759 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:04:02,759 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:04:02,759 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:04:02,759 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:04:02,759 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:04:02,759 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:04:02,760 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:04:02,760 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:04:02,760 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:04:02,760 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:04:02,760 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:04:02,760 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:04:02,760 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:04:02,760 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:04:02,760 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:04:02,761 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:04:02,761 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:04:02,761 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 23:04:02,761 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 23:04:02,761 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 23:04:02,761 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:04:02,761 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:04:02,761 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:04:02,761 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:04:02,761 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:04:02,761 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:04:02,761 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:04:02,762 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:04:02,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:04:02,762 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:04:02,762 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:04:02,762 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:04:02,762 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:04:02,762 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 23:04:02,762 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 23:04:02,762 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:04:02,762 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:04:02,762 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:04:02,763 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:04:02,763 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 -> 75183837198a67904a3a61f480ace7d79976c5c6c2ed857798c72fba443adac4 [2025-03-16 23:04:02,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:04:03,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:04:03,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:04:03,007 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:04:03,007 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:04:03,008 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-0.i [2025-03-16 23:04:04,108 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57e4f888a/8f123aba9b7845b0a94df442737b7fe7/FLAG7682e1a2d [2025-03-16 23:04:04,317 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:04:04,317 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-0.i [2025-03-16 23:04:04,322 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57e4f888a/8f123aba9b7845b0a94df442737b7fe7/FLAG7682e1a2d [2025-03-16 23:04:04,332 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57e4f888a/8f123aba9b7845b0a94df442737b7fe7 [2025-03-16 23:04:04,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:04:04,335 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:04:04,336 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:04:04,336 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:04:04,339 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:04:04,339 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:04:04" (1/1) ... [2025-03-16 23:04:04,340 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cf7fe65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:04:04, skipping insertion in model container [2025-03-16 23:04:04,340 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:04:04" (1/1) ... [2025-03-16 23:04:04,352 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:04:04,439 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_codestructure_normal_file-0.i[912,925] [2025-03-16 23:04:04,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:04:04,489 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:04:04,497 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_codestructure_normal_file-0.i[912,925] [2025-03-16 23:04:04,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:04:04,527 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:04:04,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:04:04 WrapperNode [2025-03-16 23:04:04,528 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:04:04,529 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:04:04,529 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:04:04,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:04:04,533 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:04:04" (1/1) ... [2025-03-16 23:04:04,539 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:04:04" (1/1) ... [2025-03-16 23:04:04,552 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2025-03-16 23:04:04,553 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:04:04,553 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:04:04,553 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:04:04,554 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:04:04,560 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:04:04" (1/1) ... [2025-03-16 23:04:04,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:04:04" (1/1) ... [2025-03-16 23:04:04,562 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:04:04" (1/1) ... [2025-03-16 23:04:04,582 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:04:04,583 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:04:04" (1/1) ... [2025-03-16 23:04:04,583 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:04:04" (1/1) ... [2025-03-16 23:04:04,588 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:04:04" (1/1) ... [2025-03-16 23:04:04,589 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:04:04" (1/1) ... [2025-03-16 23:04:04,590 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:04:04" (1/1) ... [2025-03-16 23:04:04,591 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:04:04" (1/1) ... [2025-03-16 23:04:04,593 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:04:04,594 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:04:04,594 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:04:04,594 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:04:04,595 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:04:04" (1/1) ... [2025-03-16 23:04:04,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:04:04,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:04:04,623 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:04:04,628 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:04:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:04:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 23:04:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:04:04,645 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:04:04,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:04:04,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:04:04,708 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:04:04,710 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:04:28,558 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-16 23:04:28,559 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:04:28,565 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:04:28,565 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:04:28,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:04:28 BoogieIcfgContainer [2025-03-16 23:04:28,566 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:04:28,567 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:04:28,567 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:04:28,570 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:04:28,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:04:04" (1/3) ... [2025-03-16 23:04:28,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@330b30f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:04:28, skipping insertion in model container [2025-03-16 23:04:28,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:04:04" (2/3) ... [2025-03-16 23:04:28,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@330b30f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:04:28, skipping insertion in model container [2025-03-16 23:04:28,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:04:28" (3/3) ... [2025-03-16 23:04:28,572 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-0.i [2025-03-16 23:04:28,582 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:04:28,583 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-0.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:04:28,623 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:04:28,630 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;@1626f817, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:04:28,631 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:04:28,633 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 31 states have internal predecessors, (43), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-16 23:04:28,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 23:04:28,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:04:28,640 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:28,640 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:04:28,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:04:28,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1803720462, now seen corresponding path program 1 times [2025-03-16 23:04:28,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:04:28,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [723241139] [2025-03-16 23:04:28,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:04:28,651 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:04:28,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:04:28,653 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:04:28,656 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:04:28,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 23:04:30,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 23:04:30,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:04:30,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:04:30,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:04:30,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:04:30,208 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-03-16 23:04:30,208 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:04:30,209 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:04:30,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [723241139] [2025-03-16 23:04:30,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [723241139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:04:30,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:04:30,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 23:04:30,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300860207] [2025-03-16 23:04:30,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:04:30,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:04:30,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:04:30,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:04:30,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:04:30,225 INFO L87 Difference]: Start difference. First operand has 51 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 31 states have internal predecessors, (43), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-16 23:04:30,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:04:30,241 INFO L93 Difference]: Finished difference Result 99 states and 174 transitions. [2025-03-16 23:04:30,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:04:30,242 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 113 [2025-03-16 23:04:30,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:04:30,246 INFO L225 Difference]: With dead ends: 99 [2025-03-16 23:04:30,246 INFO L226 Difference]: Without dead ends: 49 [2025-03-16 23:04:30,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 112 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:04:30,249 INFO L435 NwaCegarLoop]: 75 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, 75 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:04:30,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:04:30,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-16 23:04:30,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-16 23:04:30,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 states have internal predecessors, (39), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-16 23:04:30,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 75 transitions. [2025-03-16 23:04:30,277 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 75 transitions. Word has length 113 [2025-03-16 23:04:30,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:04:30,278 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 75 transitions. [2025-03-16 23:04:30,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-16 23:04:30,278 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 75 transitions. [2025-03-16 23:04:30,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 23:04:30,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:04:30,280 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:30,311 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:04:30,480 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:04:30,481 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:04:30,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:04:30,482 INFO L85 PathProgramCache]: Analyzing trace with hash -830458416, now seen corresponding path program 1 times [2025-03-16 23:04:30,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:04:30,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1946745679] [2025-03-16 23:04:30,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:04:30,482 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:04:30,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:04:30,484 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:04:30,486 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:04:30,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 23:04:32,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 23:04:32,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:04:32,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:04:32,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-16 23:04:32,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:05:31,199 WARN L286 SmtUtils]: Spent 7.33s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)