./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-82.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-82.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 a9a450555877b28033d09a5f84176dfa3dbe8a5a81fc1d86d82c451af47112ce --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:16:51,657 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:16:51,719 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:16:51,724 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:16:51,724 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:16:51,744 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:16:51,744 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:16:51,744 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:16:51,746 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:16:51,746 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:16:51,746 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:16:51,746 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:16:51,746 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:16:51,746 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:16:51,746 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:16:51,747 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:16:51,747 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:16:51,748 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:16:51,748 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:16:51,748 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:16:51,748 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:16:51,748 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:16:51,748 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:16:51,748 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:16:51,748 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:16:51,748 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:16:51,748 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:16:51,748 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:16:51,748 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:16:51,748 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:16:51,749 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:16:51,749 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:16:51,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:16:51,749 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:16:51,749 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:16:51,749 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:16:51,749 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:16:51,749 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:16:51,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:16:51,749 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:16:51,749 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:16:51,750 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:16:51,750 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:16:51,750 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 -> a9a450555877b28033d09a5f84176dfa3dbe8a5a81fc1d86d82c451af47112ce [2025-03-17 05:16:51,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:16:51,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:16:51,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:16:51,977 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:16:51,977 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:16:51,978 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-82.i [2025-03-17 05:16:53,089 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40194dac9/299790ef06ca4d448e681163eb8a990f/FLAG574989240 [2025-03-17 05:16:53,360 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:16:53,361 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-82.i [2025-03-17 05:16:53,369 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40194dac9/299790ef06ca4d448e681163eb8a990f/FLAG574989240 [2025-03-17 05:16:53,667 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40194dac9/299790ef06ca4d448e681163eb8a990f [2025-03-17 05:16:53,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:16:53,670 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:16:53,671 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:16:53,671 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:16:53,673 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:16:53,674 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:16:53" (1/1) ... [2025-03-17 05:16:53,675 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2699e715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:16:53, skipping insertion in model container [2025-03-17 05:16:53,675 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:16:53" (1/1) ... [2025-03-17 05:16:53,685 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:16:53,785 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-82.i[913,926] [2025-03-17 05:16:53,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:16:53,853 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:16:53,861 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-82.i[913,926] [2025-03-17 05:16:53,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:16:53,905 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:16:53,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:16:53 WrapperNode [2025-03-17 05:16:53,907 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:16:53,908 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:16:53,908 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:16:53,908 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:16:53,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:16:53" (1/1) ... [2025-03-17 05:16:53,926 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:16:53" (1/1) ... [2025-03-17 05:16:53,963 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 128 [2025-03-17 05:16:53,963 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:16:53,964 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:16:53,964 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:16:53,964 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:16:53,972 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:16:53" (1/1) ... [2025-03-17 05:16:53,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:16:53" (1/1) ... [2025-03-17 05:16:53,975 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:16:53" (1/1) ... [2025-03-17 05:16:54,002 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-17 05:16:54,004 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:16:53" (1/1) ... [2025-03-17 05:16:54,004 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:16:53" (1/1) ... [2025-03-17 05:16:54,011 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:16:53" (1/1) ... [2025-03-17 05:16:54,012 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:16:53" (1/1) ... [2025-03-17 05:16:54,014 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:16:53" (1/1) ... [2025-03-17 05:16:54,015 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:16:53" (1/1) ... [2025-03-17 05:16:54,017 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:16:54,018 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:16:54,018 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:16:54,018 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:16:54,018 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:16:53" (1/1) ... [2025-03-17 05:16:54,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:16:54,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:16:54,044 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-17 05:16:54,046 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-17 05:16:54,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:16:54,064 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:16:54,064 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:16:54,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:16:54,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:16:54,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:16:54,120 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:16:54,122 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:16:54,363 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L99: havoc property_#t~bitwise13#1;havoc property_#t~short14#1; [2025-03-17 05:16:54,385 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-17 05:16:54,386 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:16:54,402 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:16:54,403 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:16:54,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:16:54 BoogieIcfgContainer [2025-03-17 05:16:54,403 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:16:54,405 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:16:54,406 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:16:54,409 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:16:54,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:16:53" (1/3) ... [2025-03-17 05:16:54,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a4db450 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:16:54, skipping insertion in model container [2025-03-17 05:16:54,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:16:53" (2/3) ... [2025-03-17 05:16:54,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a4db450 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:16:54, skipping insertion in model container [2025-03-17 05:16:54,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:16:54" (3/3) ... [2025-03-17 05:16:54,411 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-82.i [2025-03-17 05:16:54,422 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:16:54,423 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-82.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:16:54,469 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:16:54,483 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;@67204ec6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:16:54,483 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:16:54,487 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 05:16:54,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 05:16:54,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:16:54,495 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:16:54,495 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:16:54,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:16:54,500 INFO L85 PathProgramCache]: Analyzing trace with hash 724362263, now seen corresponding path program 1 times [2025-03-17 05:16:54,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:16:54,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210180732] [2025-03-17 05:16:54,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:16:54,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:16:54,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 05:16:54,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 05:16:54,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:16:54,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:16:54,695 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-17 05:16:54,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:16:54,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210180732] [2025-03-17 05:16:54,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210180732] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:16:54,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551884340] [2025-03-17 05:16:54,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:16:54,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:16:54,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:16:54,702 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-17 05:16:54,704 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-17 05:16:54,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 05:16:54,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 05:16:54,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:16:54,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:16:54,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:16:54,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:16:54,841 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-17 05:16:54,841 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:16:54,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551884340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:16:54,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:16:54,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:16:54,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851042733] [2025-03-17 05:16:54,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:16:54,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:16:54,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:16:54,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:16:54,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:16:54,867 INFO L87 Difference]: Start difference. First operand has 53 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:16:54,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:16:54,891 INFO L93 Difference]: Finished difference Result 103 states and 170 transitions. [2025-03-17 05:16:54,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:16:54,893 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 92 [2025-03-17 05:16:54,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:16:54,898 INFO L225 Difference]: With dead ends: 103 [2025-03-17 05:16:54,899 INFO L226 Difference]: Without dead ends: 51 [2025-03-17 05:16:54,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 93 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-17 05:16:54,904 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:16:54,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:16:54,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-17 05:16:54,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-17 05:16:54,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 35 states have internal predecessors, (47), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 05:16:54,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 75 transitions. [2025-03-17 05:16:54,938 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 75 transitions. Word has length 92 [2025-03-17 05:16:54,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:16:54,938 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 75 transitions. [2025-03-17 05:16:54,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:16:54,938 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 75 transitions. [2025-03-17 05:16:54,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 05:16:54,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:16:54,940 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:16:54,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 05:16:55,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 05:16:55,141 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:16:55,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:16:55,142 INFO L85 PathProgramCache]: Analyzing trace with hash 2091291097, now seen corresponding path program 1 times [2025-03-17 05:16:55,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:16:55,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778311458] [2025-03-17 05:16:55,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:16:55,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:16:55,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 05:16:55,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 05:16:55,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:16:55,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:16:55,549 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:16:55,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:16:55,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778311458] [2025-03-17 05:16:55,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778311458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:16:55,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:16:55,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:16:55,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264765379] [2025-03-17 05:16:55,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:16:55,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:16:55,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:16:55,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:16:55,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:16:55,551 INFO L87 Difference]: Start difference. First operand 51 states and 75 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:16:55,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:16:55,629 INFO L93 Difference]: Finished difference Result 118 states and 172 transitions. [2025-03-17 05:16:55,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:16:55,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 92 [2025-03-17 05:16:55,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:16:55,632 INFO L225 Difference]: With dead ends: 118 [2025-03-17 05:16:55,632 INFO L226 Difference]: Without dead ends: 68 [2025-03-17 05:16:55,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:16:55,633 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 18 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:16:55,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 258 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:16:55,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-17 05:16:55,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 55. [2025-03-17 05:16:55,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 05:16:55,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 80 transitions. [2025-03-17 05:16:55,640 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 80 transitions. Word has length 92 [2025-03-17 05:16:55,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:16:55,641 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 80 transitions. [2025-03-17 05:16:55,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:16:55,641 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 80 transitions. [2025-03-17 05:16:55,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 05:16:55,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:16:55,642 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:16:55,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:16:55,642 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:16:55,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:16:55,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1140349641, now seen corresponding path program 1 times [2025-03-17 05:16:55,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:16:55,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616792947] [2025-03-17 05:16:55,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:16:55,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:16:55,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 05:16:55,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 05:16:55,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:16:55,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:16:55,736 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:16:55,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 05:16:55,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 05:16:55,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:16:55,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:16:55,824 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:16:55,825 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:16:55,826 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:16:55,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:16:55,831 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-17 05:16:55,918 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:16:55,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:16:55 BoogieIcfgContainer [2025-03-17 05:16:55,924 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:16:55,924 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:16:55,924 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:16:55,925 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:16:55,925 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:16:54" (3/4) ... [2025-03-17 05:16:55,927 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:16:55,928 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:16:55,929 INFO L158 Benchmark]: Toolchain (without parser) took 2259.03ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 130.3MB in the end (delta: -8.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:16:55,929 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:16:55,930 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.02ms. Allocated memory is still 167.8MB. Free memory was 121.3MB in the beginning and 108.4MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:16:55,930 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.11ms. Allocated memory is still 167.8MB. Free memory was 108.4MB in the beginning and 105.0MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:16:55,931 INFO L158 Benchmark]: Boogie Preprocessor took 53.30ms. Allocated memory is still 167.8MB. Free memory was 105.0MB in the beginning and 100.9MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:16:55,931 INFO L158 Benchmark]: IcfgBuilder took 385.59ms. Allocated memory is still 167.8MB. Free memory was 100.9MB in the beginning and 79.4MB in the end (delta: 21.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 05:16:55,931 INFO L158 Benchmark]: TraceAbstraction took 1518.58ms. Allocated memory is still 167.8MB. Free memory was 79.0MB in the beginning and 130.4MB in the end (delta: -51.4MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. [2025-03-17 05:16:55,931 INFO L158 Benchmark]: Witness Printer took 3.73ms. Allocated memory is still 167.8MB. Free memory was 130.4MB in the beginning and 130.3MB in the end (delta: 41.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:16:55,933 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 237.02ms. Allocated memory is still 167.8MB. Free memory was 121.3MB in the beginning and 108.4MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.11ms. Allocated memory is still 167.8MB. Free memory was 108.4MB in the beginning and 105.0MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.30ms. Allocated memory is still 167.8MB. Free memory was 105.0MB in the beginning and 100.9MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 385.59ms. Allocated memory is still 167.8MB. Free memory was 100.9MB in the beginning and 79.4MB in the end (delta: 21.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1518.58ms. Allocated memory is still 167.8MB. Free memory was 79.0MB in the beginning and 130.4MB in the end (delta: -51.4MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. * Witness Printer took 3.73ms. Allocated memory is still 167.8MB. Free memory was 130.4MB in the beginning and 130.3MB in the end (delta: 41.5kB). 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 76, overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of someBinaryFLOATComparisonOperation at line 74, overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 99. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 128.75; [L23] unsigned char var_1_2 = 1; [L24] float var_1_3 = 63.5; [L25] float var_1_4 = 255.5; [L26] unsigned char var_1_5 = 32; [L27] unsigned char var_1_9 = 25; [L28] unsigned char var_1_10 = 128; [L29] unsigned char var_1_11 = 16; [L30] unsigned char var_1_12 = 2; [L31] unsigned char var_1_14 = 5; [L32] unsigned char var_1_15 = 10; [L33] double var_1_16 = 3.75; [L34] unsigned char var_1_17 = 0; [L35] double var_1_18 = 255.5; [L36] unsigned char last_1_var_1_5 = 32; [L37] unsigned char last_1_var_1_12 = 2; [L38] unsigned char last_1_var_1_17 = 0; [L103] isInitial = 1 [L104] FCALL initially() [L105] COND TRUE 1 [L106] CALL updateLastVariables() [L94] last_1_var_1_5 = var_1_5 [L95] last_1_var_1_12 = var_1_12 [L96] last_1_var_1_17 = var_1_17 [L106] RET updateLastVariables() [L107] CALL updateVariables() [L70] var_1_2 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_3=127/2, var_1_4=511/2, var_1_5=32, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_3=127/2, var_1_4=511/2, var_1_5=32, var_1_9=25] [L71] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_3=127/2, var_1_4=511/2, var_1_5=32, var_1_9=25] [L72] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_3=127/2, var_1_4=511/2, var_1_5=32, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_3=127/2, var_1_4=511/2, var_1_5=32, var_1_9=25] [L72] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_3=127/2, var_1_4=511/2, var_1_5=32, var_1_9=25] [L73] var_1_3 = __VERIFIER_nondet_float() [L74] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_4=511/2, var_1_5=32, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_4=511/2, var_1_5=32, var_1_9=25] [L74] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_4=511/2, var_1_5=32, var_1_9=25] [L75] var_1_4 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=25] [L76] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=25] [L77] var_1_9 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32] [L78] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32] [L79] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=-128] [L79] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=-128] [L80] var_1_10 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=-128] [L81] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=-128] [L82] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=-128] [L82] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=-128] [L83] var_1_11 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=-128] [L84] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=-128] [L85] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=-128] [L85] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=-128] [L86] var_1_14 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=2, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=2, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=-128] [L87] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=2, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=-128] [L88] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=2, var_1_14=254, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=2, var_1_14=254, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=-128] [L88] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=2, var_1_14=254, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=-128] [L89] var_1_15 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=2, var_1_14=254, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=2, var_1_14=254, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=-128] [L90] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=2, var_1_14=254, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=-128] [L91] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=2, var_1_14=254, var_1_15=127, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=2, var_1_14=254, var_1_15=127, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=-128] [L91] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=2, var_1_14=254, var_1_15=127, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=-128] [L107] RET updateVariables() [L108] CALL step() [L42] EXPR last_1_var_1_17 | last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=2, var_1_14=254, var_1_15=127, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=-128] [L42] signed long int stepLocal_0 = last_1_var_1_17 | last_1_var_1_12; [L43] COND FALSE !((last_1_var_1_5 / -2) >= stepLocal_0) [L46] var_1_5 = (var_1_10 - ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=2, var_1_14=254, var_1_15=127, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=0, var_1_9=-128] [L48] COND FALSE !(! var_1_2) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=2, var_1_14=254, var_1_15=127, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=0, var_1_9=-128] [L53] var_1_16 = var_1_4 [L54] var_1_17 = var_1_9 [L55] var_1_18 = var_1_3 [L56] unsigned char stepLocal_1 = var_1_9; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, stepLocal_1=-128, var_1_10=-32385, var_1_11=127, var_1_12=2, var_1_14=254, var_1_15=127, var_1_16=261, var_1_17=-128, var_1_18=260, var_1_1=515/4, var_1_2=1, var_1_3=260, var_1_4=261, var_1_5=0, var_1_9=-128] [L57] COND FALSE !((var_1_5 + var_1_11) >= stepLocal_1) [L66] var_1_12 = var_1_9 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=-128, var_1_14=254, var_1_15=127, var_1_16=261, var_1_17=-128, var_1_18=260, var_1_1=515/4, var_1_2=1, var_1_3=260, var_1_4=261, var_1_5=0, var_1_9=-128] [L108] RET step() [L109] CALL, EXPR property() [L99] EXPR ((! var_1_2) ? (var_1_2 ? (var_1_1 == ((float) ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))))) : 1) : 1) && (((last_1_var_1_5 / -2) >= (last_1_var_1_17 | last_1_var_1_12)) ? (var_1_5 == ((unsigned char) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) : (var_1_5 == ((unsigned char) (var_1_10 - ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=-128, var_1_14=254, var_1_15=127, var_1_16=261, var_1_17=-128, var_1_18=260, var_1_1=515/4, var_1_2=1, var_1_3=260, var_1_4=261, var_1_5=0, var_1_9=-128] [L99] EXPR last_1_var_1_17 | last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=-128, var_1_14=254, var_1_15=127, var_1_16=261, var_1_17=-128, var_1_18=260, var_1_1=515/4, var_1_2=1, var_1_3=260, var_1_4=261, var_1_5=0, var_1_9=-128] [L99] EXPR ((! var_1_2) ? (var_1_2 ? (var_1_1 == ((float) ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))))) : 1) : 1) && (((last_1_var_1_5 / -2) >= (last_1_var_1_17 | last_1_var_1_12)) ? (var_1_5 == ((unsigned char) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) : (var_1_5 == ((unsigned char) (var_1_10 - ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=-128, var_1_14=254, var_1_15=127, var_1_16=261, var_1_17=-128, var_1_18=260, var_1_1=515/4, var_1_2=1, var_1_3=260, var_1_4=261, var_1_5=0, var_1_9=-128] [L99-L100] return ((((((! var_1_2) ? (var_1_2 ? (var_1_1 == ((float) ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))))) : 1) : 1) && (((last_1_var_1_5 / -2) >= (last_1_var_1_17 | last_1_var_1_12)) ? (var_1_5 == ((unsigned char) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) : (var_1_5 == ((unsigned char) (var_1_10 - ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))))) && (((var_1_5 + var_1_11) >= var_1_9) ? ((((((var_1_4) > ((var_1_1 * var_1_3))) ? (var_1_4) : ((var_1_1 * var_1_3)))) <= var_1_1) ? (var_1_12 == ((unsigned char) ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14))))) : (var_1_2 ? (var_1_12 == ((unsigned char) (var_1_11 + var_1_15))) : 1)) : (var_1_12 == ((unsigned char) var_1_9)))) && (var_1_16 == ((double) var_1_4))) && (var_1_17 == ((unsigned char) var_1_9))) && (var_1_18 == ((double) var_1_3)) ; [L109] RET, EXPR property() [L109] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=-128, var_1_14=254, var_1_15=127, var_1_16=261, var_1_17=-128, var_1_18=260, var_1_1=515/4, var_1_2=1, var_1_3=260, var_1_4=261, var_1_5=0, var_1_9=-128] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=-32385, var_1_11=127, var_1_12=-128, var_1_14=254, var_1_15=127, var_1_16=261, var_1_17=-128, var_1_18=260, var_1_1=515/4, var_1_2=1, var_1_3=260, var_1_4=261, var_1_5=0, var_1_9=-128] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 93 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 3, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 331 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 190 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35 IncrementalHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 141 mSDtfsCounter, 35 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=2, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 13 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 370 NumberOfCodeBlocks, 370 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 273 ConstructedInterpolants, 0 QuantifiedInterpolants, 291 SizeOfPredicates, 0 NumberOfNonLiveVariables, 232 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 1066/1092 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-17 05:16:55,950 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-82.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 a9a450555877b28033d09a5f84176dfa3dbe8a5a81fc1d86d82c451af47112ce --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:16:57,845 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:16:57,932 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:16:57,937 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:16:57,937 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:16:57,965 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:16:57,967 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:16:57,967 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:16:57,967 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:16:57,968 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:16:57,968 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:16:57,968 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:16:57,968 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:16:57,968 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:16:57,969 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:16:57,970 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:16:57,970 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:16:57,970 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:16:57,970 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:16:57,970 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:16:57,970 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:16:57,970 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:16:57,970 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:16:57,970 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:16:57,971 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:16:57,971 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:16:57,971 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:16:57,971 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:16:57,971 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:16:57,971 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:16:57,971 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:16:57,971 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:16:57,971 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:16:57,971 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:16:57,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:16:57,972 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:16:57,972 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:16:57,972 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:16:57,972 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:16:57,972 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:16:57,972 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:16:57,972 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:16:57,972 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:16:57,972 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:16:57,973 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:16:57,973 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 -> a9a450555877b28033d09a5f84176dfa3dbe8a5a81fc1d86d82c451af47112ce [2025-03-17 05:16:58,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:16:58,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:16:58,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:16:58,238 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:16:58,239 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:16:58,240 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-82.i [2025-03-17 05:16:59,461 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d9c6ac40/1c135ba026244b389d31ffa2b1887258/FLAGb29708263 [2025-03-17 05:16:59,669 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:16:59,670 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-82.i [2025-03-17 05:16:59,677 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d9c6ac40/1c135ba026244b389d31ffa2b1887258/FLAGb29708263 [2025-03-17 05:17:00,039 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d9c6ac40/1c135ba026244b389d31ffa2b1887258 [2025-03-17 05:17:00,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:17:00,043 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:17:00,044 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:17:00,044 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:17:00,048 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:17:00,049 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:17:00" (1/1) ... [2025-03-17 05:17:00,049 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1543b315 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:17:00, skipping insertion in model container [2025-03-17 05:17:00,049 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:17:00" (1/1) ... [2025-03-17 05:17:00,066 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:17:00,161 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-82.i[913,926] [2025-03-17 05:17:00,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:17:00,212 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:17:00,219 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-82.i[913,926] [2025-03-17 05:17:00,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:17:00,249 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:17:00,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:17:00 WrapperNode [2025-03-17 05:17:00,251 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:17:00,251 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:17:00,252 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:17:00,252 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:17:00,256 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:17:00" (1/1) ... [2025-03-17 05:17:00,263 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:17:00" (1/1) ... [2025-03-17 05:17:00,279 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 106 [2025-03-17 05:17:00,279 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:17:00,279 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:17:00,280 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:17:00,280 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:17:00,289 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:17:00" (1/1) ... [2025-03-17 05:17:00,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:17:00" (1/1) ... [2025-03-17 05:17:00,291 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:17:00" (1/1) ... [2025-03-17 05:17:00,311 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-17 05:17:00,311 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:17:00" (1/1) ... [2025-03-17 05:17:00,313 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:17:00" (1/1) ... [2025-03-17 05:17:00,323 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:17:00" (1/1) ... [2025-03-17 05:17:00,324 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:17:00" (1/1) ... [2025-03-17 05:17:00,325 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:17:00" (1/1) ... [2025-03-17 05:17:00,329 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:17:00" (1/1) ... [2025-03-17 05:17:00,332 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:17:00,336 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:17:00,336 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:17:00,336 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:17:00,337 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:17:00" (1/1) ... [2025-03-17 05:17:00,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:17:00,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:17:00,368 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-17 05:17:00,370 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-17 05:17:00,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:17:00,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:17:00,384 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:17:00,384 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:17:00,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:17:00,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:17:00,434 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:17:00,436 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:17:01,390 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 05:17:01,390 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:17:01,401 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:17:01,403 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:17:01,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:17:01 BoogieIcfgContainer [2025-03-17 05:17:01,404 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:17:01,406 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:17:01,406 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:17:01,410 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:17:01,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:17:00" (1/3) ... [2025-03-17 05:17:01,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@329e3898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:17:01, skipping insertion in model container [2025-03-17 05:17:01,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:17:00" (2/3) ... [2025-03-17 05:17:01,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@329e3898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:17:01, skipping insertion in model container [2025-03-17 05:17:01,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:17:01" (3/3) ... [2025-03-17 05:17:01,412 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-82.i [2025-03-17 05:17:01,423 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:17:01,424 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-82.i that has 2 procedures, 42 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:17:01,461 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:17:01,469 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;@7bbf187c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:17:01,469 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:17:01,473 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 05:17:01,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-17 05:17:01,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:17:01,494 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:17:01,494 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:17:01,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:17:01,498 INFO L85 PathProgramCache]: Analyzing trace with hash 656548487, now seen corresponding path program 1 times [2025-03-17 05:17:01,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:17:01,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [738966304] [2025-03-17 05:17:01,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:17:01,509 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-17 05:17:01,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:17:01,511 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-17 05:17:01,512 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-17 05:17:01,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 05:17:01,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 05:17:01,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:17:01,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:17:01,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:17:01,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:17:01,689 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-17 05:17:01,689 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:17:01,689 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:17:01,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [738966304] [2025-03-17 05:17:01,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [738966304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:17:01,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:17:01,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:17:01,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770000016] [2025-03-17 05:17:01,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:17:01,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:17:01,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:17:01,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:17:01,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:17:01,711 INFO L87 Difference]: Start difference. First operand has 42 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:17:01,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:17:01,729 INFO L93 Difference]: Finished difference Result 81 states and 138 transitions. [2025-03-17 05:17:01,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:17:01,730 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 87 [2025-03-17 05:17:01,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:17:01,735 INFO L225 Difference]: With dead ends: 81 [2025-03-17 05:17:01,735 INFO L226 Difference]: Without dead ends: 40 [2025-03-17 05:17:01,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 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-17 05:17:01,739 INFO L435 NwaCegarLoop]: 59 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, 59 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-17 05:17:01,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:17:01,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-17 05:17:01,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-17 05:17:01,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 05:17:01,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2025-03-17 05:17:01,765 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 87 [2025-03-17 05:17:01,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:17:01,766 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2025-03-17 05:17:01,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:17:01,766 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2025-03-17 05:17:01,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-17 05:17:01,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:17:01,768 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:17:01,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 05:17:01,968 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-17 05:17:01,969 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:17:01,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:17:01,970 INFO L85 PathProgramCache]: Analyzing trace with hash -614505595, now seen corresponding path program 1 times [2025-03-17 05:17:01,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:17:01,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1118872548] [2025-03-17 05:17:01,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:17:01,970 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-17 05:17:01,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:17:01,975 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-17 05:17:01,976 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-17 05:17:02,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 05:17:02,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 05:17:02,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:17:02,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:17:02,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:17:02,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:17:02,377 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:17:02,377 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:17:02,377 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:17:02,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1118872548] [2025-03-17 05:17:02,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1118872548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:17:02,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:17:02,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:17:02,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766722279] [2025-03-17 05:17:02,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:17:02,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:17:02,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:17:02,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:17:02,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:17:02,380 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:17:03,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:17:03,645 INFO L93 Difference]: Finished difference Result 119 states and 176 transitions. [2025-03-17 05:17:03,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:17:03,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 87 [2025-03-17 05:17:03,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:17:03,659 INFO L225 Difference]: With dead ends: 119 [2025-03-17 05:17:03,659 INFO L226 Difference]: Without dead ends: 80 [2025-03-17 05:17:03,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:17:03,660 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 29 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:17:03,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 187 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 05:17:03,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-17 05:17:03,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 68. [2025-03-17 05:17:03,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 05:17:03,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 100 transitions. [2025-03-17 05:17:03,676 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 100 transitions. Word has length 87 [2025-03-17 05:17:03,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:17:03,676 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 100 transitions. [2025-03-17 05:17:03,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:17:03,676 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 100 transitions. [2025-03-17 05:17:03,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-17 05:17:03,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:17:03,677 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:17:03,684 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 (3)] Forceful destruction successful, exit code 0 [2025-03-17 05:17:03,877 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-17 05:17:03,878 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:17:03,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:17:03,879 INFO L85 PathProgramCache]: Analyzing trace with hash 272998086, now seen corresponding path program 1 times [2025-03-17 05:17:03,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:17:03,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [857841610] [2025-03-17 05:17:03,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:17:03,879 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-17 05:17:03,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:17:03,881 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-17 05:17:03,882 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-17 05:17:03,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 05:17:03,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 05:17:03,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:17:03,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:17:03,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 05:17:03,999 INFO L279 TraceCheckSpWp]: Computing forward predicates...