./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-79.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-79.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 3427cd04e63c47ddeaec1dc1bec16a594ae04a31865909e3272379057690f9aa --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:58:49,796 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:58:49,838 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:58:49,842 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:58:49,842 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:58:49,855 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:58:49,856 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:58:49,856 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:58:49,856 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:58:49,856 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:58:49,856 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:58:49,856 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:58:49,856 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:58:49,856 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:58:49,856 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:58:49,856 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:58:49,857 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:58:49,857 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:58:49,857 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:58:49,857 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:58:49,857 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:58:49,857 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:58:49,857 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:58:49,857 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:58:49,857 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:58:49,857 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:58:49,857 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:58:49,857 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:58:49,857 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:58:49,857 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:58:49,857 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:58:49,857 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:58:49,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:58:49,857 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:58:49,857 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:58:49,858 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:58:49,858 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:58:49,858 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:58:49,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:58:49,858 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:58:49,858 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:58:49,858 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:58:49,858 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:58:49,858 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 -> 3427cd04e63c47ddeaec1dc1bec16a594ae04a31865909e3272379057690f9aa [2025-03-04 00:58:50,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:58:50,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:58:50,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:58:50,112 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:58:50,113 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:58:50,114 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-79.i [2025-03-04 00:58:51,283 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82a5e655c/f6301b2449e74fc08f846a3d3b5c3002/FLAG3fe30b697 [2025-03-04 00:58:51,493 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:58:51,494 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-79.i [2025-03-04 00:58:51,499 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82a5e655c/f6301b2449e74fc08f846a3d3b5c3002/FLAG3fe30b697 [2025-03-04 00:58:51,845 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82a5e655c/f6301b2449e74fc08f846a3d3b5c3002 [2025-03-04 00:58:51,846 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:58:51,847 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:58:51,848 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:58:51,848 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:58:51,852 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:58:51,853 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:58:51" (1/1) ... [2025-03-04 00:58:51,853 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d97fe48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:51, skipping insertion in model container [2025-03-04 00:58:51,855 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:58:51" (1/1) ... [2025-03-04 00:58:51,869 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:58:51,959 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-79.i[913,926] [2025-03-04 00:58:51,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:58:51,992 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:58:52,000 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-79.i[913,926] [2025-03-04 00:58:52,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:58:52,031 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:58:52,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:52 WrapperNode [2025-03-04 00:58:52,031 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:58:52,032 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:58:52,032 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:58:52,032 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:58:52,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:52" (1/1) ... [2025-03-04 00:58:52,042 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:52" (1/1) ... [2025-03-04 00:58:52,068 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2025-03-04 00:58:52,068 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:58:52,069 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:58:52,069 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:58:52,069 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:58:52,075 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:52" (1/1) ... [2025-03-04 00:58:52,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:52" (1/1) ... [2025-03-04 00:58:52,076 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:52" (1/1) ... [2025-03-04 00:58:52,084 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 00:58:52,084 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:52" (1/1) ... [2025-03-04 00:58:52,084 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:52" (1/1) ... [2025-03-04 00:58:52,092 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:52" (1/1) ... [2025-03-04 00:58:52,092 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:52" (1/1) ... [2025-03-04 00:58:52,093 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:52" (1/1) ... [2025-03-04 00:58:52,094 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:52" (1/1) ... [2025-03-04 00:58:52,096 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:58:52,097 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:58:52,098 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:58:52,098 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:58:52,098 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:52" (1/1) ... [2025-03-04 00:58:52,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:58:52,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:58:52,124 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 00:58:52,129 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 00:58:52,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:58:52,144 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:58:52,144 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:58:52,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:58:52,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:58:52,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:58:52,188 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:58:52,190 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:58:52,390 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L88: havoc property_#t~bitwise12#1;havoc property_#t~short13#1; [2025-03-04 00:58:52,405 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-04 00:58:52,405 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:58:52,419 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:58:52,420 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:58:52,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:58:52 BoogieIcfgContainer [2025-03-04 00:58:52,420 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:58:52,422 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:58:52,422 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:58:52,426 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:58:52,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:58:51" (1/3) ... [2025-03-04 00:58:52,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58277e01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:58:52, skipping insertion in model container [2025-03-04 00:58:52,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:52" (2/3) ... [2025-03-04 00:58:52,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58277e01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:58:52, skipping insertion in model container [2025-03-04 00:58:52,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:58:52" (3/3) ... [2025-03-04 00:58:52,429 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-79.i [2025-03-04 00:58:52,439 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:58:52,440 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-79.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:58:52,475 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:58:52,486 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;@4bcc6dd2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:58:52,486 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:58:52,489 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 38 states have internal predecessors, (50), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 00:58:52,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-04 00:58:52,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:58:52,494 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:58:52,495 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:58:52,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:58:52,498 INFO L85 PathProgramCache]: Analyzing trace with hash -929237966, now seen corresponding path program 1 times [2025-03-04 00:58:52,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:58:52,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441000567] [2025-03-04 00:58:52,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:58:52,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:58:52,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 00:58:52,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 00:58:52,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:58:52,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:58:52,854 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 00:58:52,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:58:52,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441000567] [2025-03-04 00:58:52,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441000567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:58:52,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:58:52,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:58:52,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112766752] [2025-03-04 00:58:52,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:58:52,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:58:52,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:58:52,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:58:52,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:58:52,878 INFO L87 Difference]: Start difference. First operand has 51 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 38 states have internal predecessors, (50), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 00:58:52,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:58:52,949 INFO L93 Difference]: Finished difference Result 139 states and 224 transitions. [2025-03-04 00:58:52,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:58:52,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 79 [2025-03-04 00:58:52,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:58:52,956 INFO L225 Difference]: With dead ends: 139 [2025-03-04 00:58:52,957 INFO L226 Difference]: Without dead ends: 91 [2025-03-04 00:58:52,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:58:52,964 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 58 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:58:52,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 280 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:58:52,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-04 00:58:52,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 50. [2025-03-04 00:58:52,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 00:58:52,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 69 transitions. [2025-03-04 00:58:52,991 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 69 transitions. Word has length 79 [2025-03-04 00:58:52,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:58:52,995 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 69 transitions. [2025-03-04 00:58:52,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 00:58:52,996 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 69 transitions. [2025-03-04 00:58:52,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 00:58:52,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:58:52,999 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:58:52,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 00:58:52,999 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:58:53,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:58:53,000 INFO L85 PathProgramCache]: Analyzing trace with hash 438272602, now seen corresponding path program 1 times [2025-03-04 00:58:53,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:58:53,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877356239] [2025-03-04 00:58:53,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:58:53,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:58:53,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 00:58:53,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 00:58:53,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:58:53,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:58:53,248 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 00:58:53,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:58:53,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877356239] [2025-03-04 00:58:53,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877356239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:58:53,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:58:53,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:58:53,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7650366] [2025-03-04 00:58:53,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:58:53,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:58:53,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:58:53,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:58:53,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:58:53,252 INFO L87 Difference]: Start difference. First operand 50 states and 69 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 00:58:53,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:58:53,399 INFO L93 Difference]: Finished difference Result 140 states and 194 transitions. [2025-03-04 00:58:53,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:58:53,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 80 [2025-03-04 00:58:53,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:58:53,402 INFO L225 Difference]: With dead ends: 140 [2025-03-04 00:58:53,403 INFO L226 Difference]: Without dead ends: 93 [2025-03-04 00:58:53,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:58:53,404 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 61 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:58:53,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 216 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:58:53,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-04 00:58:53,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 48. [2025-03-04 00:58:53,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 00:58:53,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2025-03-04 00:58:53,413 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 80 [2025-03-04 00:58:53,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:58:53,414 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2025-03-04 00:58:53,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 00:58:53,414 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2025-03-04 00:58:53,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-04 00:58:53,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:58:53,416 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:58:53,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:58:53,416 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:58:53,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:58:53,416 INFO L85 PathProgramCache]: Analyzing trace with hash -470886992, now seen corresponding path program 1 times [2025-03-04 00:58:53,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:58:53,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560228428] [2025-03-04 00:58:53,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:58:53,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:58:53,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 00:58:53,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 00:58:53,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:58:53,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:58:53,684 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-04 00:58:53,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:58:53,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560228428] [2025-03-04 00:58:53,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560228428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:58:53,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:58:53,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:58:53,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330270442] [2025-03-04 00:58:53,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:58:53,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:58:53,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:58:53,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:58:53,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:58:53,686 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 00:58:53,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:58:53,835 INFO L93 Difference]: Finished difference Result 99 states and 132 transitions. [2025-03-04 00:58:53,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:58:53,836 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 81 [2025-03-04 00:58:53,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:58:53,837 INFO L225 Difference]: With dead ends: 99 [2025-03-04 00:58:53,837 INFO L226 Difference]: Without dead ends: 54 [2025-03-04 00:58:53,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-04 00:58:53,838 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 83 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:58:53,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 112 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:58:53,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-04 00:58:53,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2025-03-04 00:58:53,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 00:58:53,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2025-03-04 00:58:53,848 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 81 [2025-03-04 00:58:53,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:58:53,849 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2025-03-04 00:58:53,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 00:58:53,849 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2025-03-04 00:58:53,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 00:58:53,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:58:53,850 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:58:53,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:58:53,850 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:58:53,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:58:53,850 INFO L85 PathProgramCache]: Analyzing trace with hash -553223720, now seen corresponding path program 1 times [2025-03-04 00:58:53,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:58:53,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874092194] [2025-03-04 00:58:53,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:58:53,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:58:53,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 00:58:53,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 00:58:53,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:58:53,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:58:53,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [931697547] [2025-03-04 00:58:53,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:58:53,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:58:53,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:58:53,911 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 00:58:53,912 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 00:58:53,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 00:58:53,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 00:58:53,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:58:53,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:58:53,998 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:58:54,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 00:58:54,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 00:58:54,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:58:54,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:58:54,063 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:58:54,064 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:58:54,064 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:58:54,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:58:54,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:58:54,269 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-04 00:58:54,314 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:58:54,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:58:54 BoogieIcfgContainer [2025-03-04 00:58:54,320 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:58:54,321 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:58:54,321 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:58:54,321 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:58:54,321 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:58:52" (3/4) ... [2025-03-04 00:58:54,324 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:58:54,324 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:58:54,326 INFO L158 Benchmark]: Toolchain (without parser) took 2477.69ms. Allocated memory is still 167.8MB. Free memory was 129.1MB in the beginning and 71.1MB in the end (delta: 58.0MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. [2025-03-04 00:58:54,326 INFO L158 Benchmark]: CDTParser took 1.08ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:58:54,327 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.51ms. Allocated memory is still 167.8MB. Free memory was 128.7MB in the beginning and 116.4MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:58:54,328 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.38ms. Allocated memory is still 167.8MB. Free memory was 116.4MB in the beginning and 114.6MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:58:54,329 INFO L158 Benchmark]: Boogie Preprocessor took 27.67ms. Allocated memory is still 167.8MB. Free memory was 114.6MB in the beginning and 112.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:58:54,329 INFO L158 Benchmark]: IcfgBuilder took 323.34ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 95.8MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:58:54,329 INFO L158 Benchmark]: TraceAbstraction took 1898.20ms. Allocated memory is still 167.8MB. Free memory was 95.4MB in the beginning and 71.1MB in the end (delta: 24.2MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2025-03-04 00:58:54,329 INFO L158 Benchmark]: Witness Printer took 3.78ms. Allocated memory is still 167.8MB. Free memory was 71.1MB in the beginning and 71.1MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:58:54,330 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.08ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 183.51ms. Allocated memory is still 167.8MB. Free memory was 128.7MB in the beginning and 116.4MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.38ms. Allocated memory is still 167.8MB. Free memory was 116.4MB in the beginning and 114.6MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.67ms. Allocated memory is still 167.8MB. Free memory was 114.6MB in the beginning and 112.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 323.34ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 95.8MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1898.20ms. Allocated memory is still 167.8MB. Free memory was 95.4MB in the beginning and 71.1MB in the end (delta: 24.2MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. * Witness Printer took 3.78ms. Allocated memory is still 167.8MB. Free memory was 71.1MB in the beginning and 71.1MB in the end (delta: 41.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 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 88, overapproximation of someBinaryDOUBLEComparisonOperation at line 48, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 88, overapproximation of someBinaryDOUBLEComparisonOperation at line 75. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -16; [L23] signed char var_1_3 = 0; [L24] signed char var_1_4 = 64; [L25] signed char var_1_5 = 64; [L26] signed long int var_1_6 = -64; [L27] double var_1_8 = 32.5; [L28] double var_1_9 = 1.6; [L29] unsigned short int var_1_10 = 32; [L30] float var_1_11 = 15.5; [L31] unsigned char var_1_12 = 0; [L32] unsigned char var_1_13 = 0; [L33] unsigned short int last_1_var_1_10 = 32; VAL [isInitial=0, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L92] isInitial = 1 [L93] FCALL initially() [L94] COND TRUE 1 [L95] CALL updateLastVariables() [L85] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L95] RET updateLastVariables() [L96] CALL updateVariables() [L65] var_1_3 = __VERIFIER_nondet_char() [L66] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L66] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L67] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L67] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L68] var_1_4 = __VERIFIER_nondet_char() [L69] CALL assume_abort_if_not(var_1_4 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=64, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=64, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L69] RET assume_abort_if_not(var_1_4 >= -1) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=64, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L70] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=64, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=64, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L70] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=64, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L71] var_1_5 = __VERIFIER_nondet_char() [L72] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L72] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L73] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L73] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L74] var_1_8 = __VERIFIER_nondet_double() [L75] CALL assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64, var_1_9=8/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64, var_1_9=8/5] [L75] RET assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64, var_1_9=8/5] [L76] var_1_9 = __VERIFIER_nondet_double() [L77] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64] [L77] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64] [L78] var_1_11 = __VERIFIER_nondet_float() [L79] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64] [L79] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64] [L80] var_1_13 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64] [L81] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64] [L82] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64] [L82] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64] [L96] RET updateVariables() [L97] CALL step() [L37] signed long int stepLocal_0 = (((var_1_5) > (last_1_var_1_10)) ? (var_1_5) : (last_1_var_1_10)); VAL [isInitial=1, last_1_var_1_10=32, stepLocal_0=33, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64] [L38] EXPR last_1_var_1_10 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, stepLocal_0=33, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64] [L38] COND FALSE !(stepLocal_0 <= (var_1_4 * (last_1_var_1_10 >> var_1_3))) [L45] var_1_6 = var_1_5 VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=33] [L47] signed long int stepLocal_1 = var_1_5 + var_1_6; VAL [isInitial=1, last_1_var_1_10=32, stepLocal_1=66, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=33] [L48] COND FALSE !(var_1_11 < var_1_9) VAL [isInitial=1, last_1_var_1_10=32, stepLocal_1=66, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=33] [L55] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_10=32, stepLocal_1=66, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=33] [L56] COND TRUE ! var_1_12 VAL [isInitial=1, last_1_var_1_10=32, stepLocal_1=66, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=33] [L57] COND TRUE ! var_1_12 [L58] var_1_1 = (var_1_3 + -32) VAL [isInitial=1, last_1_var_1_10=32, stepLocal_1=66, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-32, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=33] [L97] RET step() [L98] CALL, EXPR property() [L88] EXPR ((! var_1_12) ? ((! var_1_12) ? (var_1_1 == ((signed char) (var_1_3 + -32))) : (var_1_1 == ((signed char) (var_1_4 - ((((var_1_5) < (16)) ? (var_1_5) : (16))))))) : 1) && ((((((var_1_5) > (last_1_var_1_10)) ? (var_1_5) : (last_1_var_1_10))) <= (var_1_4 * (last_1_var_1_10 >> var_1_3))) ? (((- var_1_8) >= var_1_9) ? (var_1_6 == ((signed long int) var_1_4)) : (var_1_6 == ((signed long int) var_1_5))) : (var_1_6 == ((signed long int) var_1_5))) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-32, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=33] [L88] EXPR last_1_var_1_10 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-32, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=33] [L88] EXPR ((! var_1_12) ? ((! var_1_12) ? (var_1_1 == ((signed char) (var_1_3 + -32))) : (var_1_1 == ((signed char) (var_1_4 - ((((var_1_5) < (16)) ? (var_1_5) : (16))))))) : 1) && ((((((var_1_5) > (last_1_var_1_10)) ? (var_1_5) : (last_1_var_1_10))) <= (var_1_4 * (last_1_var_1_10 >> var_1_3))) ? (((- var_1_8) >= var_1_9) ? (var_1_6 == ((signed long int) var_1_4)) : (var_1_6 == ((signed long int) var_1_5))) : (var_1_6 == ((signed long int) var_1_5))) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-32, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=33] [L88-L89] return ((((! var_1_12) ? ((! var_1_12) ? (var_1_1 == ((signed char) (var_1_3 + -32))) : (var_1_1 == ((signed char) (var_1_4 - ((((var_1_5) < (16)) ? (var_1_5) : (16))))))) : 1) && ((((((var_1_5) > (last_1_var_1_10)) ? (var_1_5) : (last_1_var_1_10))) <= (var_1_4 * (last_1_var_1_10 >> var_1_3))) ? (((- var_1_8) >= var_1_9) ? (var_1_6 == ((signed long int) var_1_4)) : (var_1_6 == ((signed long int) var_1_5))) : (var_1_6 == ((signed long int) var_1_5)))) && ((var_1_11 < var_1_9) ? (((var_1_5 + var_1_6) <= (~ (var_1_6 % -32))) ? (var_1_10 == ((unsigned short int) var_1_5)) : (var_1_10 == ((unsigned short int) var_1_5))) : 1)) && (var_1_12 == ((unsigned char) var_1_13)) ; [L98] RET, EXPR property() [L98] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-32, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=33] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-32, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=33] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 4, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 204 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 202 mSDsluCounter, 608 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 379 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 178 IncrementalHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 229 mSDtfsCounter, 178 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=3, InterpolantAutomatonStates: 18, 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, 3 MinimizatonAttempts, 88 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 404 NumberOfCodeBlocks, 404 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 237 ConstructedInterpolants, 0 QuantifiedInterpolants, 320 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 660/660 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 00:58:54,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-79.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 3427cd04e63c47ddeaec1dc1bec16a594ae04a31865909e3272379057690f9aa --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:58:56,199 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:58:56,271 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:58:56,276 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:58:56,278 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:58:56,301 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:58:56,301 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:58:56,301 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:58:56,302 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:58:56,303 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:58:56,303 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:58:56,303 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:58:56,304 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:58:56,304 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:58:56,304 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:58:56,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:58:56,304 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:58:56,305 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:58:56,305 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:58:56,305 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:58:56,305 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:58:56,305 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:58:56,305 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:58:56,305 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:58:56,305 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:58:56,305 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:58:56,305 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:58:56,305 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:58:56,305 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:58:56,306 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:58:56,306 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:58:56,306 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:58:56,306 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:58:56,306 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:58:56,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:58:56,307 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:58:56,307 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:58:56,307 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:58:56,307 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:58:56,307 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:58:56,307 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:58:56,307 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:58:56,307 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:58:56,307 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:58:56,307 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:58:56,308 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 -> 3427cd04e63c47ddeaec1dc1bec16a594ae04a31865909e3272379057690f9aa [2025-03-04 00:58:56,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:58:56,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:58:56,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:58:56,565 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:58:56,567 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:58:56,567 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-79.i [2025-03-04 00:58:57,764 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8571c8e7/4db3af2efcc24c989d9b9322dafe8a13/FLAG16e0c06c0 [2025-03-04 00:58:57,960 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:58:57,960 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-79.i [2025-03-04 00:58:57,967 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8571c8e7/4db3af2efcc24c989d9b9322dafe8a13/FLAG16e0c06c0 [2025-03-04 00:58:58,333 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8571c8e7/4db3af2efcc24c989d9b9322dafe8a13 [2025-03-04 00:58:58,335 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:58:58,336 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:58:58,337 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:58:58,337 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:58:58,340 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:58:58,340 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:58:58" (1/1) ... [2025-03-04 00:58:58,341 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6772e82d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:58, skipping insertion in model container [2025-03-04 00:58:58,341 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:58:58" (1/1) ... [2025-03-04 00:58:58,351 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:58:58,434 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-79.i[913,926] [2025-03-04 00:58:58,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:58:58,469 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:58:58,478 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-79.i[913,926] [2025-03-04 00:58:58,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:58:58,504 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:58:58,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:58 WrapperNode [2025-03-04 00:58:58,505 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:58:58,506 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:58:58,506 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:58:58,506 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:58:58,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:58" (1/1) ... [2025-03-04 00:58:58,516 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:58" (1/1) ... [2025-03-04 00:58:58,529 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 92 [2025-03-04 00:58:58,530 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:58:58,530 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:58:58,530 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:58:58,530 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:58:58,536 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:58" (1/1) ... [2025-03-04 00:58:58,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:58" (1/1) ... [2025-03-04 00:58:58,538 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:58" (1/1) ... [2025-03-04 00:58:58,547 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 00:58:58,547 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:58" (1/1) ... [2025-03-04 00:58:58,547 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:58" (1/1) ... [2025-03-04 00:58:58,556 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:58" (1/1) ... [2025-03-04 00:58:58,559 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:58" (1/1) ... [2025-03-04 00:58:58,561 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:58" (1/1) ... [2025-03-04 00:58:58,564 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:58" (1/1) ... [2025-03-04 00:58:58,566 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:58:58,567 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:58:58,567 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:58:58,567 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:58:58,568 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:58" (1/1) ... [2025-03-04 00:58:58,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:58:58,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:58:58,591 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 00:58:58,596 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 00:58:58,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:58:58,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:58:58,609 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:58:58,609 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:58:58,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:58:58,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:58:58,672 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:58:58,674 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:58:59,039 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-04 00:58:59,040 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:58:59,046 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:58:59,046 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:58:59,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:58:59 BoogieIcfgContainer [2025-03-04 00:58:59,046 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:58:59,048 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:58:59,048 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:58:59,051 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:58:59,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:58:58" (1/3) ... [2025-03-04 00:58:59,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed8f0b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:58:59, skipping insertion in model container [2025-03-04 00:58:59,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:58:58" (2/3) ... [2025-03-04 00:58:59,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed8f0b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:58:59, skipping insertion in model container [2025-03-04 00:58:59,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:58:59" (3/3) ... [2025-03-04 00:58:59,053 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-79.i [2025-03-04 00:58:59,062 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:58:59,064 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-79.i that has 2 procedures, 44 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:58:59,104 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:58:59,112 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;@3e38f709, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:58:59,112 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:58:59,115 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 00:58:59,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-04 00:58:59,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:58:59,120 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:58:59,121 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:58:59,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:58:59,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1920774135, now seen corresponding path program 1 times [2025-03-04 00:58:59,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:58:59,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [140753168] [2025-03-04 00:58:59,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:58:59,131 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 00:58:59,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:58:59,133 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 00:58:59,135 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 00:58:59,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 00:58:59,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 00:58:59,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:58:59,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:58:59,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:58:59,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:58:59,293 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-04 00:58:59,294 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:58:59,294 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:58:59,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [140753168] [2025-03-04 00:58:59,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [140753168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:58:59,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:58:59,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:58:59,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191592748] [2025-03-04 00:58:59,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:58:59,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:58:59,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:58:59,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:58:59,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:58:59,315 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 00:58:59,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:58:59,334 INFO L93 Difference]: Finished difference Result 82 states and 130 transitions. [2025-03-04 00:58:59,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:58:59,335 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 76 [2025-03-04 00:58:59,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:58:59,339 INFO L225 Difference]: With dead ends: 82 [2025-03-04 00:58:59,339 INFO L226 Difference]: Without dead ends: 41 [2025-03-04 00:58:59,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 75 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 00:58:59,343 INFO L435 NwaCegarLoop]: 57 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, 57 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 00:58:59,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:58:59,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-04 00:58:59,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-04 00:58:59,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 00:58:59,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 57 transitions. [2025-03-04 00:58:59,376 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 57 transitions. Word has length 76 [2025-03-04 00:58:59,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:58:59,376 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 57 transitions. [2025-03-04 00:58:59,377 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 00:58:59,377 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 57 transitions. [2025-03-04 00:58:59,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-04 00:58:59,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:58:59,379 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:58:59,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:58:59,579 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 00:58:59,580 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:58:59,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:58:59,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1203805466, now seen corresponding path program 1 times [2025-03-04 00:58:59,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:58:59,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1551688996] [2025-03-04 00:58:59,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:58:59,581 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 00:58:59,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:58:59,585 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 00:58:59,585 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 00:58:59,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 00:58:59,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 00:58:59,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:58:59,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:58:59,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 00:58:59,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:58:59,782 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-04 00:58:59,782 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:58:59,783 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:58:59,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1551688996] [2025-03-04 00:58:59,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1551688996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:58:59,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:58:59,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:58:59,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880310098] [2025-03-04 00:58:59,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:58:59,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:58:59,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:58:59,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:58:59,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:58:59,785 INFO L87 Difference]: Start difference. First operand 41 states and 57 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 00:59:00,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:59:00,061 INFO L93 Difference]: Finished difference Result 85 states and 116 transitions. [2025-03-04 00:59:00,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:59:00,065 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 76 [2025-03-04 00:59:00,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:59:00,066 INFO L225 Difference]: With dead ends: 85 [2025-03-04 00:59:00,066 INFO L226 Difference]: Without dead ends: 47 [2025-03-04 00:59:00,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-04 00:59:00,067 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 66 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:59:00,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 93 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:59:00,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-04 00:59:00,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2025-03-04 00:59:00,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 00:59:00,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 58 transitions. [2025-03-04 00:59:00,074 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 58 transitions. Word has length 76 [2025-03-04 00:59:00,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:59:00,075 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 58 transitions. [2025-03-04 00:59:00,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 00:59:00,075 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2025-03-04 00:59:00,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-04 00:59:00,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:59:00,076 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:59:00,081 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 00:59:00,277 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 00:59:00,277 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:59:00,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:59:00,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1309092129, now seen corresponding path program 1 times [2025-03-04 00:59:00,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:59:00,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [461598658] [2025-03-04 00:59:00,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:59:00,278 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 00:59:00,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:59:00,280 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 00:59:00,281 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 00:59:00,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 00:59:00,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 00:59:00,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:59:00,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:59:00,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 00:59:00,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:59:42,422 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 114 proven. 18 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-04 00:59:42,422 INFO L312 TraceCheckSpWp]: Computing backward predicates...