./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p07.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p07.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 8338394bbd81b76c0af2e2b3c250f2417497d2ccb212191358f27d2f0c0279c8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:37:52,353 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:37:52,423 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 09:37:52,430 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:37:52,430 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:37:52,455 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:37:52,456 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:37:52,456 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:37:52,457 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:37:52,457 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:37:52,458 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:37:52,458 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:37:52,458 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:37:52,458 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:37:52,459 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:37:52,459 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:37:52,459 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:37:52,459 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 09:37:52,459 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:37:52,459 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:37:52,459 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:37:52,460 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:37:52,460 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:37:52,460 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:37:52,460 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:37:52,460 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:37:52,460 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:37:52,460 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:37:52,460 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:37:52,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:37:52,460 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:37:52,461 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:37:52,461 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:37:52,461 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:37:52,461 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 09:37:52,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 09:37:52,461 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:37:52,462 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:37:52,462 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:37:52,462 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:37:52,462 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8338394bbd81b76c0af2e2b3c250f2417497d2ccb212191358f27d2f0c0279c8 [2025-03-08 09:37:52,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:37:52,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:37:52,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:37:52,702 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:37:52,702 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:37:52,703 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p07.c [2025-03-08 09:37:53,851 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08662b28d/97468fa92551421c86682fb9aea69c46/FLAG2870b8510 [2025-03-08 09:37:54,061 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:37:54,062 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p07.c [2025-03-08 09:37:54,087 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08662b28d/97468fa92551421c86682fb9aea69c46/FLAG2870b8510 [2025-03-08 09:37:54,427 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08662b28d/97468fa92551421c86682fb9aea69c46 [2025-03-08 09:37:54,430 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:37:54,431 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:37:54,432 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:37:54,432 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:37:54,436 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:37:54,436 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:37:54" (1/1) ... [2025-03-08 09:37:54,438 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11369eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:54, skipping insertion in model container [2025-03-08 09:37:54,438 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:37:54" (1/1) ... [2025-03-08 09:37:54,455 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:37:54,552 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/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p07.c[1266,1279] [2025-03-08 09:37:54,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:37:54,625 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:37:54,634 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/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p07.c[1266,1279] [2025-03-08 09:37:54,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:37:54,672 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:37:54,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:54 WrapperNode [2025-03-08 09:37:54,673 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:37:54,674 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:37:54,674 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:37:54,674 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:37:54,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:54" (1/1) ... [2025-03-08 09:37:54,690 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:54" (1/1) ... [2025-03-08 09:37:54,732 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 401 [2025-03-08 09:37:54,732 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:37:54,733 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:37:54,733 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:37:54,733 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:37:54,740 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:54" (1/1) ... [2025-03-08 09:37:54,740 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:54" (1/1) ... [2025-03-08 09:37:54,747 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:54" (1/1) ... [2025-03-08 09:37:54,774 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-08 09:37:54,775 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:54" (1/1) ... [2025-03-08 09:37:54,775 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:54" (1/1) ... [2025-03-08 09:37:54,787 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:54" (1/1) ... [2025-03-08 09:37:54,794 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:54" (1/1) ... [2025-03-08 09:37:54,797 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:54" (1/1) ... [2025-03-08 09:37:54,799 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:54" (1/1) ... [2025-03-08 09:37:54,810 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:37:54,810 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:37:54,810 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:37:54,810 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:37:54,811 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:54" (1/1) ... [2025-03-08 09:37:54,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:37:54,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:37:54,836 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-08 09:37:54,838 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-08 09:37:54,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:37:54,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 09:37:54,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:37:54,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:37:54,952 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:37:54,954 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:37:55,348 INFO L? ?]: Removed 172 outVars from TransFormulas that were not future-live. [2025-03-08 09:37:55,349 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:37:55,374 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:37:55,374 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:37:55,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:37:55 BoogieIcfgContainer [2025-03-08 09:37:55,375 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:37:55,392 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:37:55,392 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:37:55,395 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:37:55,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:37:54" (1/3) ... [2025-03-08 09:37:55,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be01893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:37:55, skipping insertion in model container [2025-03-08 09:37:55,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:54" (2/3) ... [2025-03-08 09:37:55,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be01893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:37:55, skipping insertion in model container [2025-03-08 09:37:55,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:37:55" (3/3) ... [2025-03-08 09:37:55,398 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p07.c [2025-03-08 09:37:55,409 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:37:55,411 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p07.c that has 1 procedures, 78 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:37:55,450 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:37:55,459 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;@4053fc07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:37:55,460 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:37:55,463 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 76 states have (on average 1.486842105263158) internal successors, (113), 77 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:55,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 09:37:55,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:37:55,470 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 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-08 09:37:55,470 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:37:55,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:37:55,474 INFO L85 PathProgramCache]: Analyzing trace with hash -921371761, now seen corresponding path program 1 times [2025-03-08 09:37:55,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:37:55,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083791467] [2025-03-08 09:37:55,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:37:55,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:37:55,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 09:37:55,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 09:37:55,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:37:55,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:37:55,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:37:55,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:37:55,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083791467] [2025-03-08 09:37:55,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083791467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:37:55,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:37:55,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:37:55,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138022109] [2025-03-08 09:37:55,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:37:55,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:37:55,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:37:55,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:37:55,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:37:55,936 INFO L87 Difference]: Start difference. First operand has 78 states, 76 states have (on average 1.486842105263158) internal successors, (113), 77 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:56,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:37:56,008 INFO L93 Difference]: Finished difference Result 125 states and 183 transitions. [2025-03-08 09:37:56,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:37:56,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-08 09:37:56,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:37:56,014 INFO L225 Difference]: With dead ends: 125 [2025-03-08 09:37:56,014 INFO L226 Difference]: Without dead ends: 77 [2025-03-08 09:37:56,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:37:56,018 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:37:56,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 265 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:37:56,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-08 09:37:56,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-08 09:37:56,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.4605263157894737) internal successors, (111), 76 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:56,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 111 transitions. [2025-03-08 09:37:56,041 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 111 transitions. Word has length 29 [2025-03-08 09:37:56,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:37:56,042 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 111 transitions. [2025-03-08 09:37:56,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:56,042 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 111 transitions. [2025-03-08 09:37:56,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 09:37:56,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:37:56,043 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 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-08 09:37:56,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 09:37:56,043 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:37:56,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:37:56,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1506925661, now seen corresponding path program 1 times [2025-03-08 09:37:56,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:37:56,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714464118] [2025-03-08 09:37:56,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:37:56,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:37:56,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 09:37:56,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 09:37:56,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:37:56,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:37:56,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:37:56,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:37:56,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714464118] [2025-03-08 09:37:56,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714464118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:37:56,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:37:56,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:37:56,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046401581] [2025-03-08 09:37:56,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:37:56,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:37:56,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:37:56,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:37:56,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:37:56,212 INFO L87 Difference]: Start difference. First operand 77 states and 111 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:56,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:37:56,278 INFO L93 Difference]: Finished difference Result 126 states and 181 transitions. [2025-03-08 09:37:56,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:37:56,278 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-08 09:37:56,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:37:56,280 INFO L225 Difference]: With dead ends: 126 [2025-03-08 09:37:56,280 INFO L226 Difference]: Without dead ends: 79 [2025-03-08 09:37:56,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:37:56,281 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:37:56,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 262 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:37:56,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-08 09:37:56,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-08 09:37:56,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 78 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:56,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 113 transitions. [2025-03-08 09:37:56,288 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 113 transitions. Word has length 30 [2025-03-08 09:37:56,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:37:56,288 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 113 transitions. [2025-03-08 09:37:56,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:56,291 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 113 transitions. [2025-03-08 09:37:56,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 09:37:56,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:37:56,292 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 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-08 09:37:56,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 09:37:56,292 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:37:56,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:37:56,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1401564490, now seen corresponding path program 1 times [2025-03-08 09:37:56,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:37:56,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549629314] [2025-03-08 09:37:56,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:37:56,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:37:56,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 09:37:56,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 09:37:56,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:37:56,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:37:56,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:37:56,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:37:56,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549629314] [2025-03-08 09:37:56,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549629314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:37:56,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:37:56,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 09:37:56,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648274449] [2025-03-08 09:37:56,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:37:56,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 09:37:56,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:37:56,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 09:37:56,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:37:56,557 INFO L87 Difference]: Start difference. First operand 79 states and 113 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:56,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:37:56,663 INFO L93 Difference]: Finished difference Result 132 states and 188 transitions. [2025-03-08 09:37:56,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 09:37:56,664 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-08 09:37:56,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:37:56,664 INFO L225 Difference]: With dead ends: 132 [2025-03-08 09:37:56,664 INFO L226 Difference]: Without dead ends: 83 [2025-03-08 09:37:56,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:37:56,665 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 94 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 09:37:56,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 315 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 09:37:56,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-08 09:37:56,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2025-03-08 09:37:56,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 81 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:56,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 116 transitions. [2025-03-08 09:37:56,670 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 116 transitions. Word has length 31 [2025-03-08 09:37:56,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:37:56,670 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 116 transitions. [2025-03-08 09:37:56,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:56,671 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 116 transitions. [2025-03-08 09:37:56,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-08 09:37:56,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:37:56,672 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 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-08 09:37:56,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 09:37:56,673 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:37:56,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:37:56,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1225532559, now seen corresponding path program 1 times [2025-03-08 09:37:56,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:37:56,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992206417] [2025-03-08 09:37:56,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:37:56,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:37:56,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 09:37:56,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 09:37:56,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:37:56,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:37:56,726 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 09:37:56,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 09:37:56,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 09:37:56,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:37:56,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:37:56,780 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 09:37:56,781 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 09:37:56,782 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 09:37:56,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 09:37:56,785 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-08 09:37:56,804 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-08 09:37:56,814 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 09:37:56,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:37:56 BoogieIcfgContainer [2025-03-08 09:37:56,818 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 09:37:56,819 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 09:37:56,819 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 09:37:56,819 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 09:37:56,819 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:37:55" (3/4) ... [2025-03-08 09:37:56,821 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 09:37:56,821 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 09:37:56,822 INFO L158 Benchmark]: Toolchain (without parser) took 2391.12ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 52.9MB in the end (delta: 57.4MB). Peak memory consumption was 56.2MB. Max. memory is 16.1GB. [2025-03-08 09:37:56,822 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:37:56,822 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.91ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 94.3MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 09:37:56,823 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.36ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 88.1MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 09:37:56,823 INFO L158 Benchmark]: Boogie Preprocessor took 76.83ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 83.7MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:37:56,823 INFO L158 Benchmark]: IcfgBuilder took 564.73ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 38.9MB in the end (delta: 44.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-08 09:37:56,823 INFO L158 Benchmark]: TraceAbstraction took 1426.16ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 53.0MB in the end (delta: 53.0MB). Peak memory consumption was 48.9MB. Max. memory is 16.1GB. [2025-03-08 09:37:56,824 INFO L158 Benchmark]: Witness Printer took 2.78ms. Allocated memory is still 142.6MB. Free memory was 53.0MB in the beginning and 52.9MB in the end (delta: 24.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:37:56,824 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.15ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 241.91ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 94.3MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.36ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 88.1MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.83ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 83.7MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 564.73ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 38.9MB in the end (delta: 44.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1426.16ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 53.0MB in the end (delta: 53.0MB). Peak memory consumption was 48.9MB. Max. memory is 16.1GB. * Witness Printer took 2.78ms. Allocated memory is still 142.6MB. Free memory was 53.0MB in the beginning and 52.9MB in the end (delta: 24.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: 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 bitwiseAnd at line 139. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 8); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (8 - 1); [L32] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 32); [L33] const SORT_10 msb_SORT_10 = (SORT_10)1 << (32 - 1); [L35] const SORT_31 mask_SORT_31 = (SORT_31)-1 >> (sizeof(SORT_31) * 8 - 4); [L36] const SORT_31 msb_SORT_31 = (SORT_31)1 << (4 - 1); [L38] const SORT_67 mask_SORT_67 = (SORT_67)-1 >> (sizeof(SORT_67) * 8 - 10); [L39] const SORT_67 msb_SORT_67 = (SORT_67)1 << (10 - 1); [L41] const SORT_1 var_7 = 0; [L42] const SORT_10 var_12 = 0; [L43] const SORT_1 var_21 = 1; [L45] SORT_1 input_2; [L46] SORT_3 input_4; [L47] SORT_1 input_5; [L48] SORT_1 input_6; [L49] SORT_1 input_29; [L50] SORT_31 input_32; [L51] SORT_1 input_34; [L52] SORT_31 input_36; [L53] SORT_1 input_38; [L54] SORT_1 input_40; [L55] SORT_1 input_44; [L56] SORT_1 input_46; [L57] SORT_1 input_48; [L58] SORT_1 input_50; [L59] SORT_3 input_52; [L60] SORT_1 input_55; [L61] SORT_1 input_59; [L62] SORT_1 input_63; [L63] SORT_1 input_65; [L64] SORT_67 input_68; [L65] SORT_1 input_70; [L66] SORT_1 input_72; [L67] SORT_1 input_82; [L68] SORT_1 input_88; [L70] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_12=0, var_21=1, var_7=0] [L70] SORT_1 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L71] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_12=0, var_21=1, var_7=0] [L71] SORT_1 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L72] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_12=0, var_21=1, var_7=0] [L72] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L73] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_12=0, var_21=1, var_7=0] [L73] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L74] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_12=0, var_21=1, var_7=0] [L74] SORT_1 state_42 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_12=0, var_21=1, var_7=0] [L75] SORT_1 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L76] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_12=0, var_21=1, var_7=0] [L76] SORT_1 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] SORT_1 init_9_arg_1 = var_7; [L79] state_8 = init_9_arg_1 [L80] SORT_1 init_15_arg_1 = var_7; [L81] state_14 = init_15_arg_1 [L82] SORT_1 init_26_arg_1 = var_7; [L83] state_25 = init_26_arg_1 [L84] SORT_1 init_28_arg_1 = var_7; [L85] state_27 = init_28_arg_1 [L86] SORT_1 init_43_arg_1 = var_7; [L87] state_42 = init_43_arg_1 [L88] SORT_1 init_58_arg_1 = var_7; [L89] state_57 = init_58_arg_1 [L90] SORT_1 init_62_arg_1 = var_7; [L91] state_61 = init_62_arg_1 VAL [mask_SORT_1=1, state_14=0, state_25=0, state_27=0, state_42=0, state_57=0, state_61=0, state_8=0, var_12=0, var_21=1, var_7=0] [L94] input_2 = __VERIFIER_nondet_uchar() [L95] input_4 = __VERIFIER_nondet_uchar() [L96] input_5 = __VERIFIER_nondet_uchar() [L97] input_6 = __VERIFIER_nondet_uchar() [L98] input_29 = __VERIFIER_nondet_uchar() [L99] input_32 = __VERIFIER_nondet_uchar() [L100] input_34 = __VERIFIER_nondet_uchar() [L101] input_36 = __VERIFIER_nondet_uchar() [L102] input_38 = __VERIFIER_nondet_uchar() [L103] input_40 = __VERIFIER_nondet_uchar() [L104] input_44 = __VERIFIER_nondet_uchar() [L105] input_46 = __VERIFIER_nondet_uchar() [L106] input_48 = __VERIFIER_nondet_uchar() [L107] input_50 = __VERIFIER_nondet_uchar() [L108] input_52 = __VERIFIER_nondet_uchar() [L109] input_55 = __VERIFIER_nondet_uchar() [L110] input_59 = __VERIFIER_nondet_uchar() [L111] input_63 = __VERIFIER_nondet_uchar() [L112] input_65 = __VERIFIER_nondet_uchar() [L113] input_68 = __VERIFIER_nondet_ushort() [L114] input_70 = __VERIFIER_nondet_uchar() [L115] input_72 = __VERIFIER_nondet_uchar() [L116] input_82 = __VERIFIER_nondet_uchar() [L117] input_88 = __VERIFIER_nondet_uchar() [L120] SORT_1 var_11_arg_0 = state_8; VAL [mask_SORT_1=1, state_14=0, state_25=0, state_27=0, state_42=0, state_57=0, state_61=0, state_8=0, var_11_arg_0=0, var_12=0, var_21=1, var_7=0] [L121] EXPR var_11_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, state_14=0, state_25=0, state_27=0, state_42=0, state_57=0, state_61=0, state_8=0, var_12=0, var_21=1, var_7=0] [L121] var_11_arg_0 = var_11_arg_0 & mask_SORT_1 [L122] SORT_10 var_11 = var_11_arg_0; [L123] SORT_10 var_13_arg_0 = var_11; [L124] SORT_10 var_13_arg_1 = var_12; [L125] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L126] SORT_1 var_16_arg_0 = state_14; VAL [mask_SORT_1=1, state_14=0, state_25=0, state_27=0, state_42=0, state_57=0, state_61=0, state_8=0, var_12=0, var_13=1, var_16_arg_0=0, var_21=1, var_7=0] [L127] EXPR var_16_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, state_14=0, state_25=0, state_27=0, state_42=0, state_57=0, state_61=0, state_8=0, var_12=0, var_13=1, var_21=1, var_7=0] [L127] var_16_arg_0 = var_16_arg_0 & mask_SORT_1 [L128] SORT_10 var_16 = var_16_arg_0; [L129] SORT_10 var_17_arg_0 = var_16; [L130] SORT_10 var_17_arg_1 = var_12; [L131] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L132] SORT_1 var_18_arg_0 = var_13; [L133] SORT_1 var_18_arg_1 = var_17; VAL [mask_SORT_1=1, state_14=0, state_25=0, state_27=0, state_42=0, state_57=0, state_61=0, state_8=0, var_12=0, var_18_arg_0=1, var_18_arg_1=1, var_21=1, var_7=0] [L134] EXPR var_18_arg_0 | var_18_arg_1 VAL [mask_SORT_1=1, state_14=0, state_25=0, state_27=0, state_42=0, state_57=0, state_61=0, state_8=0, var_12=0, var_21=1, var_7=0] [L134] SORT_1 var_18 = var_18_arg_0 | var_18_arg_1; [L135] SORT_1 var_22_arg_0 = var_18; [L136] SORT_1 var_22 = ~var_22_arg_0; [L137] SORT_1 var_23_arg_0 = var_21; [L138] SORT_1 var_23_arg_1 = var_22; VAL [mask_SORT_1=1, state_14=0, state_25=0, state_27=0, state_42=0, state_57=0, state_61=0, state_8=0, var_12=0, var_21=1, var_23_arg_0=1, var_23_arg_1=-2, var_7=0] [L139] EXPR var_23_arg_0 & var_23_arg_1 VAL [mask_SORT_1=1, state_14=0, state_25=0, state_27=0, state_42=0, state_57=0, state_61=0, state_8=0, var_12=0, var_21=1, var_7=0] [L139] SORT_1 var_23 = var_23_arg_0 & var_23_arg_1; [L140] EXPR var_23 & mask_SORT_1 VAL [mask_SORT_1=1, state_14=0, state_25=0, state_27=0, state_42=0, state_57=0, state_61=0, state_8=0, var_12=0, var_21=1, var_7=0] [L140] var_23 = var_23 & mask_SORT_1 [L141] SORT_1 bad_24_arg_0 = var_23; [L142] CALL __VERIFIER_assert(!(bad_24_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 78 locations, 113 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 94 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 94 mSDsluCounter, 842 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 581 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 241 IncrementalHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 261 mSDtfsCounter, 241 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=3, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 122 NumberOfCodeBlocks, 122 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 87 ConstructedInterpolants, 0 QuantifiedInterpolants, 171 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 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-08 09:37:56,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p07.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 8338394bbd81b76c0af2e2b3c250f2417497d2ccb212191358f27d2f0c0279c8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:37:58,702 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:37:58,770 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-08 09:37:58,778 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:37:58,782 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:37:58,802 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:37:58,803 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:37:58,803 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:37:58,803 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:37:58,803 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:37:58,803 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:37:58,803 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:37:58,804 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:37:58,804 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:37:58,804 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:37:58,804 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:37:58,804 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:37:58,804 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:37:58,804 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:37:58,804 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:37:58,804 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:37:58,804 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 09:37:58,804 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 09:37:58,804 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 09:37:58,804 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:37:58,804 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:37:58,804 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:37:58,805 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:37:58,805 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:37:58,805 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:37:58,805 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:37:58,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:37:58,805 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:37:58,805 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:37:58,805 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:37:58,805 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:37:58,805 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 09:37:58,805 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 09:37:58,805 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:37:58,805 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:37:58,805 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:37:58,805 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:37:58,808 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8338394bbd81b76c0af2e2b3c250f2417497d2ccb212191358f27d2f0c0279c8 [2025-03-08 09:37:59,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:37:59,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:37:59,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:37:59,062 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:37:59,062 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:37:59,063 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p07.c [2025-03-08 09:38:00,249 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edc6a0193/e9a39fc4297f4110b3f0d267c03334d5/FLAG4e8e5801e [2025-03-08 09:38:00,441 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:38:00,443 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p07.c [2025-03-08 09:38:00,451 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edc6a0193/e9a39fc4297f4110b3f0d267c03334d5/FLAG4e8e5801e [2025-03-08 09:38:00,808 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edc6a0193/e9a39fc4297f4110b3f0d267c03334d5 [2025-03-08 09:38:00,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:38:00,811 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:38:00,812 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:38:00,812 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:38:00,814 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:38:00,815 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:38:00" (1/1) ... [2025-03-08 09:38:00,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@464e9874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:00, skipping insertion in model container [2025-03-08 09:38:00,815 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:38:00" (1/1) ... [2025-03-08 09:38:00,826 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:38:00,927 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/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p07.c[1266,1279] [2025-03-08 09:38:00,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:38:01,006 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:38:01,013 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/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p07.c[1266,1279] [2025-03-08 09:38:01,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:38:01,062 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:38:01,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:01 WrapperNode [2025-03-08 09:38:01,063 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:38:01,064 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:38:01,064 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:38:01,064 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:38:01,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:01" (1/1) ... [2025-03-08 09:38:01,079 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:01" (1/1) ... [2025-03-08 09:38:01,104 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 265 [2025-03-08 09:38:01,104 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:38:01,104 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:38:01,104 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:38:01,104 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:38:01,114 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:01" (1/1) ... [2025-03-08 09:38:01,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:01" (1/1) ... [2025-03-08 09:38:01,119 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:01" (1/1) ... [2025-03-08 09:38:01,139 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-08 09:38:01,140 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:01" (1/1) ... [2025-03-08 09:38:01,140 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:01" (1/1) ... [2025-03-08 09:38:01,146 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:01" (1/1) ... [2025-03-08 09:38:01,149 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:01" (1/1) ... [2025-03-08 09:38:01,150 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:01" (1/1) ... [2025-03-08 09:38:01,151 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:01" (1/1) ... [2025-03-08 09:38:01,153 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:38:01,154 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:38:01,154 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:38:01,154 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:38:01,155 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:01" (1/1) ... [2025-03-08 09:38:01,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:38:01,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:38:01,179 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-08 09:38:01,183 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-08 09:38:01,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:38:01,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 09:38:01,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:38:01,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:38:01,275 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:38:01,276 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:38:01,454 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2025-03-08 09:38:01,454 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:38:01,461 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:38:01,462 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:38:01,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:38:01 BoogieIcfgContainer [2025-03-08 09:38:01,463 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:38:01,465 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:38:01,465 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:38:01,468 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:38:01,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:38:00" (1/3) ... [2025-03-08 09:38:01,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5de1c687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:38:01, skipping insertion in model container [2025-03-08 09:38:01,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:01" (2/3) ... [2025-03-08 09:38:01,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5de1c687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:38:01, skipping insertion in model container [2025-03-08 09:38:01,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:38:01" (3/3) ... [2025-03-08 09:38:01,470 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p07.c [2025-03-08 09:38:01,480 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:38:01,482 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p07.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:38:01,510 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:38:01,518 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;@25e9ce62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:38:01,518 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:38:01,521 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:01,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 09:38:01,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:38:01,525 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 09:38:01,525 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:38:01,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:38:01,530 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-08 09:38:01,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:38:01,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [657023314] [2025-03-08 09:38:01,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:38:01,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:38:01,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:38:01,542 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-08 09:38:01,544 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-08 09:38:01,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 09:38:01,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 09:38:01,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:38:01,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:38:01,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 09:38:01,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:38:01,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:38:01,813 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:38:01,814 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:38:01,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657023314] [2025-03-08 09:38:01,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657023314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:38:01,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:38:01,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:38:01,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125648277] [2025-03-08 09:38:01,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:38:01,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:38:01,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:38:01,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:38:01,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:38:01,833 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:01,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:38:01,867 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-03-08 09:38:01,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:38:01,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-08 09:38:01,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:38:01,875 INFO L225 Difference]: With dead ends: 18 [2025-03-08 09:38:01,876 INFO L226 Difference]: Without dead ends: 10 [2025-03-08 09:38:01,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:38:01,881 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 09:38:01,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:38:01,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-08 09:38:01,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-08 09:38:01,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:01,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-08 09:38:01,902 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-08 09:38:01,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:38:01,902 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-08 09:38:01,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:01,902 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-08 09:38:01,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 09:38:01,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:38:01,903 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-08 09:38:01,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 09:38:02,105 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 [2025-03-08 09:38:02,106 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:38:02,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:38:02,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-08 09:38:02,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:38:02,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2087750082] [2025-03-08 09:38:02,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:38:02,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:38:02,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:38:02,110 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-08 09:38:02,110 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-08 09:38:02,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 09:38:02,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 09:38:02,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:38:02,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:38:02,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 09:38:02,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:38:02,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:38:02,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:38:02,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:38:02,813 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:38:02,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087750082] [2025-03-08 09:38:02,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087750082] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 09:38:02,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 09:38:02,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-08 09:38:02,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792249040] [2025-03-08 09:38:02,815 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 09:38:02,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 09:38:02,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:38:02,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 09:38:02,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 09:38:02,816 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:02,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:38:02,876 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2025-03-08 09:38:02,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 09:38:02,876 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-08 09:38:02,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:38:02,877 INFO L225 Difference]: With dead ends: 15 [2025-03-08 09:38:02,877 INFO L226 Difference]: Without dead ends: 13 [2025-03-08 09:38:02,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-08 09:38:02,878 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 09:38:02,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 19 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:38:02,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-03-08 09:38:02,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2025-03-08 09:38:02,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:02,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2025-03-08 09:38:02,881 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2025-03-08 09:38:02,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:38:02,882 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2025-03-08 09:38:02,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:02,882 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2025-03-08 09:38:02,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 09:38:02,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:38:02,882 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-03-08 09:38:02,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 09:38:03,087 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 [2025-03-08 09:38:03,087 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:38:03,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:38:03,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1791040441, now seen corresponding path program 2 times [2025-03-08 09:38:03,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:38:03,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1035407450] [2025-03-08 09:38:03,088 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 09:38:03,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:38:03,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:38:03,090 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-08 09:38:03,092 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-08 09:38:03,167 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-08 09:38:03,186 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 09:38:03,186 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 09:38:03,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:38:03,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-08 09:38:03,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:38:03,362 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:38:03,362 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:38:05,585 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:38:05,585 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:38:05,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035407450] [2025-03-08 09:38:05,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035407450] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 09:38:05,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 09:38:05,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-03-08 09:38:05,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599233105] [2025-03-08 09:38:05,586 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 09:38:05,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 09:38:05,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:38:05,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 09:38:05,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-08 09:38:05,587 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:05,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:38:05,676 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2025-03-08 09:38:05,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 09:38:05,676 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-08 09:38:05,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:38:05,677 INFO L225 Difference]: With dead ends: 18 [2025-03-08 09:38:05,677 INFO L226 Difference]: Without dead ends: 16 [2025-03-08 09:38:05,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2025-03-08 09:38:05,677 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 09:38:05,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 23 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:38:05,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-08 09:38:05,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2025-03-08 09:38:05,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:05,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2025-03-08 09:38:05,680 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2025-03-08 09:38:05,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:38:05,680 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2025-03-08 09:38:05,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:05,680 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2025-03-08 09:38:05,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 09:38:05,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:38:05,680 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2025-03-08 09:38:05,687 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-08 09:38:05,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:38:05,881 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:38:05,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:38:05,881 INFO L85 PathProgramCache]: Analyzing trace with hash -506187805, now seen corresponding path program 3 times [2025-03-08 09:38:05,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:38:05,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [570037009] [2025-03-08 09:38:05,882 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 09:38:05,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:38:05,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:38:05,884 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-08 09:38:05,885 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-08 09:38:06,022 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 4 equivalence classes. [2025-03-08 09:38:06,048 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 09:38:06,048 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-08 09:38:06,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:38:06,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-08 09:38:06,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:38:06,294 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:38:06,295 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:38:51,732 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 09:38:51,732 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:38:51,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570037009] [2025-03-08 09:38:51,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570037009] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 09:38:51,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 09:38:51,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-03-08 09:38:51,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524135792] [2025-03-08 09:38:51,732 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 09:38:51,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 09:38:51,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:38:51,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 09:38:51,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-08 09:38:51,733 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:51,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:38:51,757 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2025-03-08 09:38:51,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:38:51,758 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-08 09:38:51,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:38:51,758 INFO L225 Difference]: With dead ends: 15 [2025-03-08 09:38:51,758 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 09:38:51,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-08 09:38:51,759 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 09:38:51,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:38:51,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 09:38:51,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 09:38:51,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:51,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 09:38:51,761 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2025-03-08 09:38:51,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:38:51,761 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 09:38:51,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:38:51,761 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 09:38:51,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 09:38:51,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 09:38:51,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 09:38:51,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:38:51,969 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-03-08 09:38:51,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 09:38:52,002 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 09:38:52,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:38:52 BoogieIcfgContainer [2025-03-08 09:38:52,009 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 09:38:52,010 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 09:38:52,010 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 09:38:52,010 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 09:38:52,011 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:38:01" (3/4) ... [2025-03-08 09:38:52,012 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 09:38:52,019 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-08 09:38:52,019 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 09:38:52,020 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 09:38:52,020 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 09:38:52,084 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 09:38:52,084 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 09:38:52,084 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 09:38:52,086 INFO L158 Benchmark]: Toolchain (without parser) took 51274.11ms. Allocated memory was 117.4MB in the beginning and 788.5MB in the end (delta: 671.1MB). Free memory was 90.5MB in the beginning and 349.5MB in the end (delta: -259.0MB). Peak memory consumption was 411.5MB. Max. memory is 16.1GB. [2025-03-08 09:38:52,086 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory was 61.0MB in the beginning and 61.0MB in the end (delta: 18.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:38:52,087 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.80ms. Allocated memory is still 117.4MB. Free memory was 90.4MB in the beginning and 75.1MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 09:38:52,087 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.13ms. Allocated memory is still 117.4MB. Free memory was 75.1MB in the beginning and 72.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:38:52,087 INFO L158 Benchmark]: Boogie Preprocessor took 48.86ms. Allocated memory is still 117.4MB. Free memory was 72.8MB in the beginning and 70.5MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:38:52,087 INFO L158 Benchmark]: IcfgBuilder took 308.98ms. Allocated memory is still 117.4MB. Free memory was 70.5MB in the beginning and 49.7MB in the end (delta: 20.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 09:38:52,087 INFO L158 Benchmark]: TraceAbstraction took 50544.61ms. Allocated memory was 117.4MB in the beginning and 788.5MB in the end (delta: 671.1MB). Free memory was 49.0MB in the beginning and 357.8MB in the end (delta: -308.8MB). Peak memory consumption was 361.2MB. Max. memory is 16.1GB. [2025-03-08 09:38:52,088 INFO L158 Benchmark]: Witness Printer took 74.59ms. Allocated memory is still 788.5MB. Free memory was 357.8MB in the beginning and 349.5MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 09:38:52,089 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.14ms. Allocated memory is still 83.9MB. Free memory was 61.0MB in the beginning and 61.0MB in the end (delta: 18.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 251.80ms. Allocated memory is still 117.4MB. Free memory was 90.4MB in the beginning and 75.1MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.13ms. Allocated memory is still 117.4MB. Free memory was 75.1MB in the beginning and 72.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.86ms. Allocated memory is still 117.4MB. Free memory was 72.8MB in the beginning and 70.5MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 308.98ms. Allocated memory is still 117.4MB. Free memory was 70.5MB in the beginning and 49.7MB in the end (delta: 20.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 50544.61ms. Allocated memory was 117.4MB in the beginning and 788.5MB in the end (delta: 671.1MB). Free memory was 49.0MB in the beginning and 357.8MB in the end (delta: -308.8MB). Peak memory consumption was 361.2MB. Max. memory is 16.1GB. * Witness Printer took 74.59ms. Allocated memory is still 788.5MB. Free memory was 357.8MB in the beginning and 349.5MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. 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 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 11 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 50.5s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 64 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 68 IncrementalHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 14 mSDtfsCounter, 68 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=3, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 48.9s InterpolantComputationTime, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 64 ConstructedInterpolants, 21 QuantifiedInterpolants, 72994 SizeOfPredicates, 27 NumberOfNonLiveVariables, 422 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 0/48 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 92]: Location Invariant Derived location invariant: ((((((((0 == var_7) && (0 == state_42)) && (0 == state_27)) && (0 == state_8)) && (0 == var_12)) && (1 == mask_SORT_1)) && (0 == state_61)) && (0 == state_57)) RESULT: Ultimate proved your program to be correct! [2025-03-08 09:38:52,130 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 Writing output log to file Ultimate.log Result: TRUE