./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-49.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_floatingpointinfluence_no-floats_file-49.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 fbb94f92326360d1b49e2127744a54ce104befba5614aa9d887afe6ba1b1edd0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:36:26,493 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:36:26,540 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:36:26,543 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:36:26,546 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:36:26,568 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:36:26,569 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:36:26,569 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:36:26,569 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:36:26,569 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:36:26,570 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:36:26,570 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:36:26,570 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:36:26,570 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:36:26,570 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:36:26,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:36:26,571 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:36:26,571 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:36:26,572 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:36:26,572 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:36:26,572 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:36:26,572 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:36:26,572 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:36:26,572 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:36:26,572 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:36:26,572 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:36:26,572 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:36:26,572 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:36:26,572 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:36:26,572 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:36:26,572 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:36:26,573 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:36:26,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:36:26,573 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:36:26,573 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:36:26,573 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:36:26,573 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:36:26,573 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:36:26,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:36:26,573 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:36:26,573 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:36:26,573 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:36:26,573 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:36:26,573 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 -> fbb94f92326360d1b49e2127744a54ce104befba5614aa9d887afe6ba1b1edd0 [2025-03-03 22:36:26,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:36:26,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:36:26,822 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:36:26,823 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:36:26,823 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:36:26,824 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-49.i [2025-03-03 22:36:28,047 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a8ff4ca1/864a09630012452c881a189d4d213ca6/FLAG1fb8394d4 [2025-03-03 22:36:28,295 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:36:28,297 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-49.i [2025-03-03 22:36:28,306 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a8ff4ca1/864a09630012452c881a189d4d213ca6/FLAG1fb8394d4 [2025-03-03 22:36:28,318 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a8ff4ca1/864a09630012452c881a189d4d213ca6 [2025-03-03 22:36:28,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:36:28,321 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:36:28,322 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:36:28,322 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:36:28,324 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:36:28,325 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:36:28" (1/1) ... [2025-03-03 22:36:28,327 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f2962fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:28, skipping insertion in model container [2025-03-03 22:36:28,327 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:36:28" (1/1) ... [2025-03-03 22:36:28,342 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:36:28,433 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_floatingpointinfluence_no-floats_file-49.i[916,929] [2025-03-03 22:36:28,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:36:28,483 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:36:28,492 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_floatingpointinfluence_no-floats_file-49.i[916,929] [2025-03-03 22:36:28,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:36:28,525 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:36:28,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:28 WrapperNode [2025-03-03 22:36:28,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:36:28,526 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:36:28,526 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:36:28,526 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:36:28,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:28" (1/1) ... [2025-03-03 22:36:28,540 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:28" (1/1) ... [2025-03-03 22:36:28,576 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2025-03-03 22:36:28,577 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:36:28,577 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:36:28,577 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:36:28,577 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:36:28,586 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:28" (1/1) ... [2025-03-03 22:36:28,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:28" (1/1) ... [2025-03-03 22:36:28,589 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:28" (1/1) ... [2025-03-03 22:36:28,603 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-03 22:36:28,603 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:28" (1/1) ... [2025-03-03 22:36:28,604 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:28" (1/1) ... [2025-03-03 22:36:28,609 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:28" (1/1) ... [2025-03-03 22:36:28,615 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:28" (1/1) ... [2025-03-03 22:36:28,616 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:28" (1/1) ... [2025-03-03 22:36:28,617 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:28" (1/1) ... [2025-03-03 22:36:28,619 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:36:28,619 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:36:28,619 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:36:28,620 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:36:28,620 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:28" (1/1) ... [2025-03-03 22:36:28,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:36:28,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:36:28,646 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-03 22:36:28,651 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-03 22:36:28,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:36:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:36:28,666 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:36:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:36:28,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:36:28,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:36:28,714 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:36:28,715 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:36:28,912 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L93: havoc property_#t~bitwise13#1;havoc property_#t~short14#1; [2025-03-03 22:36:28,930 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-03 22:36:28,931 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:36:28,941 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:36:28,941 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:36:28,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:36:28 BoogieIcfgContainer [2025-03-03 22:36:28,942 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:36:28,943 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:36:28,944 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:36:28,947 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:36:28,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:36:28" (1/3) ... [2025-03-03 22:36:28,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1453ea4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:36:28, skipping insertion in model container [2025-03-03 22:36:28,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:28" (2/3) ... [2025-03-03 22:36:28,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1453ea4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:36:28, skipping insertion in model container [2025-03-03 22:36:28,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:36:28" (3/3) ... [2025-03-03 22:36:28,949 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-49.i [2025-03-03 22:36:28,963 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:36:28,965 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-49.i that has 2 procedures, 55 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:36:29,010 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:36:29,021 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;@7c6979e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:36:29,021 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:36:29,024 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 37 states have internal predecessors, (49), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 22:36:29,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 22:36:29,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:36:29,033 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:36:29,034 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:36:29,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:36:29,039 INFO L85 PathProgramCache]: Analyzing trace with hash 825362311, now seen corresponding path program 1 times [2025-03-03 22:36:29,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:36:29,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110005568] [2025-03-03 22:36:29,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:36:29,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:36:29,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 22:36:29,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 22:36:29,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:36:29,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:36:29,248 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-03 22:36:29,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:36:29,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110005568] [2025-03-03 22:36:29,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110005568] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:36:29,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890271586] [2025-03-03 22:36:29,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:36:29,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:36:29,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:36:29,252 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-03 22:36:29,254 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-03 22:36:29,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 22:36:29,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 22:36:29,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:36:29,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:36:29,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:36:29,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:36:29,390 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-03 22:36:29,392 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:36:29,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890271586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:36:29,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:36:29,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:36:29,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693486174] [2025-03-03 22:36:29,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:36:29,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:36:29,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:36:29,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:36:29,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:36:29,412 INFO L87 Difference]: Start difference. First operand has 55 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 37 states have internal predecessors, (49), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 22:36:29,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:36:29,431 INFO L93 Difference]: Finished difference Result 104 states and 173 transitions. [2025-03-03 22:36:29,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:36:29,432 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 103 [2025-03-03 22:36:29,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:36:29,436 INFO L225 Difference]: With dead ends: 104 [2025-03-03 22:36:29,436 INFO L226 Difference]: Without dead ends: 52 [2025-03-03 22:36:29,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 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-03 22:36:29,440 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:36:29,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:36:29,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-03 22:36:29,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-03 22:36:29,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 22:36:29,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2025-03-03 22:36:29,464 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 103 [2025-03-03 22:36:29,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:36:29,465 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2025-03-03 22:36:29,465 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 22:36:29,465 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2025-03-03 22:36:29,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 22:36:29,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:36:29,468 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:36:29,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 22:36:29,669 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-03 22:36:29,669 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:36:29,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:36:29,670 INFO L85 PathProgramCache]: Analyzing trace with hash -762013817, now seen corresponding path program 1 times [2025-03-03 22:36:29,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:36:29,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511853078] [2025-03-03 22:36:29,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:36:29,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:36:29,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 22:36:29,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 22:36:29,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:36:29,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:36:30,033 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-03 22:36:30,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:36:30,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511853078] [2025-03-03 22:36:30,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511853078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:36:30,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:36:30,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 22:36:30,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092650767] [2025-03-03 22:36:30,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:36:30,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:36:30,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:36:30,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:36:30,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:36:30,035 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 22:36:30,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:36:30,197 INFO L93 Difference]: Finished difference Result 109 states and 156 transitions. [2025-03-03 22:36:30,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 22:36:30,198 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2025-03-03 22:36:30,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:36:30,200 INFO L225 Difference]: With dead ends: 109 [2025-03-03 22:36:30,201 INFO L226 Difference]: Without dead ends: 60 [2025-03-03 22:36:30,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 22:36:30,202 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 54 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:36:30,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 123 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:36:30,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-03 22:36:30,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2025-03-03 22:36:30,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 22:36:30,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 78 transitions. [2025-03-03 22:36:30,216 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 78 transitions. Word has length 103 [2025-03-03 22:36:30,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:36:30,216 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 78 transitions. [2025-03-03 22:36:30,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 22:36:30,217 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 78 transitions. [2025-03-03 22:36:30,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 22:36:30,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:36:30,218 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:36:30,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 22:36:30,218 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:36:30,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:36:30,219 INFO L85 PathProgramCache]: Analyzing trace with hash -971747771, now seen corresponding path program 1 times [2025-03-03 22:36:30,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:36:30,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017898890] [2025-03-03 22:36:30,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:36:30,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:36:30,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 22:36:30,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 22:36:30,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:36:30,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:36:30,307 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 22:36:30,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 22:36:30,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 22:36:30,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:36:30,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:36:30,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 22:36:30,378 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 22:36:30,379 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 22:36:30,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 22:36:30,382 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-03 22:36:30,439 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 22:36:30,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:36:30 BoogieIcfgContainer [2025-03-03 22:36:30,443 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 22:36:30,444 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 22:36:30,444 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 22:36:30,444 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 22:36:30,445 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:36:28" (3/4) ... [2025-03-03 22:36:30,446 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 22:36:30,447 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 22:36:30,448 INFO L158 Benchmark]: Toolchain (without parser) took 2126.98ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 84.8MB in the end (delta: 21.2MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. [2025-03-03 22:36:30,448 INFO L158 Benchmark]: CDTParser took 1.04ms. Allocated memory is still 201.3MB. Free memory is still 115.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:36:30,449 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.02ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 92.5MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:36:30,449 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.74ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 89.0MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:36:30,449 INFO L158 Benchmark]: Boogie Preprocessor took 41.57ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 81.8MB in the end (delta: 7.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:36:30,450 INFO L158 Benchmark]: IcfgBuilder took 322.28ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 61.0MB in the end (delta: 20.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:36:30,450 INFO L158 Benchmark]: TraceAbstraction took 1499.77ms. Allocated memory is still 142.6MB. Free memory was 60.3MB in the beginning and 85.7MB in the end (delta: -25.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:36:30,450 INFO L158 Benchmark]: Witness Printer took 3.26ms. Allocated memory is still 142.6MB. Free memory was 85.7MB in the beginning and 84.8MB in the end (delta: 890.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:36:30,451 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.04ms. Allocated memory is still 201.3MB. Free memory is still 115.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 204.02ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 92.5MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.74ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 89.0MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.57ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 81.8MB in the end (delta: 7.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 322.28ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 61.0MB in the end (delta: 20.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1499.77ms. Allocated memory is still 142.6MB. Free memory was 60.3MB in the beginning and 85.7MB in the end (delta: -25.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.26ms. Allocated memory is still 142.6MB. Free memory was 85.7MB in the beginning and 84.8MB in the end (delta: 890.6kB). 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 93, overapproximation of someBinaryFLOATComparisonOperation at line 50. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 4; [L23] signed long int var_1_2 = 1000000000; [L24] signed long int var_1_3 = 1000; [L25] unsigned short int var_1_4 = 256; [L26] unsigned short int var_1_5 = 4; [L27] unsigned short int var_1_6 = 10; [L28] signed short int var_1_8 = 128; [L29] signed short int var_1_9 = -2; [L30] unsigned char var_1_10 = 0; [L31] unsigned char var_1_11 = 0; [L32] unsigned char var_1_12 = 0; [L33] unsigned char var_1_13 = 1; VAL [isInitial=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=1000000000, var_1_3=1000, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L97] isInitial = 1 [L98] FCALL initially() [L99] COND TRUE 1 [L100] FCALL updateLastVariables() [L101] CALL updateVariables() [L65] var_1_2 = __VERIFIER_nondet_long() [L66] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=1000, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=1000, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L66] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=1000, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L67] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=1000, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=1000, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L67] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=1000, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L68] var_1_3 = __VERIFIER_nondet_long() [L69] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L69] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L70] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L70] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L71] var_1_4 = __VERIFIER_nondet_ushort() [L72] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L72] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L73] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L73] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L74] var_1_5 = __VERIFIER_nondet_ushort() [L75] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=10, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=10, var_1_8=128, var_1_9=-2] [L75] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=10, var_1_8=128, var_1_9=-2] [L76] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=10, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=10, var_1_8=128, var_1_9=-2] [L76] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=10, var_1_8=128, var_1_9=-2] [L77] var_1_6 = __VERIFIER_nondet_ushort() [L78] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_8=128, var_1_9=-2] [L78] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_8=128, var_1_9=-2] [L79] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=128, var_1_9=-2] [L79] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=128, var_1_9=-2] [L80] var_1_9 = __VERIFIER_nondet_short() [L81] CALL assume_abort_if_not(var_1_9 >= -32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=128, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=128, var_1_9=49] [L81] RET assume_abort_if_not(var_1_9 >= -32766) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=128, var_1_9=49] [L82] CALL assume_abort_if_not(var_1_9 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=128, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=128, var_1_9=49] [L82] RET assume_abort_if_not(var_1_9 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=128, var_1_9=49] [L83] var_1_11 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=128, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=128, var_1_9=49] [L84] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=128, var_1_9=49] [L85] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=128, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=128, var_1_9=49] [L85] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=128, var_1_9=49] [L86] var_1_12 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=128, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=128, var_1_9=49] [L87] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=128, var_1_9=49] [L88] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=128, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=128, var_1_9=49] [L88] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=128, var_1_9=49] [L101] RET updateVariables() [L102] CALL step() [L37] var_1_8 = ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=49, var_1_9=49] [L38] EXPR 50 >> var_1_4 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=49, var_1_9=49] [L38] COND FALSE !((50 >> var_1_4) <= var_1_8) [L41] var_1_10 = (! var_1_11) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=49, var_1_9=49] [L43] COND TRUE ! var_1_12 VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=49, var_1_9=49] [L44] COND TRUE var_1_4 >= ((((var_1_6) < (var_1_8)) ? (var_1_6) : (var_1_8))) [L45] var_1_13 = (var_1_10 && var_1_11) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=49, var_1_9=49] [L50] COND FALSE !(var_1_2 >= 64.5f) [L61] var_1_1 = 50 VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_1=50, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=49, var_1_9=49] [L102] RET step() [L103] CALL, EXPR property() [L93] EXPR (((var_1_2 >= 64.5f) ? ((var_1_2 >= var_1_3) ? (var_1_1 == ((unsigned short int) (((((((var_1_4) > (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_4) : (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))) < 0 ) ? -((((var_1_4) > (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_4) : (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))) : ((((var_1_4) > (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_4) : (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))))))) : (var_1_13 ? (var_1_1 == ((unsigned short int) var_1_5)) : (var_1_1 == ((unsigned short int) var_1_6)))) : (var_1_1 == ((unsigned short int) 50))) && (var_1_8 == ((signed short int) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))))) && (((50 >> var_1_4) <= var_1_8) ? (var_1_10 == ((unsigned char) ((! (! var_1_11)) || var_1_12))) : (var_1_10 == ((unsigned char) (! var_1_11)))) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_1=50, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=49, var_1_9=49] [L93-L94] return ((((var_1_2 >= 64.5f) ? ((var_1_2 >= var_1_3) ? (var_1_1 == ((unsigned short int) (((((((var_1_4) > (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_4) : (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))) < 0 ) ? -((((var_1_4) > (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_4) : (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))) : ((((var_1_4) > (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_4) : (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))))))) : (var_1_13 ? (var_1_1 == ((unsigned short int) var_1_5)) : (var_1_1 == ((unsigned short int) var_1_6)))) : (var_1_1 == ((unsigned short int) 50))) && (var_1_8 == ((signed short int) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))))) && (((50 >> var_1_4) <= var_1_8) ? (var_1_10 == ((unsigned char) ((! (! var_1_11)) || var_1_12))) : (var_1_10 == ((unsigned char) (! var_1_11))))) && ((! var_1_12) ? ((var_1_4 >= ((((var_1_6) < (var_1_8)) ? (var_1_6) : (var_1_8)))) ? (var_1_13 == ((unsigned char) (var_1_10 && var_1_11))) : (var_1_13 == ((unsigned char) var_1_11))) : 1) ; [L103] RET, EXPR property() [L103] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_1=50, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=49, var_1_9=49] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_1=50, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=49, var_1_9=49] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 3, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 68 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 54 mSDsluCounter, 197 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 106 IncrementalHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 126 mSDtfsCounter, 106 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=2, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 306 ConstructedInterpolants, 0 QuantifiedInterpolants, 330 SizeOfPredicates, 0 NumberOfNonLiveVariables, 234 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 1410/1440 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-03 22:36:30,468 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_floatingpointinfluence_no-floats_file-49.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 fbb94f92326360d1b49e2127744a54ce104befba5614aa9d887afe6ba1b1edd0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:36:32,229 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:36:32,301 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 22:36:32,309 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:36:32,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:36:32,333 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:36:32,334 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:36:32,334 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:36:32,334 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:36:32,334 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:36:32,335 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:36:32,335 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:36:32,335 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:36:32,335 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:36:32,336 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:36:32,336 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:36:32,336 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:36:32,336 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:36:32,336 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:36:32,336 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:36:32,336 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:36:32,336 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:36:32,337 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:36:32,337 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 22:36:32,337 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 22:36:32,337 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 22:36:32,337 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:36:32,337 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:36:32,337 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:36:32,337 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:36:32,337 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:36:32,337 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:36:32,337 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:36:32,338 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:36:32,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:36:32,338 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:36:32,338 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:36:32,338 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:36:32,338 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:36:32,338 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 22:36:32,339 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 22:36:32,339 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:36:32,339 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:36:32,339 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:36:32,339 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:36:32,339 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 -> fbb94f92326360d1b49e2127744a54ce104befba5614aa9d887afe6ba1b1edd0 [2025-03-03 22:36:32,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:36:32,575 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:36:32,577 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:36:32,578 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:36:32,578 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:36:32,578 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-49.i [2025-03-03 22:36:33,755 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19811302a/6a562f9e35204a5c8262adcad3be71a3/FLAG2c0b0e8a3 [2025-03-03 22:36:33,976 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:36:33,980 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-49.i [2025-03-03 22:36:33,989 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19811302a/6a562f9e35204a5c8262adcad3be71a3/FLAG2c0b0e8a3 [2025-03-03 22:36:34,318 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19811302a/6a562f9e35204a5c8262adcad3be71a3 [2025-03-03 22:36:34,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:36:34,321 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:36:34,322 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:36:34,322 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:36:34,324 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:36:34,325 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:36:34" (1/1) ... [2025-03-03 22:36:34,326 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27dbe86c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:34, skipping insertion in model container [2025-03-03 22:36:34,326 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:36:34" (1/1) ... [2025-03-03 22:36:34,336 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:36:34,433 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_floatingpointinfluence_no-floats_file-49.i[916,929] [2025-03-03 22:36:34,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:36:34,492 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:36:34,501 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_floatingpointinfluence_no-floats_file-49.i[916,929] [2025-03-03 22:36:34,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:36:34,539 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:36:34,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:34 WrapperNode [2025-03-03 22:36:34,541 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:36:34,541 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:36:34,542 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:36:34,542 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:36:34,547 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:34" (1/1) ... [2025-03-03 22:36:34,556 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:34" (1/1) ... [2025-03-03 22:36:34,575 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 98 [2025-03-03 22:36:34,575 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:36:34,576 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:36:34,576 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:36:34,576 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:36:34,581 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:34" (1/1) ... [2025-03-03 22:36:34,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:34" (1/1) ... [2025-03-03 22:36:34,583 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:34" (1/1) ... [2025-03-03 22:36:34,594 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-03 22:36:34,595 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:34" (1/1) ... [2025-03-03 22:36:34,595 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:34" (1/1) ... [2025-03-03 22:36:34,601 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:34" (1/1) ... [2025-03-03 22:36:34,604 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:34" (1/1) ... [2025-03-03 22:36:34,605 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:34" (1/1) ... [2025-03-03 22:36:34,606 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:34" (1/1) ... [2025-03-03 22:36:34,608 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:36:34,608 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:36:34,608 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:36:34,608 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:36:34,609 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:34" (1/1) ... [2025-03-03 22:36:34,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:36:34,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:36:34,636 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-03 22:36:34,642 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-03 22:36:34,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:36:34,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 22:36:34,657 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:36:34,658 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:36:34,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:36:34,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:36:34,714 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:36:34,716 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:36:35,079 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-03 22:36:35,079 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:36:35,085 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:36:35,085 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:36:35,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:36:35 BoogieIcfgContainer [2025-03-03 22:36:35,086 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:36:35,088 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:36:35,088 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:36:35,091 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:36:35,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:36:34" (1/3) ... [2025-03-03 22:36:35,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f7e13b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:36:35, skipping insertion in model container [2025-03-03 22:36:35,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:34" (2/3) ... [2025-03-03 22:36:35,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f7e13b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:36:35, skipping insertion in model container [2025-03-03 22:36:35,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:36:35" (3/3) ... [2025-03-03 22:36:35,093 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-49.i [2025-03-03 22:36:35,102 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:36:35,104 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-49.i that has 2 procedures, 48 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:36:35,143 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:36:35,162 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;@25f72b81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:36:35,162 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:36:35,165 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 22:36:35,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 22:36:35,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:36:35,173 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:36:35,173 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:36:35,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:36:35,176 INFO L85 PathProgramCache]: Analyzing trace with hash 580311497, now seen corresponding path program 1 times [2025-03-03 22:36:35,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:36:35,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1707704141] [2025-03-03 22:36:35,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:36:35,184 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-03 22:36:35,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:36:35,189 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-03 22:36:35,190 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-03 22:36:35,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 22:36:35,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 22:36:35,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:36:35,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:36:35,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:36:35,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:36:35,337 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-03-03 22:36:35,338 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:36:35,338 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:36:35,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1707704141] [2025-03-03 22:36:35,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1707704141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:36:35,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:36:35,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 22:36:35,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374970164] [2025-03-03 22:36:35,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:36:35,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:36:35,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:36:35,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:36:35,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:36:35,355 INFO L87 Difference]: Start difference. First operand has 48 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 22:36:35,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:36:35,372 INFO L93 Difference]: Finished difference Result 90 states and 153 transitions. [2025-03-03 22:36:35,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:36:35,374 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 100 [2025-03-03 22:36:35,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:36:35,378 INFO L225 Difference]: With dead ends: 90 [2025-03-03 22:36:35,379 INFO L226 Difference]: Without dead ends: 45 [2025-03-03 22:36:35,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 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-03 22:36:35,385 INFO L435 NwaCegarLoop]: 66 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, 66 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-03 22:36:35,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:36:35,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-03 22:36:35,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-03 22:36:35,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 22:36:35,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 66 transitions. [2025-03-03 22:36:35,415 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 66 transitions. Word has length 100 [2025-03-03 22:36:35,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:36:35,416 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 66 transitions. [2025-03-03 22:36:35,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 22:36:35,416 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 66 transitions. [2025-03-03 22:36:35,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 22:36:35,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:36:35,420 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:36:35,427 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-03-03 22:36:35,621 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-03 22:36:35,621 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:36:35,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:36:35,622 INFO L85 PathProgramCache]: Analyzing trace with hash -289519159, now seen corresponding path program 1 times [2025-03-03 22:36:35,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:36:35,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1444762675] [2025-03-03 22:36:35,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:36:35,622 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-03 22:36:35,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:36:35,625 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-03 22:36:35,626 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-03 22:36:35,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 22:36:35,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 22:36:35,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:36:35,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:36:35,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 22:36:35,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:36:35,829 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-03 22:36:35,829 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:36:35,829 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:36:35,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1444762675] [2025-03-03 22:36:35,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1444762675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:36:35,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:36:35,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 22:36:35,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705425803] [2025-03-03 22:36:35,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:36:35,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:36:35,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:36:35,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:36:35,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:36:35,831 INFO L87 Difference]: Start difference. First operand 45 states and 66 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 22:36:36,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:36:36,072 INFO L93 Difference]: Finished difference Result 95 states and 136 transitions. [2025-03-03 22:36:36,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 22:36:36,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 100 [2025-03-03 22:36:36,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:36:36,078 INFO L225 Difference]: With dead ends: 95 [2025-03-03 22:36:36,078 INFO L226 Difference]: Without dead ends: 53 [2025-03-03 22:36:36,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 22:36:36,079 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 47 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:36:36,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 100 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:36:36,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-03 22:36:36,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2025-03-03 22:36:36,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 22:36:36,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 68 transitions. [2025-03-03 22:36:36,104 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 68 transitions. Word has length 100 [2025-03-03 22:36:36,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:36:36,105 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 68 transitions. [2025-03-03 22:36:36,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 22:36:36,105 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 68 transitions. [2025-03-03 22:36:36,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 22:36:36,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:36:36,106 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:36:36,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 22:36:36,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 22:36:36,307 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:36:36,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:36:36,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1210725570, now seen corresponding path program 1 times [2025-03-03 22:36:36,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:36:36,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1335185172] [2025-03-03 22:36:36,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:36:36,310 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-03 22:36:36,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:36:36,313 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 22:36:36,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 22:36:36,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 22:36:36,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 22:36:36,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:36:36,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:36:36,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 22:36:36,391 INFO L279 TraceCheckSpWp]: Computing forward predicates...