./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-40.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-40.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 4489e800ee4794c55791b1f834830bc313f49297425e5ef7d1ffd16c6d31677a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:11:51,460 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:11:51,514 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:11:51,521 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:11:51,521 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:11:51,541 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:11:51,541 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:11:51,542 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:11:51,542 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:11:51,543 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:11:51,543 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:11:51,543 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:11:51,543 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:11:51,544 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:11:51,544 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:11:51,544 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:11:51,544 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:11:51,545 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:11:51,545 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:11:51,545 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:11:51,545 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:11:51,545 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:11:51,545 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:11:51,545 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:11:51,545 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:11:51,545 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:11:51,545 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:11:51,545 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:11:51,545 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:11:51,545 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:11:51,546 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:11:51,546 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:11:51,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:11:51,546 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:11:51,546 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:11:51,546 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:11:51,546 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:11:51,546 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:11:51,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:11:51,547 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:11:51,547 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:11:51,547 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:11:51,547 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:11:51,547 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 -> 4489e800ee4794c55791b1f834830bc313f49297425e5ef7d1ffd16c6d31677a [2025-03-17 05:11:51,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:11:51,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:11:51,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:11:51,778 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:11:51,778 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:11:51,778 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-40.i [2025-03-17 05:11:52,930 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2d3197c7/412d8723f9c749bdad2fc7d38843376d/FLAG68925ab6f [2025-03-17 05:11:53,156 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:11:53,157 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-40.i [2025-03-17 05:11:53,164 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2d3197c7/412d8723f9c749bdad2fc7d38843376d/FLAG68925ab6f [2025-03-17 05:11:53,492 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2d3197c7/412d8723f9c749bdad2fc7d38843376d [2025-03-17 05:11:53,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:11:53,495 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:11:53,496 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:11:53,496 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:11:53,499 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:11:53,499 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:11:53" (1/1) ... [2025-03-17 05:11:53,500 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77b13c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:53, skipping insertion in model container [2025-03-17 05:11:53,500 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:11:53" (1/1) ... [2025-03-17 05:11:53,515 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:11:53,610 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-40.i[913,926] [2025-03-17 05:11:53,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:11:53,652 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:11:53,661 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-40.i[913,926] [2025-03-17 05:11:53,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:11:53,698 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:11:53,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:53 WrapperNode [2025-03-17 05:11:53,699 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:11:53,700 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:11:53,700 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:11:53,700 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:11:53,704 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:11:53" (1/1) ... [2025-03-17 05:11:53,710 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:11:53" (1/1) ... [2025-03-17 05:11:53,723 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2025-03-17 05:11:53,724 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:11:53,724 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:11:53,724 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:11:53,724 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:11:53,730 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:53" (1/1) ... [2025-03-17 05:11:53,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:53" (1/1) ... [2025-03-17 05:11:53,732 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:53" (1/1) ... [2025-03-17 05:11:53,741 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:11:53,741 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:53" (1/1) ... [2025-03-17 05:11:53,742 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:53" (1/1) ... [2025-03-17 05:11:53,748 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:53" (1/1) ... [2025-03-17 05:11:53,748 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:53" (1/1) ... [2025-03-17 05:11:53,749 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:53" (1/1) ... [2025-03-17 05:11:53,752 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:53" (1/1) ... [2025-03-17 05:11:53,753 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:11:53,754 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:11:53,754 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:11:53,754 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:11:53,755 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:53" (1/1) ... [2025-03-17 05:11:53,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:11:53,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:11:53,783 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:11:53,788 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:11:53,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:11:53,804 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:11:53,804 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:11:53,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:11:53,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:11:53,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:11:53,859 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:11:53,861 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:11:54,049 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L100: havoc property_#t~bitwise14#1;havoc property_#t~short15#1; [2025-03-17 05:11:54,077 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-17 05:11:54,077 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:11:54,091 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:11:54,093 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:11:54,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:11:54 BoogieIcfgContainer [2025-03-17 05:11:54,093 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:11:54,095 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:11:54,095 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:11:54,098 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:11:54,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:11:53" (1/3) ... [2025-03-17 05:11:54,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd323dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:11:54, skipping insertion in model container [2025-03-17 05:11:54,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:53" (2/3) ... [2025-03-17 05:11:54,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd323dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:11:54, skipping insertion in model container [2025-03-17 05:11:54,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:11:54" (3/3) ... [2025-03-17 05:11:54,101 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-40.i [2025-03-17 05:11:54,112 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:11:54,115 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-40.i that has 2 procedures, 59 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:11:54,161 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:11:54,171 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;@db894e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:11:54,172 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:11:54,177 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:11:54,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-17 05:11:54,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:11:54,187 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:54,188 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:11:54,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:11:54,195 INFO L85 PathProgramCache]: Analyzing trace with hash 803225299, now seen corresponding path program 1 times [2025-03-17 05:11:54,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:11:54,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310746365] [2025-03-17 05:11:54,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:11:54,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:11:54,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 05:11:54,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 05:11:54,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:11:54,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:11:54,400 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-17 05:11:54,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:11:54,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310746365] [2025-03-17 05:11:54,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310746365] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:11:54,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001692483] [2025-03-17 05:11:54,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:11:54,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:11:54,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:11:54,404 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:11:54,406 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:11:54,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 05:11:54,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 05:11:54,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:11:54,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:11:54,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:11:54,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:11:54,548 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-17 05:11:54,550 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:11:54,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001692483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:11:54,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:11:54,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:11:54,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949343071] [2025-03-17 05:11:54,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:11:54,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:11:54,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:11:54,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:11:54,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:11:54,588 INFO L87 Difference]: Start difference. First operand has 59 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 05:11:54,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:11:54,616 INFO L93 Difference]: Finished difference Result 115 states and 199 transitions. [2025-03-17 05:11:54,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:11:54,619 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 118 [2025-03-17 05:11:54,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:11:54,625 INFO L225 Difference]: With dead ends: 115 [2025-03-17 05:11:54,626 INFO L226 Difference]: Without dead ends: 57 [2025-03-17 05:11:54,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 119 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:11:54,630 INFO L435 NwaCegarLoop]: 85 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, 85 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:11:54,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:11:54,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-17 05:11:54,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-17 05:11:54,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:11:54,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 87 transitions. [2025-03-17 05:11:54,662 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 87 transitions. Word has length 118 [2025-03-17 05:11:54,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:11:54,663 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 87 transitions. [2025-03-17 05:11:54,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 05:11:54,663 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 87 transitions. [2025-03-17 05:11:54,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-17 05:11:54,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:11:54,668 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:54,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 05:11:54,869 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:11:54,869 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:11:54,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:11:54,870 INFO L85 PathProgramCache]: Analyzing trace with hash 97106672, now seen corresponding path program 1 times [2025-03-17 05:11:54,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:11:54,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893698473] [2025-03-17 05:11:54,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:11:54,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:11:54,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 05:11:54,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 05:11:54,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:11:54,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:11:55,491 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:11:55,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:11:55,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893698473] [2025-03-17 05:11:55,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893698473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:11:55,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:11:55,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:11:55,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325003691] [2025-03-17 05:11:55,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:11:55,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:11:55,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:11:55,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:11:55,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:11:55,493 INFO L87 Difference]: Start difference. First operand 57 states and 87 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:11:55,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:11:55,582 INFO L93 Difference]: Finished difference Result 131 states and 198 transitions. [2025-03-17 05:11:55,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:11:55,583 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 118 [2025-03-17 05:11:55,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:11:55,585 INFO L225 Difference]: With dead ends: 131 [2025-03-17 05:11:55,586 INFO L226 Difference]: Without dead ends: 75 [2025-03-17 05:11:55,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:11:55,587 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 20 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:11:55,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 417 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:11:55,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-17 05:11:55,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 64. [2025-03-17 05:11:55,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 states have internal predecessors, (60), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:11:55,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 98 transitions. [2025-03-17 05:11:55,599 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 98 transitions. Word has length 118 [2025-03-17 05:11:55,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:11:55,602 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 98 transitions. [2025-03-17 05:11:55,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:11:55,602 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 98 transitions. [2025-03-17 05:11:55,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-17 05:11:55,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:11:55,603 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:55,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:11:55,604 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:11:55,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:11:55,604 INFO L85 PathProgramCache]: Analyzing trace with hash -854110066, now seen corresponding path program 1 times [2025-03-17 05:11:55,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:11:55,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906178120] [2025-03-17 05:11:55,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:11:55,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:11:55,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-17 05:11:55,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-17 05:11:55,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:11:55,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 05:11:55,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2132919648] [2025-03-17 05:11:55,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:11:55,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:11:55,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:11:55,693 INFO L229 MonitoredProcess]: Starting monitored process 3 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:11:55,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 05:11:55,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-17 05:11:55,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-17 05:11:55,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:11:55,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:11:55,782 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:11:55,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-17 05:11:55,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-17 05:11:55,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:11:55,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:11:55,871 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:11:55,872 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:11:55,873 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:11:55,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 05:11:56,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-17 05:11:56,077 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-17 05:11:56,138 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:11:56,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:11:56 BoogieIcfgContainer [2025-03-17 05:11:56,141 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:11:56,141 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:11:56,141 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:11:56,141 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:11:56,143 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:11:54" (3/4) ... [2025-03-17 05:11:56,144 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:11:56,145 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:11:56,145 INFO L158 Benchmark]: Toolchain (without parser) took 2650.14ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 45.9MB in the end (delta: 66.0MB). Peak memory consumption was 61.7MB. Max. memory is 16.1GB. [2025-03-17 05:11:56,145 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:11:56,146 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.92ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 99.2MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:11:56,146 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.59ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 96.8MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:11:56,146 INFO L158 Benchmark]: Boogie Preprocessor took 28.88ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 94.4MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:11:56,146 INFO L158 Benchmark]: IcfgBuilder took 339.59ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 75.2MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:11:56,146 INFO L158 Benchmark]: TraceAbstraction took 2045.86ms. Allocated memory is still 142.6MB. Free memory was 74.7MB in the beginning and 46.1MB in the end (delta: 28.7MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2025-03-17 05:11:56,153 INFO L158 Benchmark]: Witness Printer took 3.49ms. Allocated memory is still 142.6MB. Free memory was 46.1MB in the beginning and 45.9MB in the end (delta: 212.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:11:56,155 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.17ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 203.92ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 99.2MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.59ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 96.8MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.88ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 94.4MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 339.59ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 75.2MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2045.86ms. Allocated memory is still 142.6MB. Free memory was 74.7MB in the beginning and 46.1MB in the end (delta: 28.7MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. * Witness Printer took 3.49ms. Allocated memory is still 142.6MB. Free memory was 46.1MB in the beginning and 45.9MB in the end (delta: 212.0kB). 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 someBinaryArithmeticDOUBLEoperation at line 63, overapproximation of someBinaryFLOATComparisonOperation at line 100, overapproximation of someBinaryFLOATComparisonOperation at line 100, overapproximation of someBinaryFLOATComparisonOperation at line 49, overapproximation of someBinaryDOUBLEComparisonOperation at line 62, overapproximation of someBinaryDOUBLEComparisonOperation at line 100, overapproximation of someBinaryDOUBLEComparisonOperation at line 88. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -4; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_7 = 64; [L26] signed long int var_1_8 = -2; [L27] signed long int var_1_9 = -10; [L28] unsigned char var_1_11 = 128; [L29] unsigned char var_1_12 = 1; [L30] double var_1_13 = 8.4; [L31] double var_1_15 = 49.75; [L32] signed char var_1_16 = -2; [L33] signed char var_1_17 = 25; [L34] signed char var_1_18 = -5; [L35] float var_1_19 = 7.5; [L36] signed short int var_1_20 = 1; [L37] signed short int var_1_21 = -256; [L38] double last_1_var_1_13 = 8.4; [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] CALL updateLastVariables() [L97] last_1_var_1_13 = var_1_13 [L107] RET updateLastVariables() [L108] CALL updateVariables() [L67] var_1_2 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_3=0, var_1_7=64, var_1_8=-2, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_3=0, var_1_7=64, var_1_8=-2, var_1_9=-10] [L68] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_3=0, var_1_7=64, var_1_8=-2, var_1_9=-10] [L69] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=0, var_1_7=64, var_1_8=-2, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=0, var_1_7=64, var_1_8=-2, var_1_9=-10] [L69] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=0, var_1_7=64, var_1_8=-2, var_1_9=-10] [L70] var_1_3 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_7=64, var_1_8=-2, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_7=64, var_1_8=-2, var_1_9=-10] [L71] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_7=64, var_1_8=-2, var_1_9=-10] [L72] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-2, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-2, var_1_9=-10] [L72] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-2, var_1_9=-10] [L73] var_1_8 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L74] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L75] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L75] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L76] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L76] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L77] var_1_9 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=5] [L78] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=5] [L79] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=5] [L79] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=5] [L80] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=5] [L80] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=5] [L81] var_1_11 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_11 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=5] [L82] RET assume_abort_if_not(var_1_11 >= 127) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=5] [L83] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=5] [L83] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=5] [L84] var_1_12 = __VERIFIER_nondet_uchar() [L85] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=5] [L85] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=5] [L86] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=5] [L86] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=5] [L87] var_1_15 = __VERIFIER_nondet_double() [L88] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=5] [L88] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=5] [L89] var_1_17 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_17 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=5] [L90] RET assume_abort_if_not(var_1_17 >= -127) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=5] [L91] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=5] [L91] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=5] [L92] var_1_18 = __VERIFIER_nondet_char() [L93] CALL assume_abort_if_not(var_1_18 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=0, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=0, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=5] [L93] RET assume_abort_if_not(var_1_18 >= -63) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=0, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=5] [L94] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=0, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=0, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=5] [L94] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=0, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=5] [L108] RET updateVariables() [L109] CALL step() [L42] COND TRUE \read(var_1_3) [L43] var_1_16 = ((((var_1_17) > ((-2 + var_1_18))) ? (var_1_17) : ((-2 + var_1_18)))) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-1, var_1_17=-1, var_1_18=0, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=5] [L45] var_1_19 = var_1_15 [L46] var_1_20 = var_1_16 [L47] var_1_21 = var_1_18 VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_15=2, var_1_16=-1, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=-1, var_1_21=0, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=5] [L48] COND TRUE \read(var_1_2) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_15=2, var_1_16=-1, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=-1, var_1_21=0, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=5] [L49] COND FALSE !(var_1_3 && (var_1_19 <= (- 63.9f))) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_15=2, var_1_16=-1, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=-1, var_1_21=0, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=5] [L57] EXPR var_1_21 | var_1_16 VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_15=2, var_1_16=-1, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=-1, var_1_21=0, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=5] [L57] COND TRUE ((var_1_16 / var_1_8) / var_1_9) >= (var_1_21 | var_1_16) [L58] var_1_7 = (var_1_11 - var_1_12) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_15=2, var_1_16=-1, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=-1, var_1_21=0, var_1_2=1, var_1_3=1, var_1_7=127, var_1_8=-1, var_1_9=5] [L62] COND TRUE var_1_19 != ((((last_1_var_1_13) < (var_1_19)) ? (last_1_var_1_13) : (var_1_19))) [L63] var_1_13 = (var_1_15 + (127.4 - 8.25)) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_15=2, var_1_16=-1, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=-1, var_1_21=0, var_1_2=1, var_1_3=1, var_1_7=127, var_1_8=-1, var_1_9=5] [L109] RET step() [L110] CALL, EXPR property() [L100] EXPR (var_1_2 ? ((var_1_3 && (var_1_19 <= (- 63.9f))) ? ((var_1_19 >= var_1_19) ? (var_1_3 ? (var_1_1 == ((signed long int) var_1_21)) : 1) : 1) : 1) : 1) && ((((var_1_16 / var_1_8) / var_1_9) >= (var_1_21 | var_1_16)) ? (var_1_7 == ((unsigned char) (var_1_11 - var_1_12))) : (var_1_7 == ((unsigned char) var_1_12))) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_15=2, var_1_16=-1, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=-1, var_1_21=0, var_1_2=1, var_1_3=1, var_1_7=127, var_1_8=-1, var_1_9=5] [L100-L101] return ((((((var_1_2 ? ((var_1_3 && (var_1_19 <= (- 63.9f))) ? ((var_1_19 >= var_1_19) ? (var_1_3 ? (var_1_1 == ((signed long int) var_1_21)) : 1) : 1) : 1) : 1) && ((((var_1_16 / var_1_8) / var_1_9) >= (var_1_21 | var_1_16)) ? (var_1_7 == ((unsigned char) (var_1_11 - var_1_12))) : (var_1_7 == ((unsigned char) var_1_12)))) && ((var_1_19 != ((((last_1_var_1_13) < (var_1_19)) ? (last_1_var_1_13) : (var_1_19)))) ? (var_1_13 == ((double) (var_1_15 + (127.4 - 8.25)))) : 1)) && (var_1_3 ? (var_1_16 == ((signed char) ((((var_1_17) > ((-2 + var_1_18))) ? (var_1_17) : ((-2 + var_1_18)))))) : 1)) && (var_1_19 == ((float) var_1_15))) && (var_1_20 == ((signed short int) var_1_16))) && (var_1_21 == ((signed short int) var_1_18)) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_15=2, var_1_16=-1, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=-1, var_1_21=0, var_1_2=1, var_1_3=1, var_1_7=127, var_1_8=-1, var_1_9=5] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_15=2, var_1_16=-1, var_1_17=-1, var_1_18=0, var_1_19=2, var_1_1=-4, var_1_20=-1, var_1_21=0, var_1_2=1, var_1_3=1, var_1_7=127, var_1_8=-1, var_1_9=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 59 locations, 110 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20 mSDsluCounter, 502 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 328 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42 IncrementalHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 174 mSDtfsCounter, 42 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=2, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 11 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 592 NumberOfCodeBlocks, 592 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 351 ConstructedInterpolants, 0 QuantifiedInterpolants, 373 SizeOfPredicates, 0 NumberOfNonLiveVariables, 276 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2016/2052 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:11:56,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-40.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 4489e800ee4794c55791b1f834830bc313f49297425e5ef7d1ffd16c6d31677a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:11:58,084 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:11:58,171 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:11:58,176 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:11:58,177 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:11:58,198 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:11:58,199 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:11:58,199 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:11:58,199 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:11:58,199 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:11:58,199 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:11:58,199 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:11:58,200 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:11:58,200 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:11:58,200 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:11:58,200 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:11:58,200 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:11:58,200 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:11:58,200 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:11:58,200 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:11:58,200 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:11:58,200 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:11:58,201 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:11:58,201 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:11:58,201 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:11:58,201 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:11:58,201 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:11:58,201 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:11:58,201 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:11:58,201 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:11:58,201 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:11:58,201 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:11:58,201 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:11:58,202 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:11:58,202 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:11:58,202 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:11:58,202 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:11:58,202 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:11:58,202 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:11:58,202 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:11:58,202 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:11:58,202 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:11:58,202 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:11:58,202 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:11:58,202 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:11:58,203 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 -> 4489e800ee4794c55791b1f834830bc313f49297425e5ef7d1ffd16c6d31677a [2025-03-17 05:11:58,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:11:58,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:11:58,444 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:11:58,446 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:11:58,446 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:11:58,448 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-40.i [2025-03-17 05:11:59,602 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/397b110c9/365fce56c90f461fa6cb788e0c72f29a/FLAG1d5898d9d [2025-03-17 05:11:59,795 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:11:59,796 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-40.i [2025-03-17 05:11:59,805 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/397b110c9/365fce56c90f461fa6cb788e0c72f29a/FLAG1d5898d9d [2025-03-17 05:11:59,821 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/397b110c9/365fce56c90f461fa6cb788e0c72f29a [2025-03-17 05:11:59,824 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:11:59,825 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:11:59,827 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:11:59,827 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:11:59,830 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:11:59,831 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:11:59" (1/1) ... [2025-03-17 05:11:59,832 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2437eaf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:59, skipping insertion in model container [2025-03-17 05:11:59,834 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:11:59" (1/1) ... [2025-03-17 05:11:59,847 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:11:59,965 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-40.i[913,926] [2025-03-17 05:12:00,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:12:00,029 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:12:00,045 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-40.i[913,926] [2025-03-17 05:12:00,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:12:00,077 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:12:00,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:12:00 WrapperNode [2025-03-17 05:12:00,078 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:12:00,079 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:12:00,080 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:12:00,080 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:12:00,084 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:12:00" (1/1) ... [2025-03-17 05:12:00,097 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:12:00" (1/1) ... [2025-03-17 05:12:00,116 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2025-03-17 05:12:00,119 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:12:00,120 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:12:00,120 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:12:00,120 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:12:00,126 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:12:00" (1/1) ... [2025-03-17 05:12:00,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:12:00" (1/1) ... [2025-03-17 05:12:00,129 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:12:00" (1/1) ... [2025-03-17 05:12:00,142 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:12:00,142 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:12:00" (1/1) ... [2025-03-17 05:12:00,142 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:12:00" (1/1) ... [2025-03-17 05:12:00,150 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:12:00" (1/1) ... [2025-03-17 05:12:00,151 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:12:00" (1/1) ... [2025-03-17 05:12:00,152 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:12:00" (1/1) ... [2025-03-17 05:12:00,153 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:12:00" (1/1) ... [2025-03-17 05:12:00,155 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:12:00,156 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:12:00,156 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:12:00,156 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:12:00,157 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:12:00" (1/1) ... [2025-03-17 05:12:00,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:12:00,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:12:00,188 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:12:00,194 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:12:00,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:12:00,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:12:00,211 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:12:00,212 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:12:00,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:12:00,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:12:00,283 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:12:00,286 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:12:03,778 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-17 05:12:03,778 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:12:03,785 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:12:03,785 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:12:03,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:12:03 BoogieIcfgContainer [2025-03-17 05:12:03,786 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:12:03,788 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:12:03,788 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:12:03,791 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:12:03,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:11:59" (1/3) ... [2025-03-17 05:12:03,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61c6f3a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:12:03, skipping insertion in model container [2025-03-17 05:12:03,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:12:00" (2/3) ... [2025-03-17 05:12:03,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61c6f3a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:12:03, skipping insertion in model container [2025-03-17 05:12:03,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:12:03" (3/3) ... [2025-03-17 05:12:03,793 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-40.i [2025-03-17 05:12:03,802 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:12:03,803 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-40.i that has 2 procedures, 49 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:12:03,845 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:12:03,856 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;@10e938cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:12:03,857 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:12:03,860 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:12:03,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-17 05:12:03,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:12:03,868 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:03,869 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:12:03,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:12:03,873 INFO L85 PathProgramCache]: Analyzing trace with hash -287817892, now seen corresponding path program 1 times [2025-03-17 05:12:03,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:12:03,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1921409397] [2025-03-17 05:12:03,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:12:03,880 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:12:03,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:12:03,883 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:12:03,885 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:12:03,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 05:12:04,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 05:12:04,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:12:04,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:12:04,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:12:04,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:12:04,206 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-03-17 05:12:04,206 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:12:04,207 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:12:04,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1921409397] [2025-03-17 05:12:04,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1921409397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:12:04,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:12:04,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:12:04,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211327278] [2025-03-17 05:12:04,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:12:04,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:12:04,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:12:04,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:12:04,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:12:04,226 INFO L87 Difference]: Start difference. First operand has 49 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 05:12:04,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:12:04,255 INFO L93 Difference]: Finished difference Result 95 states and 169 transitions. [2025-03-17 05:12:04,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:12:04,256 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 114 [2025-03-17 05:12:04,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:12:04,263 INFO L225 Difference]: With dead ends: 95 [2025-03-17 05:12:04,263 INFO L226 Difference]: Without dead ends: 47 [2025-03-17 05:12:04,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 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:12:04,269 INFO L435 NwaCegarLoop]: 72 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, 72 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:12:04,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:12:04,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-17 05:12:04,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-17 05:12:04,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:12:04,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 72 transitions. [2025-03-17 05:12:04,302 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 72 transitions. Word has length 114 [2025-03-17 05:12:04,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:12:04,302 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 72 transitions. [2025-03-17 05:12:04,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 05:12:04,302 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 72 transitions. [2025-03-17 05:12:04,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-17 05:12:04,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:12:04,305 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:04,318 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:12:04,506 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:12:04,506 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:12:04,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:12:04,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1031164409, now seen corresponding path program 1 times [2025-03-17 05:12:04,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:12:04,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [774951802] [2025-03-17 05:12:04,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:12:04,508 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:12:04,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:12:04,510 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:12:04,511 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:12:04,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 05:12:04,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 05:12:04,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:12:04,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:12:04,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 05:12:04,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:13:34,918 WARN L286 SmtUtils]: Spent 19.99s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)