./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-92.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-92.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 da2ee77b35405689fc5c65c91bc7d87d5288020b288dd575aada93fb6bdf0f20 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:18:22,521 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:18:22,579 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:18:22,583 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:18:22,583 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:18:22,603 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:18:22,604 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:18:22,604 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:18:22,604 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:18:22,604 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:18:22,605 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:18:22,605 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:18:22,605 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:18:22,605 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:18:22,605 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:18:22,605 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:18:22,606 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:18:22,606 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:18:22,606 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:18:22,606 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:18:22,607 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:18:22,607 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:18:22,607 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:18:22,607 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:18:22,607 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:18:22,607 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:18:22,607 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:18:22,607 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:18:22,607 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:18:22,607 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:18:22,607 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:18:22,608 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:18:22,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:18:22,608 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:18:22,608 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:18:22,608 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:18:22,609 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:18:22,609 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:18:22,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:18:22,609 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:18:22,609 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:18:22,609 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:18:22,609 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:18:22,609 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 -> da2ee77b35405689fc5c65c91bc7d87d5288020b288dd575aada93fb6bdf0f20 [2025-03-17 05:18:22,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:18:22,897 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:18:22,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:18:22,899 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:18:22,899 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:18:22,901 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-92.i [2025-03-17 05:18:24,071 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a3a6aa65/8c6a1964d1c54b1b8454bd652e989bbe/FLAG285ba9d14 [2025-03-17 05:18:24,277 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:18:24,278 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-92.i [2025-03-17 05:18:24,285 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a3a6aa65/8c6a1964d1c54b1b8454bd652e989bbe/FLAG285ba9d14 [2025-03-17 05:18:24,645 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a3a6aa65/8c6a1964d1c54b1b8454bd652e989bbe [2025-03-17 05:18:24,647 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:18:24,647 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:18:24,648 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:18:24,648 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:18:24,651 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:18:24,652 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:18:24" (1/1) ... [2025-03-17 05:18:24,652 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bb21166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:24, skipping insertion in model container [2025-03-17 05:18:24,652 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:18:24" (1/1) ... [2025-03-17 05:18:24,662 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:18:24,766 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-92.i[913,926] [2025-03-17 05:18:24,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:18:24,818 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:18:24,827 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-92.i[913,926] [2025-03-17 05:18:24,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:18:24,866 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:18:24,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:24 WrapperNode [2025-03-17 05:18:24,867 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:18:24,869 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:18:24,869 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:18:24,869 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:18:24,873 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:18:24" (1/1) ... [2025-03-17 05:18:24,879 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:18:24" (1/1) ... [2025-03-17 05:18:24,903 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2025-03-17 05:18:24,907 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:18:24,907 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:18:24,907 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:18:24,907 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:18:24,915 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:24" (1/1) ... [2025-03-17 05:18:24,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:24" (1/1) ... [2025-03-17 05:18:24,917 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:24" (1/1) ... [2025-03-17 05:18:24,936 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:18:24,936 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:24" (1/1) ... [2025-03-17 05:18:24,936 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:24" (1/1) ... [2025-03-17 05:18:24,947 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:24" (1/1) ... [2025-03-17 05:18:24,948 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:24" (1/1) ... [2025-03-17 05:18:24,949 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:24" (1/1) ... [2025-03-17 05:18:24,950 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:24" (1/1) ... [2025-03-17 05:18:24,951 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:18:24,952 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:18:24,952 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:18:24,952 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:18:24,956 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:24" (1/1) ... [2025-03-17 05:18:24,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:18:24,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:18:24,979 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:18:24,984 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:18:24,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:18:24,997 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:18:24,997 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:18:24,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:18:24,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:18:24,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:18:25,057 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:18:25,059 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:18:25,212 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L94: havoc property_#t~bitwise15#1;havoc property_#t~short16#1; [2025-03-17 05:18:25,232 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-17 05:18:25,233 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:18:25,250 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:18:25,254 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:18:25,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:18:25 BoogieIcfgContainer [2025-03-17 05:18:25,254 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:18:25,257 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:18:25,257 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:18:25,262 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:18:25,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:18:24" (1/3) ... [2025-03-17 05:18:25,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d612501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:18:25, skipping insertion in model container [2025-03-17 05:18:25,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:24" (2/3) ... [2025-03-17 05:18:25,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d612501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:18:25, skipping insertion in model container [2025-03-17 05:18:25,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:18:25" (3/3) ... [2025-03-17 05:18:25,264 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-92.i [2025-03-17 05:18:25,275 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:18:25,277 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-92.i that has 2 procedures, 58 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:18:25,314 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:18:25,324 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;@44855f07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:18:25,325 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:18:25,328 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 37 states have internal predecessors, (48), 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:18:25,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-17 05:18:25,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:18:25,338 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, 1] [2025-03-17 05:18:25,339 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:18:25,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:18:25,342 INFO L85 PathProgramCache]: Analyzing trace with hash 866377978, now seen corresponding path program 1 times [2025-03-17 05:18:25,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:18:25,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308243048] [2025-03-17 05:18:25,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:18:25,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:18:25,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 05:18:25,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 05:18:25,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:18:25,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:18:25,567 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:18:25,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:18:25,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308243048] [2025-03-17 05:18:25,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308243048] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:18:25,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429515059] [2025-03-17 05:18:25,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:18:25,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:18:25,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:18:25,572 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:18:25,574 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:18:25,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 05:18:25,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 05:18:25,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:18:25,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:18:25,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:18:25,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:18:25,734 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:18:25,734 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:18:25,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429515059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:18:25,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:18:25,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:18:25,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801119211] [2025-03-17 05:18:25,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:18:25,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:18:25,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:18:25,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:18:25,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:18:25,757 INFO L87 Difference]: Start difference. First operand has 58 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 37 states have internal predecessors, (48), 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 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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:18:25,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:18:25,811 INFO L93 Difference]: Finished difference Result 113 states and 189 transitions. [2025-03-17 05:18:25,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:18:25,812 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (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 120 [2025-03-17 05:18:25,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:18:25,817 INFO L225 Difference]: With dead ends: 113 [2025-03-17 05:18:25,817 INFO L226 Difference]: Without dead ends: 56 [2025-03-17 05:18:25,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 121 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:18:25,823 INFO L435 NwaCegarLoop]: 80 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, 80 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:18:25,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:18:25,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-17 05:18:25,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-17 05:18:25,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 35 states have internal predecessors, (44), 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:18:25,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 82 transitions. [2025-03-17 05:18:25,850 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 82 transitions. Word has length 120 [2025-03-17 05:18:25,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:18:25,850 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 82 transitions. [2025-03-17 05:18:25,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (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:18:25,850 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 82 transitions. [2025-03-17 05:18:25,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-17 05:18:25,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:18:25,856 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, 1] [2025-03-17 05:18:25,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 05:18:26,057 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:18:26,057 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:18:26,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:18:26,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1054824963, now seen corresponding path program 1 times [2025-03-17 05:18:26,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:18:26,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238771512] [2025-03-17 05:18:26,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:18:26,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:18:26,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 05:18:26,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 05:18:26,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:18:26,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:18:26,464 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:18:26,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:18:26,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238771512] [2025-03-17 05:18:26,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238771512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:18:26,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:18:26,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:18:26,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158150607] [2025-03-17 05:18:26,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:18:26,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:18:26,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:18:26,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:18:26,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:18:26,469 INFO L87 Difference]: Start difference. First operand 56 states and 82 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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:18:26,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:18:26,640 INFO L93 Difference]: Finished difference Result 112 states and 164 transitions. [2025-03-17 05:18:26,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:18:26,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 120 [2025-03-17 05:18:26,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:18:26,642 INFO L225 Difference]: With dead ends: 112 [2025-03-17 05:18:26,643 INFO L226 Difference]: Without dead ends: 57 [2025-03-17 05:18:26,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:18:26,644 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 21 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:18:26,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 161 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:18:26,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-17 05:18:26,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2025-03-17 05:18:26,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 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:18:26,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 81 transitions. [2025-03-17 05:18:26,655 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 81 transitions. Word has length 120 [2025-03-17 05:18:26,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:18:26,656 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 81 transitions. [2025-03-17 05:18:26,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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:18:26,656 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 81 transitions. [2025-03-17 05:18:26,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-17 05:18:26,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:18:26,660 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, 1, 1, 1] [2025-03-17 05:18:26,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:18:26,660 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:18:26,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:18:26,660 INFO L85 PathProgramCache]: Analyzing trace with hash -900906917, now seen corresponding path program 1 times [2025-03-17 05:18:26,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:18:26,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999739396] [2025-03-17 05:18:26,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:18:26,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:18:26,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 05:18:26,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 05:18:26,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:18:26,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:18:27,067 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-17 05:18:27,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:18:27,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999739396] [2025-03-17 05:18:27,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999739396] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:18:27,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093798595] [2025-03-17 05:18:27,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:18:27,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:18:27,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:18:27,071 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:18:27,072 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:18:27,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 05:18:27,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 05:18:27,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:18:27,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:18:27,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:18:27,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:18:27,241 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 178 proven. 6 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2025-03-17 05:18:27,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:18:27,425 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-17 05:18:27,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093798595] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:18:27,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:18:27,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-17 05:18:27,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946832033] [2025-03-17 05:18:27,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:18:27,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:18:27,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:18:27,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:18:27,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:18:27,428 INFO L87 Difference]: Start difference. First operand 56 states and 81 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 05:18:28,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:18:28,111 INFO L93 Difference]: Finished difference Result 243 states and 339 transitions. [2025-03-17 05:18:28,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-17 05:18:28,112 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 122 [2025-03-17 05:18:28,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:18:28,114 INFO L225 Difference]: With dead ends: 243 [2025-03-17 05:18:28,114 INFO L226 Difference]: Without dead ends: 188 [2025-03-17 05:18:28,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=206, Invalid=496, Unknown=0, NotChecked=0, Total=702 [2025-03-17 05:18:28,118 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 212 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:18:28,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 325 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:18:28,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-17 05:18:28,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 62. [2025-03-17 05:18:28,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:18:28,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 86 transitions. [2025-03-17 05:18:28,140 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 86 transitions. Word has length 122 [2025-03-17 05:18:28,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:18:28,141 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 86 transitions. [2025-03-17 05:18:28,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 05:18:28,141 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 86 transitions. [2025-03-17 05:18:28,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-17 05:18:28,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:18:28,142 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, 1, 1, 1] [2025-03-17 05:18:28,150 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:18:28,348 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:18:28,352 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:18:28,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:18:28,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1586605916, now seen corresponding path program 1 times [2025-03-17 05:18:28,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:18:28,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284936577] [2025-03-17 05:18:28,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:18:28,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:18:28,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 05:18:28,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 05:18:28,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:18:28,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 05:18:28,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [840192786] [2025-03-17 05:18:28,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:18:28,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:18:28,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:18:28,488 INFO L229 MonitoredProcess]: Starting monitored process 4 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:18:28,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 05:18:28,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 05:18:28,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 05:18:28,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:18:28,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:18:28,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 05:18:28,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:18:28,821 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 456 proven. 39 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-03-17 05:18:28,821 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:18:29,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:18:29,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284936577] [2025-03-17 05:18:29,169 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 05:18:29,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840192786] [2025-03-17 05:18:29,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840192786] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:18:29,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:18:29,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-03-17 05:18:29,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862849647] [2025-03-17 05:18:29,169 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 05:18:29,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:18:29,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:18:29,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:18:29,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:18:29,171 INFO L87 Difference]: Start difference. First operand 62 states and 86 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 05:18:29,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:18:29,748 INFO L93 Difference]: Finished difference Result 135 states and 181 transitions. [2025-03-17 05:18:29,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:18:29,748 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 122 [2025-03-17 05:18:29,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:18:29,749 INFO L225 Difference]: With dead ends: 135 [2025-03-17 05:18:29,749 INFO L226 Difference]: Without dead ends: 74 [2025-03-17 05:18:29,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:18:29,750 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 38 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:18:29,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 143 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:18:29,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-17 05:18:29,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2025-03-17 05:18:29,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:18:29,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 89 transitions. [2025-03-17 05:18:29,759 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 89 transitions. Word has length 122 [2025-03-17 05:18:29,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:18:29,760 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 89 transitions. [2025-03-17 05:18:29,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 05:18:29,760 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 89 transitions. [2025-03-17 05:18:29,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-17 05:18:29,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:18:29,761 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, 1, 1, 1] [2025-03-17 05:18:29,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 05:18:29,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:18:29,962 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:18:29,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:18:29,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1597109020, now seen corresponding path program 1 times [2025-03-17 05:18:29,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:18:29,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112552004] [2025-03-17 05:18:29,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:18:29,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:18:29,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 05:18:30,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 05:18:30,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:18:30,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 05:18:30,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [886203182] [2025-03-17 05:18:30,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:18:30,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:18:30,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:18:30,054 INFO L229 MonitoredProcess]: Starting monitored process 5 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:18:30,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 05:18:30,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 05:18:30,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 05:18:30,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:18:30,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:18:30,122 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:18:30,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 05:18:30,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 05:18:30,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:18:30,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:18:30,203 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:18:30,203 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:18:30,204 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:18:30,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 05:18:30,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:18:30,408 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-17 05:18:30,479 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:18:30,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:18:30 BoogieIcfgContainer [2025-03-17 05:18:30,482 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:18:30,483 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:18:30,483 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:18:30,484 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:18:30,485 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:18:25" (3/4) ... [2025-03-17 05:18:30,486 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:18:30,487 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:18:30,490 INFO L158 Benchmark]: Toolchain (without parser) took 5839.96ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 106.3MB in the beginning and 220.2MB in the end (delta: -113.8MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. [2025-03-17 05:18:30,490 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:18:30,490 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.88ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 94.1MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:18:30,490 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.99ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 92.0MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:18:30,490 INFO L158 Benchmark]: Boogie Preprocessor took 44.03ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 88.9MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:18:30,490 INFO L158 Benchmark]: IcfgBuilder took 303.06ms. Allocated memory is still 142.6MB. Free memory was 88.9MB in the beginning and 70.0MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:18:30,491 INFO L158 Benchmark]: TraceAbstraction took 5225.39ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 70.0MB in the beginning and 220.3MB in the end (delta: -150.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:18:30,491 INFO L158 Benchmark]: Witness Printer took 3.54ms. Allocated memory is still 285.2MB. Free memory was 220.3MB in the beginning and 220.2MB in the end (delta: 87.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:18:30,492 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.18ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 219.88ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 94.1MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.99ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 92.0MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.03ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 88.9MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 303.06ms. Allocated memory is still 142.6MB. Free memory was 88.9MB in the beginning and 70.0MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5225.39ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 70.0MB in the beginning and 220.3MB in the end (delta: -150.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.54ms. Allocated memory is still 285.2MB. Free memory was 220.3MB in the beginning and 220.2MB in the end (delta: 87.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 79. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 32; [L23] signed char var_1_2 = 2; [L24] signed char var_1_3 = 8; [L25] signed char var_1_4 = 0; [L26] signed char var_1_5 = 32; [L27] signed char var_1_6 = 10; [L28] double var_1_7 = 1000000.625; [L29] double var_1_8 = 16.65; [L30] double var_1_9 = 15.5; [L31] signed short int var_1_10 = 500; [L32] unsigned short int var_1_11 = 8; [L33] unsigned char var_1_13 = 0; [L34] unsigned short int var_1_14 = 100; [L35] unsigned char var_1_15 = 0; [L36] unsigned char var_1_16 = 0; [L37] float var_1_17 = 2.4; [L98] isInitial = 1 [L99] FCALL initially() [L100] COND TRUE 1 [L101] FCALL updateLastVariables() [L102] CALL updateVariables() [L61] var_1_2 = __VERIFIER_nondet_char() [L62] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L62] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L63] CALL assume_abort_if_not(var_1_2 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L63] RET assume_abort_if_not(var_1_2 <= 63) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L64] var_1_3 = __VERIFIER_nondet_char() [L65] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L65] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L66] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L66] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L67] var_1_4 = __VERIFIER_nondet_char() [L68] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L68] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L69] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L69] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L70] var_1_5 = __VERIFIER_nondet_char() [L71] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L71] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L72] CALL assume_abort_if_not(var_1_5 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L72] RET assume_abort_if_not(var_1_5 <= 63) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L73] var_1_6 = __VERIFIER_nondet_char() [L74] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L74] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L75] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L75] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L76] var_1_8 = __VERIFIER_nondet_double() [L77] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8, var_1_9=31/2] [L77] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8, var_1_9=31/2] [L78] var_1_9 = __VERIFIER_nondet_double() [L79] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L79] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L80] var_1_14 = __VERIFIER_nondet_ushort() [L81] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L81] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L82] CALL assume_abort_if_not(var_1_14 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L82] RET assume_abort_if_not(var_1_14 <= 65535) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L83] CALL assume_abort_if_not(var_1_14 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L83] RET assume_abort_if_not(var_1_14 != 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L84] var_1_15 = __VERIFIER_nondet_uchar() [L85] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L85] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L86] CALL assume_abort_if_not(var_1_15 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L86] RET assume_abort_if_not(var_1_15 <= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L87] var_1_16 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L88] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L89] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L89] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L102] RET updateVariables() [L103] CALL step() [L41] var_1_1 = ((var_1_2 + var_1_3) - ((((var_1_4) > ((var_1_5 + var_1_6))) ? (var_1_4) : ((var_1_5 + var_1_6))))) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L42] EXPR var_1_6 & var_1_3 VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=8000005/8] [L42] signed long int stepLocal_0 = (~ var_1_5) * (var_1_6 & var_1_3); [L43] COND TRUE stepLocal_0 >= var_1_4 [L44] var_1_7 = var_1_8 VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=2] [L48] var_1_10 = ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2))) [L49] signed long int stepLocal_1 = var_1_6 / var_1_14; VAL [isInitial=1, stepLocal_1=0, var_1_10=2, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=2] [L50] COND FALSE !(stepLocal_1 < -100) [L53] var_1_13 = (var_1_15 && var_1_16) VAL [isInitial=1, var_1_10=2, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=2] [L55] var_1_17 = var_1_8 VAL [isInitial=1, var_1_10=2, var_1_11=8, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=2] [L56] COND TRUE ! var_1_13 [L57] var_1_11 = (var_1_5 + (((((var_1_6) > (1)) ? (var_1_6) : (1))) + 64)) VAL [isInitial=1, var_1_10=2, var_1_11=66, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=2] [L103] RET step() [L104] CALL, EXPR property() [L94] EXPR (var_1_1 == ((signed char) ((var_1_2 + var_1_3) - ((((var_1_4) > ((var_1_5 + var_1_6))) ? (var_1_4) : ((var_1_5 + var_1_6))))))) && ((((~ var_1_5) * (var_1_6 & var_1_3)) >= var_1_4) ? (var_1_7 == ((double) var_1_8)) : (var_1_7 == ((double) var_1_9))) VAL [isInitial=1, var_1_10=2, var_1_11=66, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=2] [L94] EXPR var_1_6 & var_1_3 VAL [isInitial=1, var_1_10=2, var_1_11=66, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=2] [L94] EXPR (var_1_1 == ((signed char) ((var_1_2 + var_1_3) - ((((var_1_4) > ((var_1_5 + var_1_6))) ? (var_1_4) : ((var_1_5 + var_1_6))))))) && ((((~ var_1_5) * (var_1_6 & var_1_3)) >= var_1_4) ? (var_1_7 == ((double) var_1_8)) : (var_1_7 == ((double) var_1_9))) VAL [isInitial=1, var_1_10=2, var_1_11=66, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=2] [L94-L95] return (((((var_1_1 == ((signed char) ((var_1_2 + var_1_3) - ((((var_1_4) > ((var_1_5 + var_1_6))) ? (var_1_4) : ((var_1_5 + var_1_6))))))) && ((((~ var_1_5) * (var_1_6 & var_1_3)) >= var_1_4) ? (var_1_7 == ((double) var_1_8)) : (var_1_7 == ((double) var_1_9)))) && (var_1_10 == ((signed short int) ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2)))))) && ((! var_1_13) ? (var_1_11 == ((unsigned short int) (var_1_5 + (((((var_1_6) > (1)) ? (var_1_6) : (1))) + 64)))) : 1)) && (((var_1_6 / var_1_14) < -100) ? (var_1_13 == ((unsigned char) (! (! (! var_1_15))))) : (var_1_13 == ((unsigned char) (var_1_15 && var_1_16))))) && (var_1_17 == ((float) var_1_8)) ; [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2, var_1_11=66, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=2] [L19] reach_error() VAL [isInitial=1, var_1_10=2, var_1_11=66, var_1_13=0, var_1_14=3, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=0, var_1_2=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=2, var_1_8=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 105 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 5, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 314 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 271 mSDsluCounter, 709 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 427 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 629 IncrementalHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 282 mSDtfsCounter, 629 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 559 GetRequests, 515 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=4, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 133 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1092 NumberOfCodeBlocks, 1092 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 841 ConstructedInterpolants, 1 QuantifiedInterpolants, 2325 SizeOfPredicates, 4 NumberOfNonLiveVariables, 842 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 4695/4788 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:18:30,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-92.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 da2ee77b35405689fc5c65c91bc7d87d5288020b288dd575aada93fb6bdf0f20 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:18:32,526 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:18:32,600 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:18:32,604 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:18:32,605 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:18:32,628 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:18:32,630 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:18:32,630 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:18:32,630 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:18:32,630 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:18:32,631 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:18:32,631 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:18:32,631 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:18:32,631 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:18:32,631 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:18:32,631 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:18:32,631 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:18:32,631 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:18:32,631 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:18:32,631 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:18:32,631 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:18:32,631 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:18:32,631 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:18:32,632 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:18:32,632 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:18:32,632 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:18:32,632 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:18:32,632 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:18:32,632 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:18:32,632 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:18:32,632 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:18:32,632 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:18:32,632 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:18:32,632 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:18:32,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:18:32,632 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:18:32,632 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:18:32,632 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:18:32,632 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:18:32,633 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:18:32,633 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:18:32,633 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:18:32,633 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:18:32,633 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:18:32,634 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:18:32,634 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 -> da2ee77b35405689fc5c65c91bc7d87d5288020b288dd575aada93fb6bdf0f20 [2025-03-17 05:18:32,854 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:18:32,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:18:32,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:18:32,863 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:18:32,863 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:18:32,864 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-92.i [2025-03-17 05:18:34,165 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a39317292/e4e68418d17542f6820532e85100f324/FLAG597975882 [2025-03-17 05:18:34,347 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:18:34,347 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-92.i [2025-03-17 05:18:34,353 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a39317292/e4e68418d17542f6820532e85100f324/FLAG597975882 [2025-03-17 05:18:34,369 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a39317292/e4e68418d17542f6820532e85100f324 [2025-03-17 05:18:34,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:18:34,373 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:18:34,374 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:18:34,374 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:18:34,377 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:18:34,377 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:18:34" (1/1) ... [2025-03-17 05:18:34,378 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24f3bbf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:34, skipping insertion in model container [2025-03-17 05:18:34,378 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:18:34" (1/1) ... [2025-03-17 05:18:34,393 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:18:34,505 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-92.i[913,926] [2025-03-17 05:18:34,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:18:34,553 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:18:34,563 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-92.i[913,926] [2025-03-17 05:18:34,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:18:34,589 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:18:34,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:34 WrapperNode [2025-03-17 05:18:34,590 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:18:34,591 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:18:34,591 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:18:34,591 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:18:34,595 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:18:34" (1/1) ... [2025-03-17 05:18:34,601 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:18:34" (1/1) ... [2025-03-17 05:18:34,616 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 109 [2025-03-17 05:18:34,616 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:18:34,616 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:18:34,617 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:18:34,617 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:18:34,623 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:34" (1/1) ... [2025-03-17 05:18:34,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:34" (1/1) ... [2025-03-17 05:18:34,626 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:34" (1/1) ... [2025-03-17 05:18:34,641 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:18:34,642 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:34" (1/1) ... [2025-03-17 05:18:34,642 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:34" (1/1) ... [2025-03-17 05:18:34,647 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:34" (1/1) ... [2025-03-17 05:18:34,648 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:34" (1/1) ... [2025-03-17 05:18:34,649 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:34" (1/1) ... [2025-03-17 05:18:34,649 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:34" (1/1) ... [2025-03-17 05:18:34,651 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:18:34,653 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:18:34,653 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:18:34,653 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:18:34,654 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:34" (1/1) ... [2025-03-17 05:18:34,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:18:34,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:18:34,680 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:18:34,683 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:18:34,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:18:34,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:18:34,703 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:18:34,703 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:18:34,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:18:34,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:18:34,760 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:18:34,761 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:18:35,264 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 05:18:35,264 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:18:35,276 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:18:35,277 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:18:35,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:18:35 BoogieIcfgContainer [2025-03-17 05:18:35,278 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:18:35,281 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:18:35,281 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:18:35,286 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:18:35,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:18:34" (1/3) ... [2025-03-17 05:18:35,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39a4a34c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:18:35, skipping insertion in model container [2025-03-17 05:18:35,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:18:34" (2/3) ... [2025-03-17 05:18:35,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39a4a34c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:18:35, skipping insertion in model container [2025-03-17 05:18:35,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:18:35" (3/3) ... [2025-03-17 05:18:35,290 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-92.i [2025-03-17 05:18:35,302 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:18:35,304 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-92.i that has 2 procedures, 47 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:18:35,365 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:18:35,376 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;@238c7d6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:18:35,376 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:18:35,379 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 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:18:35,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 05:18:35,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:18:35,387 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] [2025-03-17 05:18:35,387 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:18:35,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:18:35,391 INFO L85 PathProgramCache]: Analyzing trace with hash -764194179, now seen corresponding path program 1 times [2025-03-17 05:18:35,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:18:35,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759129058] [2025-03-17 05:18:35,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:18:35,399 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:18:35,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:18:35,402 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:18:35,404 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:18:35,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 05:18:35,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 05:18:35,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:18:35,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:18:35,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:18:35,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:18:36,310 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 456 proven. 39 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-03-17 05:18:36,310 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:18:36,988 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:18:36,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1759129058] [2025-03-17 05:18:36,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1759129058] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:18:36,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1987940538] [2025-03-17 05:18:36,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:18:36,989 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:18:36,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:18:36,991 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 05:18:36,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Waiting until timeout for monitored process [2025-03-17 05:18:37,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 05:18:37,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 05:18:37,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:18:37,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:18:37,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 05:18:37,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:18:37,905 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 456 proven. 39 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-03-17 05:18:37,905 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:18:38,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1987940538] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:18:38,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:18:38,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2025-03-17 05:18:38,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452473748] [2025-03-17 05:18:38,230 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:18:38,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:18:38,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:18:38,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:18:38,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:18:38,250 INFO L87 Difference]: Start difference. First operand has 47 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 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 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 05:18:40,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:18:40,314 INFO L93 Difference]: Finished difference Result 103 states and 171 transitions. [2025-03-17 05:18:40,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:18:40,324 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 115 [2025-03-17 05:18:40,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:18:40,328 INFO L225 Difference]: With dead ends: 103 [2025-03-17 05:18:40,328 INFO L226 Difference]: Without dead ends: 57 [2025-03-17 05:18:40,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:18:40,332 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 39 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:18:40,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 142 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-17 05:18:40,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-17 05:18:40,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2025-03-17 05:18:40,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:18:40,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2025-03-17 05:18:40,359 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 71 transitions. Word has length 115 [2025-03-17 05:18:40,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:18:40,360 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 71 transitions. [2025-03-17 05:18:40,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 05:18:40,360 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 71 transitions. [2025-03-17 05:18:40,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 05:18:40,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:18:40,365 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] [2025-03-17 05:18:40,374 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:18:40,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Ended with exit code 0 [2025-03-17 05:18:40,769 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,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-17 05:18:40,769 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:18:40,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:18:40,770 INFO L85 PathProgramCache]: Analyzing trace with hash -735565028, now seen corresponding path program 1 times [2025-03-17 05:18:40,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:18:40,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [473314723] [2025-03-17 05:18:40,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:18:40,770 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:18:40,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:18:40,772 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:18:40,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 05:18:40,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 05:18:40,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 05:18:40,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:18:40,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:18:40,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-17 05:18:40,961 INFO L279 TraceCheckSpWp]: Computing forward predicates...