./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-96.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_variablewrapping_normal_file-96.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 6d7425f39e4b5fbb927434634ac2d6821a470a923e73c3da4e09488baff8f9ad --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:00:50,622 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:00:50,688 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:00:50,695 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:00:50,695 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:00:50,719 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:00:50,720 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:00:50,720 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:00:50,720 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:00:50,721 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:00:50,721 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:00:50,721 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:00:50,722 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:00:50,722 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:00:50,722 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:00:50,722 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:00:50,722 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:00:50,723 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:00:50,723 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:00:50,723 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:00:50,723 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:00:50,723 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:00:50,723 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:00:50,723 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:00:50,723 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:00:50,723 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:00:50,723 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:00:50,723 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:00:50,723 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:00:50,724 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:00:50,724 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:00:50,724 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:00:50,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:00:50,724 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:00:50,724 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:00:50,725 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:00:50,725 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:00:50,725 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:00:50,725 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:00:50,725 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:00:50,725 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:00:50,725 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:00:50,725 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:00:50,725 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 -> 6d7425f39e4b5fbb927434634ac2d6821a470a923e73c3da4e09488baff8f9ad [2025-03-04 01:00:50,965 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:00:50,972 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:00:50,974 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:00:50,974 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:00:50,975 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:00:50,976 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-96.i [2025-03-04 01:00:52,120 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/827b90a85/ccc180adcab2441987e57f496330d9d8/FLAG9c44d4764 [2025-03-04 01:00:52,371 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:00:52,371 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-96.i [2025-03-04 01:00:52,377 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/827b90a85/ccc180adcab2441987e57f496330d9d8/FLAG9c44d4764 [2025-03-04 01:00:52,700 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/827b90a85/ccc180adcab2441987e57f496330d9d8 [2025-03-04 01:00:52,702 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:00:52,703 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:00:52,704 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:00:52,704 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:00:52,708 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:00:52,708 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:00:52" (1/1) ... [2025-03-04 01:00:52,709 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@624a599c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:52, skipping insertion in model container [2025-03-04 01:00:52,709 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:00:52" (1/1) ... [2025-03-04 01:00:52,722 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:00:52,823 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_variablewrapping_normal_file-96.i[913,926] [2025-03-04 01:00:52,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:00:52,864 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:00:52,871 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_variablewrapping_normal_file-96.i[913,926] [2025-03-04 01:00:52,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:00:52,910 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:00:52,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:52 WrapperNode [2025-03-04 01:00:52,912 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:00:52,912 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:00:52,913 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:00:52,913 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:00:52,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:52" (1/1) ... [2025-03-04 01:00:52,924 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:52" (1/1) ... [2025-03-04 01:00:52,943 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2025-03-04 01:00:52,944 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:00:52,944 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:00:52,944 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:00:52,944 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:00:52,951 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:52" (1/1) ... [2025-03-04 01:00:52,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:52" (1/1) ... [2025-03-04 01:00:52,953 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:52" (1/1) ... [2025-03-04 01:00:52,964 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-04 01:00:52,964 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:52" (1/1) ... [2025-03-04 01:00:52,965 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:52" (1/1) ... [2025-03-04 01:00:52,971 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:52" (1/1) ... [2025-03-04 01:00:52,973 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:52" (1/1) ... [2025-03-04 01:00:52,974 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:52" (1/1) ... [2025-03-04 01:00:52,978 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:52" (1/1) ... [2025-03-04 01:00:52,980 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:00:52,981 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:00:52,981 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:00:52,981 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:00:52,982 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:52" (1/1) ... [2025-03-04 01:00:52,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:00:52,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:00:53,010 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-04 01:00:53,012 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-04 01:00:53,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:00:53,029 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:00:53,029 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:00:53,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:00:53,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:00:53,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:00:53,083 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:00:53,085 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:00:53,280 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-04 01:00:53,281 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:00:53,287 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:00:53,288 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:00:53,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:00:53 BoogieIcfgContainer [2025-03-04 01:00:53,288 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:00:53,290 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:00:53,290 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:00:53,293 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:00:53,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:00:52" (1/3) ... [2025-03-04 01:00:53,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66aa820f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:00:53, skipping insertion in model container [2025-03-04 01:00:53,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:52" (2/3) ... [2025-03-04 01:00:53,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66aa820f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:00:53, skipping insertion in model container [2025-03-04 01:00:53,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:00:53" (3/3) ... [2025-03-04 01:00:53,295 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-96.i [2025-03-04 01:00:53,306 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:00:53,307 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-96.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:00:53,350 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:00:53,363 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;@5a935b75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:00:53,363 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:00:53,367 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 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-04 01:00:53,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:00:53,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:00:53,375 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-04 01:00:53,376 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:00:53,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:00:53,381 INFO L85 PathProgramCache]: Analyzing trace with hash 659675438, now seen corresponding path program 1 times [2025-03-04 01:00:53,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:00:53,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428095121] [2025-03-04 01:00:53,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:00:53,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:00:53,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:00:53,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:00:53,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:00:53,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:00:53,582 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-04 01:00:53,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:00:53,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428095121] [2025-03-04 01:00:53,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428095121] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:00:53,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969712626] [2025-03-04 01:00:53,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:00:53,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:00:53,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:00:53,587 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-04 01:00:53,591 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-04 01:00:53,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:00:53,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:00:53,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:00:53,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:00:53,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:00:53,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:00:53,718 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-04 01:00:53,720 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:00:53,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969712626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:00:53,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:00:53,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:00:53,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724735737] [2025-03-04 01:00:53,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:00:53,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:00:53,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:00:53,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:00:53,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:00:53,743 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 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-04 01:00:53,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:00:53,759 INFO L93 Difference]: Finished difference Result 96 states and 159 transitions. [2025-03-04 01:00:53,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:00:53,760 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-04 01:00:53,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:00:53,764 INFO L225 Difference]: With dead ends: 96 [2025-03-04 01:00:53,764 INFO L226 Difference]: Without dead ends: 48 [2025-03-04 01:00:53,776 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-04 01:00:53,779 INFO L435 NwaCegarLoop]: 69 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, 69 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-04 01:00:53,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:00:53,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-04 01:00:53,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-04 01:00:53,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 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-04 01:00:53,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2025-03-04 01:00:53,810 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 69 transitions. Word has length 103 [2025-03-04 01:00:53,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:00:53,810 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 69 transitions. [2025-03-04 01:00:53,811 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-04 01:00:53,811 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 69 transitions. [2025-03-04 01:00:53,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:00:53,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:00:53,815 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-04 01:00:53,821 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-04 01:00:54,016 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-04 01:00:54,016 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:00:54,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:00:54,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1142057036, now seen corresponding path program 1 times [2025-03-04 01:00:54,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:00:54,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82079518] [2025-03-04 01:00:54,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:00:54,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:00:54,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:00:54,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:00:54,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:00:54,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:00:54,348 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:00:54,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:00:54,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82079518] [2025-03-04 01:00:54,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82079518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:00:54,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:00:54,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:00:54,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345625009] [2025-03-04 01:00:54,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:00:54,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:00:54,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:00:54,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:00:54,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:00:54,352 INFO L87 Difference]: Start difference. First operand 48 states and 69 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:00:54,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:00:54,474 INFO L93 Difference]: Finished difference Result 148 states and 213 transitions. [2025-03-04 01:00:54,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:00:54,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2025-03-04 01:00:54,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:00:54,479 INFO L225 Difference]: With dead ends: 148 [2025-03-04 01:00:54,480 INFO L226 Difference]: Without dead ends: 103 [2025-03-04 01:00:54,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:00:54,481 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 66 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:00:54,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 186 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:00:54,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-04 01:00:54,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 90. [2025-03-04 01:00:54,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 01:00:54,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 131 transitions. [2025-03-04 01:00:54,503 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 131 transitions. Word has length 103 [2025-03-04 01:00:54,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:00:54,504 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 131 transitions. [2025-03-04 01:00:54,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:00:54,504 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 131 transitions. [2025-03-04 01:00:54,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:00:54,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:00:54,505 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-04 01:00:54,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:00:54,506 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:00:54,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:00:54,506 INFO L85 PathProgramCache]: Analyzing trace with hash -665397427, now seen corresponding path program 1 times [2025-03-04 01:00:54,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:00:54,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262476459] [2025-03-04 01:00:54,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:00:54,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:00:54,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:00:54,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:00:54,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:00:54,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:00:54,587 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:00:54,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:00:54,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:00:54,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:00:54,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:00:54,696 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:00:54,696 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:00:54,697 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:00:54,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:00:54,701 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-04 01:00:54,756 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:00:54,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:00:54 BoogieIcfgContainer [2025-03-04 01:00:54,758 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:00:54,759 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:00:54,759 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:00:54,759 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:00:54,760 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:00:53" (3/4) ... [2025-03-04 01:00:54,761 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:00:54,762 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:00:54,763 INFO L158 Benchmark]: Toolchain (without parser) took 2059.21ms. Allocated memory is still 142.6MB. Free memory was 109.5MB in the beginning and 96.2MB in the end (delta: 13.3MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2025-03-04 01:00:54,763 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:00:54,763 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.43ms. Allocated memory is still 142.6MB. Free memory was 109.5MB in the beginning and 96.6MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:00:54,763 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.53ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 94.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:00:54,763 INFO L158 Benchmark]: Boogie Preprocessor took 35.70ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 90.8MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:00:54,764 INFO L158 Benchmark]: IcfgBuilder took 307.38ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 73.2MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:00:54,764 INFO L158 Benchmark]: TraceAbstraction took 1468.86ms. Allocated memory is still 142.6MB. Free memory was 73.2MB in the beginning and 96.7MB in the end (delta: -23.5MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2025-03-04 01:00:54,764 INFO L158 Benchmark]: Witness Printer took 2.95ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 96.2MB in the end (delta: 435.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:00:54,765 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.51ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 207.43ms. Allocated memory is still 142.6MB. Free memory was 109.5MB in the beginning and 96.6MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.53ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 94.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.70ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 90.8MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 307.38ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 73.2MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1468.86ms. Allocated memory is still 142.6MB. Free memory was 73.2MB in the beginning and 96.7MB in the end (delta: -23.5MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Witness Printer took 2.95ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 96.2MB in the end (delta: 435.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 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 87. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 8; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_3 = 8; [L25] unsigned short int var_1_4 = 1000; [L26] unsigned char var_1_5 = 1; [L27] unsigned char var_1_6 = 0; [L28] unsigned char var_1_9 = 0; [L29] unsigned char var_1_10 = 0; [L30] double var_1_11 = 4.575; [L31] double var_1_13 = 2.75; [L32] double var_1_14 = 128.5; [L33] signed long int var_1_15 = -1000000000; [L34] float var_1_16 = 99999.25; [L35] signed char var_1_17 = 1; [L36] signed char var_1_18 = 50; [L37] unsigned char last_1_var_1_5 = 1; VAL [isInitial=0, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L102] isInitial = 1 [L103] FCALL initially() [L104] COND TRUE 1 [L105] CALL updateLastVariables() [L95] last_1_var_1_5 = var_1_5 VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L105] RET updateLastVariables() [L106] CALL updateVariables() [L68] var_1_2 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L69] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L70] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L70] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L71] var_1_3 = __VERIFIER_nondet_ushort() [L72] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L72] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L73] CALL assume_abort_if_not(var_1_3 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L73] RET assume_abort_if_not(var_1_3 <= 65534) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L74] var_1_4 = __VERIFIER_nondet_ushort() [L75] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_5=1, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_5=1, var_1_6=0, var_1_9=0] [L75] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_5=1, var_1_6=0, var_1_9=0] [L76] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=0, var_1_9=0] [L76] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=0, var_1_9=0] [L77] var_1_6 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_9=0] [L78] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_9=0] [L79] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L79] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L80] var_1_9 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255] [L81] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255] [L82] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L82] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L83] var_1_10 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L84] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L85] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L85] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L86] var_1_13 = __VERIFIER_nondet_double() [L87] CALL assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L87] RET assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L88] var_1_14 = __VERIFIER_nondet_double() [L89] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L89] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L90] var_1_18 = __VERIFIER_nondet_char() [L91] CALL assume_abort_if_not(var_1_18 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=126, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=126, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L91] RET assume_abort_if_not(var_1_18 >= -127) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=126, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L92] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=126, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=126, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L92] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=126, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L106] RET updateVariables() [L107] CALL step() [L41] COND FALSE !(! last_1_var_1_5) [L44] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=126, var_1_1=65530, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L46] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_5=1, stepLocal_0=-255, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=126, var_1_1=65530, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L47] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_5=1, stepLocal_0=-255, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=126, var_1_1=65530, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L56] var_1_15 = var_1_1 [L57] var_1_16 = var_1_13 [L58] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_5=1, stepLocal_0=-255, var_1_10=1, var_1_11=183/40, var_1_13=100004, var_1_15=65530, var_1_16=100004, var_1_17=126, var_1_18=126, var_1_1=65530, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L59] COND FALSE !(((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))) > var_1_15) VAL [isInitial=1, last_1_var_1_5=1, stepLocal_0=-255, var_1_10=1, var_1_11=183/40, var_1_13=100004, var_1_15=65530, var_1_16=100004, var_1_17=126, var_1_18=126, var_1_1=65530, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L107] RET step() [L108] CALL, EXPR property() [L98-L99] return ((((((! last_1_var_1_5) ? (var_1_1 == ((unsigned short int) ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) : (var_1_1 == ((unsigned short int) var_1_4))) && (var_1_2 ? ((var_1_6 && ((var_1_3 >= 16) || last_1_var_1_5)) ? (var_1_6 ? (var_1_5 == ((unsigned char) ((var_1_1 < var_1_1) && var_1_9))) : (var_1_5 == ((unsigned char) var_1_10))) : 1) : 1)) && ((((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))) > var_1_15) ? (((var_1_15 / -5) >= ((var_1_4 + var_1_15) - ((((var_1_1) < (var_1_3)) ? (var_1_1) : (var_1_3))))) ? (var_1_11 == ((double) (var_1_13 + var_1_14))) : (var_1_11 == ((double) var_1_14))) : 1)) && (var_1_15 == ((signed long int) var_1_1))) && (var_1_16 == ((float) var_1_13))) && (var_1_17 == ((signed char) var_1_18)) ; VAL [\result=0, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=100004, var_1_15=65530, var_1_16=100004, var_1_17=126, var_1_18=126, var_1_1=65530, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=100004, var_1_15=65530, var_1_16=100004, var_1_17=126, var_1_18=126, var_1_1=65530, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=100004, var_1_15=65530, var_1_16=100004, var_1_17=126, var_1_18=126, var_1_1=65530, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 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, 66 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 66 mSDsluCounter, 255 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 122 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15 IncrementalHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 133 mSDtfsCounter, 15 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=2, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 13 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 412 NumberOfCodeBlocks, 412 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 306 ConstructedInterpolants, 0 QuantifiedInterpolants, 366 SizeOfPredicates, 0 NumberOfNonLiveVariables, 243 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-04 01:00:54,779 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_variablewrapping_normal_file-96.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 6d7425f39e4b5fbb927434634ac2d6821a470a923e73c3da4e09488baff8f9ad --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:00:56,712 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:00:56,805 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:00:56,811 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:00:56,811 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:00:56,829 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:00:56,831 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:00:56,831 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:00:56,831 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:00:56,831 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:00:56,832 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:00:56,832 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:00:56,833 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:00:56,833 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:00:56,833 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:00:56,833 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:00:56,834 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:00:56,834 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:00:56,834 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:00:56,834 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:00:56,834 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:00:56,834 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:00:56,834 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:00:56,834 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:00:56,834 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:00:56,834 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:00:56,834 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:00:56,835 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:00:56,835 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:00:56,835 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:00:56,835 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:00:56,835 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:00:56,835 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:00:56,835 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:00:56,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:00:56,836 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:00:56,836 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:00:56,836 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:00:56,836 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:00:56,836 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:00:56,836 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:00:56,836 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:00:56,836 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:00:56,836 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:00:56,836 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:00:56,836 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 -> 6d7425f39e4b5fbb927434634ac2d6821a470a923e73c3da4e09488baff8f9ad [2025-03-04 01:00:57,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:00:57,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:00:57,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:00:57,106 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:00:57,108 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:00:57,109 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-96.i [2025-03-04 01:00:58,349 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50d01e6ce/6108f3a9dcf74ea58f65c6b82bc829d9/FLAG08198320e [2025-03-04 01:00:58,544 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:00:58,545 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-96.i [2025-03-04 01:00:58,553 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50d01e6ce/6108f3a9dcf74ea58f65c6b82bc829d9/FLAG08198320e [2025-03-04 01:00:58,904 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50d01e6ce/6108f3a9dcf74ea58f65c6b82bc829d9 [2025-03-04 01:00:58,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:00:58,909 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:00:58,910 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:00:58,910 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:00:58,914 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:00:58,914 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:00:58" (1/1) ... [2025-03-04 01:00:58,915 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57466e1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:58, skipping insertion in model container [2025-03-04 01:00:58,916 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:00:58" (1/1) ... [2025-03-04 01:00:58,931 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:00:59,029 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_variablewrapping_normal_file-96.i[913,926] [2025-03-04 01:00:59,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:00:59,072 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:00:59,079 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_variablewrapping_normal_file-96.i[913,926] [2025-03-04 01:00:59,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:00:59,107 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:00:59,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:59 WrapperNode [2025-03-04 01:00:59,109 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:00:59,109 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:00:59,109 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:00:59,109 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:00:59,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:59" (1/1) ... [2025-03-04 01:00:59,119 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:59" (1/1) ... [2025-03-04 01:00:59,132 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2025-03-04 01:00:59,132 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:00:59,133 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:00:59,133 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:00:59,133 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:00:59,139 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:59" (1/1) ... [2025-03-04 01:00:59,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:59" (1/1) ... [2025-03-04 01:00:59,142 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:59" (1/1) ... [2025-03-04 01:00:59,149 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-04 01:00:59,150 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:59" (1/1) ... [2025-03-04 01:00:59,150 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:59" (1/1) ... [2025-03-04 01:00:59,158 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:59" (1/1) ... [2025-03-04 01:00:59,160 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:59" (1/1) ... [2025-03-04 01:00:59,161 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:59" (1/1) ... [2025-03-04 01:00:59,162 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:59" (1/1) ... [2025-03-04 01:00:59,167 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:00:59,168 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:00:59,168 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:00:59,168 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:00:59,168 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:59" (1/1) ... [2025-03-04 01:00:59,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:00:59,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:00:59,199 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-04 01:00:59,204 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-04 01:00:59,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:00:59,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:00:59,223 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:00:59,223 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:00:59,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:00:59,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:00:59,291 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:00:59,294 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:01:00,117 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-04 01:01:00,119 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:01:00,128 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:01:00,128 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:01:00,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:01:00 BoogieIcfgContainer [2025-03-04 01:01:00,128 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:01:00,130 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:01:00,130 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:01:00,133 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:01:00,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:00:58" (1/3) ... [2025-03-04 01:01:00,134 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51d7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:01:00, skipping insertion in model container [2025-03-04 01:01:00,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:59" (2/3) ... [2025-03-04 01:01:00,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51d7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:01:00, skipping insertion in model container [2025-03-04 01:01:00,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:01:00" (3/3) ... [2025-03-04 01:01:00,137 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-96.i [2025-03-04 01:01:00,146 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:01:00,147 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-96.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:01:00,182 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:01:00,191 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;@27a9b8b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:01:00,193 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:01:00,196 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 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-04 01:01:00,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:01:00,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:01:00,205 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-04 01:01:00,205 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:01:00,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:01:00,209 INFO L85 PathProgramCache]: Analyzing trace with hash 659675438, now seen corresponding path program 1 times [2025-03-04 01:01:00,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:01:00,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1741821614] [2025-03-04 01:01:00,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:01:00,217 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-04 01:01:00,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:01:00,219 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-04 01:01:00,220 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-04 01:01:00,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:01:00,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:01:00,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:01:00,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:01:00,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:01:00,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:01:00,449 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-04 01:01:00,449 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:01:00,450 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:01:00,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1741821614] [2025-03-04 01:01:00,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1741821614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:01:00,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:01:00,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:01:00,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836085347] [2025-03-04 01:01:00,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:01:00,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:01:00,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:01:00,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:01:00,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:01:00,470 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 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 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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-04 01:01:00,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:01:00,493 INFO L93 Difference]: Finished difference Result 96 states and 159 transitions. [2025-03-04 01:01:00,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:01:00,494 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (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 103 [2025-03-04 01:01:00,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:01:00,499 INFO L225 Difference]: With dead ends: 96 [2025-03-04 01:01:00,499 INFO L226 Difference]: Without dead ends: 48 [2025-03-04 01:01:00,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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-04 01:01:00,503 INFO L435 NwaCegarLoop]: 69 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, 69 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-04 01:01:00,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:01:00,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-04 01:01:00,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-04 01:01:00,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 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-04 01:01:00,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2025-03-04 01:01:00,548 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 69 transitions. Word has length 103 [2025-03-04 01:01:00,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:01:00,549 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 69 transitions. [2025-03-04 01:01:00,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (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-04 01:01:00,549 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 69 transitions. [2025-03-04 01:01:00,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:01:00,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:01:00,552 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-04 01:01:00,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 01:01:00,752 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-04 01:01:00,753 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:01:00,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:01:00,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1142057036, now seen corresponding path program 1 times [2025-03-04 01:01:00,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:01:00,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [793215096] [2025-03-04 01:01:00,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:01:00,754 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-04 01:01:00,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:01:00,757 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-04 01:01:00,758 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-04 01:01:00,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:01:00,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:01:00,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:01:00,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:01:00,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:01:00,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:01:01,220 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:01:01,221 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:01:01,221 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:01:01,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [793215096] [2025-03-04 01:01:01,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [793215096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:01:01,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:01:01,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:01:01,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121204964] [2025-03-04 01:01:01,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:01:01,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:01:01,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:01:01,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:01:01,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:01:01,223 INFO L87 Difference]: Start difference. First operand 48 states and 69 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:01:02,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:01:02,821 INFO L93 Difference]: Finished difference Result 148 states and 213 transitions. [2025-03-04 01:01:02,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:01:02,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2025-03-04 01:01:02,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:01:02,835 INFO L225 Difference]: With dead ends: 148 [2025-03-04 01:01:02,835 INFO L226 Difference]: Without dead ends: 103 [2025-03-04 01:01:02,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:01:02,836 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 63 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:01:02,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 186 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-04 01:01:02,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-04 01:01:02,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 90. [2025-03-04 01:01:02,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 01:01:02,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 131 transitions. [2025-03-04 01:01:02,850 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 131 transitions. Word has length 103 [2025-03-04 01:01:02,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:01:02,851 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 131 transitions. [2025-03-04 01:01:02,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:01:02,851 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 131 transitions. [2025-03-04 01:01:02,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:01:02,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:01:02,852 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-04 01:01:02,859 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-04 01:01:03,052 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-04 01:01:03,053 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:01:03,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:01:03,054 INFO L85 PathProgramCache]: Analyzing trace with hash -665397427, now seen corresponding path program 1 times [2025-03-04 01:01:03,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:01:03,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1540968867] [2025-03-04 01:01:03,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:01:03,054 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-04 01:01:03,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:01:03,056 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-04 01:01:03,057 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-04 01:01:03,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:01:03,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:01:03,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:01:03,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:01:03,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 01:01:03,247 INFO L279 TraceCheckSpWp]: Computing forward predicates...