./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal17.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal17.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 c94b3661676652faea857d81dc0e0e26cd1d6a51b23eb72c98391fe2e83a67ae --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 21:16:20,427 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 21:16:20,485 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 21:16:20,489 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 21:16:20,489 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 21:16:20,510 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 21:16:20,510 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 21:16:20,510 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 21:16:20,511 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 21:16:20,511 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 21:16:20,512 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 21:16:20,512 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 21:16:20,512 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 21:16:20,512 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 21:16:20,512 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 21:16:20,513 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 21:16:20,513 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 21:16:20,513 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 21:16:20,513 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 21:16:20,513 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 21:16:20,513 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 21:16:20,513 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 21:16:20,513 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 21:16:20,513 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 21:16:20,513 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 21:16:20,513 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 21:16:20,514 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 21:16:20,514 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 21:16:20,514 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 21:16:20,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:16:20,514 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 21:16:20,514 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 21:16:20,514 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 21:16:20,514 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 21:16:20,515 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 21:16:20,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 21:16:20,515 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 21:16:20,515 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 21:16:20,515 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 21:16:20,515 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 21:16:20,515 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 -> c94b3661676652faea857d81dc0e0e26cd1d6a51b23eb72c98391fe2e83a67ae [2025-03-16 21:16:20,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 21:16:20,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 21:16:20,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 21:16:20,736 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 21:16:20,736 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 21:16:20,737 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal17.c [2025-03-16 21:16:21,845 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d63b00605/064625401b1d42eab9b5219e266333f0/FLAG8896eb8cd [2025-03-16 21:16:22,071 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 21:16:22,071 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal17.c [2025-03-16 21:16:22,085 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d63b00605/064625401b1d42eab9b5219e266333f0/FLAG8896eb8cd [2025-03-16 21:16:22,404 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d63b00605/064625401b1d42eab9b5219e266333f0 [2025-03-16 21:16:22,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 21:16:22,409 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 21:16:22,410 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 21:16:22,410 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 21:16:22,415 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 21:16:22,416 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:16:22" (1/1) ... [2025-03-16 21:16:22,418 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66248c48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:16:22, skipping insertion in model container [2025-03-16 21:16:22,418 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:16:22" (1/1) ... [2025-03-16 21:16:22,433 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 21:16:22,539 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.cal17.c[1245,1258] [2025-03-16 21:16:22,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:16:22,610 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 21:16:22,616 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.cal17.c[1245,1258] [2025-03-16 21:16:22,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:16:22,655 INFO L204 MainTranslator]: Completed translation [2025-03-16 21:16:22,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:16:22 WrapperNode [2025-03-16 21:16:22,656 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 21:16:22,656 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 21:16:22,656 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 21:16:22,656 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 21:16:22,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:16:22" (1/1) ... [2025-03-16 21:16:22,668 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:16:22" (1/1) ... [2025-03-16 21:16:22,708 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 294 [2025-03-16 21:16:22,708 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 21:16:22,709 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 21:16:22,709 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 21:16:22,709 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 21:16:22,715 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:16:22" (1/1) ... [2025-03-16 21:16:22,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:16:22" (1/1) ... [2025-03-16 21:16:22,723 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:16:22" (1/1) ... [2025-03-16 21:16:22,745 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-03-16 21:16:22,745 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:16:22" (1/1) ... [2025-03-16 21:16:22,745 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:16:22" (1/1) ... [2025-03-16 21:16:22,759 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:16:22" (1/1) ... [2025-03-16 21:16:22,762 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:16:22" (1/1) ... [2025-03-16 21:16:22,764 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:16:22" (1/1) ... [2025-03-16 21:16:22,765 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:16:22" (1/1) ... [2025-03-16 21:16:22,769 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 21:16:22,770 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 21:16:22,770 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 21:16:22,770 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 21:16:22,772 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:16:22" (1/1) ... [2025-03-16 21:16:22,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:16:22,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:16:22,795 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-16 21:16:22,799 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-16 21:16:22,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 21:16:22,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 21:16:22,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 21:16:22,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 21:16:22,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 21:16:22,887 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 21:16:22,889 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 21:16:23,261 INFO L? ?]: Removed 140 outVars from TransFormulas that were not future-live. [2025-03-16 21:16:23,261 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 21:16:23,282 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 21:16:23,282 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 21:16:23,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:16:23 BoogieIcfgContainer [2025-03-16 21:16:23,283 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 21:16:23,284 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 21:16:23,284 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 21:16:23,287 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 21:16:23,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 09:16:22" (1/3) ... [2025-03-16 21:16:23,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e4d1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:16:23, skipping insertion in model container [2025-03-16 21:16:23,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:16:22" (2/3) ... [2025-03-16 21:16:23,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e4d1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:16:23, skipping insertion in model container [2025-03-16 21:16:23,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:16:23" (3/3) ... [2025-03-16 21:16:23,289 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal17.c [2025-03-16 21:16:23,298 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 21:16:23,299 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal17.c that has 1 procedures, 68 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 21:16:23,339 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 21:16:23,349 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;@10dfe57c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 21:16:23,349 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 21:16:23,353 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 66 states have (on average 1.5) internal successors, (99), 67 states have internal predecessors, (99), 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-16 21:16:23,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-16 21:16:23,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:16:23,357 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] [2025-03-16 21:16:23,357 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:16:23,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:16:23,362 INFO L85 PathProgramCache]: Analyzing trace with hash 126278368, now seen corresponding path program 1 times [2025-03-16 21:16:23,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:16:23,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121510172] [2025-03-16 21:16:23,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:16:23,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:16:23,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-16 21:16:23,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-16 21:16:23,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:16:23,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:16:23,793 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-16 21:16:23,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:16:23,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121510172] [2025-03-16 21:16:23,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121510172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:16:23,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:16:23,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:16:23,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466976365] [2025-03-16 21:16:23,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:16:23,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:16:23,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:16:23,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:16:23,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:16:23,815 INFO L87 Difference]: Start difference. First operand has 68 states, 66 states have (on average 1.5) internal successors, (99), 67 states have internal predecessors, (99), 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 6.5) internal successors, (26), 4 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-16 21:16:23,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:16:23,883 INFO L93 Difference]: Finished difference Result 119 states and 175 transitions. [2025-03-16 21:16:23,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:16:23,885 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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 26 [2025-03-16 21:16:23,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:16:23,889 INFO L225 Difference]: With dead ends: 119 [2025-03-16 21:16:23,890 INFO L226 Difference]: Without dead ends: 68 [2025-03-16 21:16:23,892 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-16 21:16:23,893 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:16:23,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:16:23,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-16 21:16:23,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-16 21:16:23,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.462686567164179) internal successors, (98), 67 states have internal predecessors, (98), 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-16 21:16:23,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 98 transitions. [2025-03-16 21:16:23,922 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 98 transitions. Word has length 26 [2025-03-16 21:16:23,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:16:23,922 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 98 transitions. [2025-03-16 21:16:23,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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-16 21:16:23,922 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 98 transitions. [2025-03-16 21:16:23,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-16 21:16:23,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:16:23,924 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] [2025-03-16 21:16:23,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 21:16:23,924 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:16:23,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:16:23,924 INFO L85 PathProgramCache]: Analyzing trace with hash -375658717, now seen corresponding path program 1 times [2025-03-16 21:16:23,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:16:23,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343719333] [2025-03-16 21:16:23,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:16:23,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:16:23,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-16 21:16:23,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 21:16:23,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:16:23,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:16:24,053 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-16 21:16:24,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:16:24,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343719333] [2025-03-16 21:16:24,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343719333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:16:24,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:16:24,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:16:24,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279982310] [2025-03-16 21:16:24,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:16:24,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:16:24,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:16:24,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:16:24,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:16:24,057 INFO L87 Difference]: Start difference. First operand 68 states and 98 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-16 21:16:24,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:16:24,132 INFO L93 Difference]: Finished difference Result 121 states and 174 transitions. [2025-03-16 21:16:24,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:16:24,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2025-03-16 21:16:24,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:16:24,133 INFO L225 Difference]: With dead ends: 121 [2025-03-16 21:16:24,134 INFO L226 Difference]: Without dead ends: 70 [2025-03-16 21:16:24,134 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-16 21:16:24,135 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:16:24,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 229 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:16:24,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-16 21:16:24,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-16 21:16:24,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.4492753623188406) internal successors, (100), 69 states have internal predecessors, (100), 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-16 21:16:24,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 100 transitions. [2025-03-16 21:16:24,138 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 100 transitions. Word has length 27 [2025-03-16 21:16:24,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:16:24,138 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 100 transitions. [2025-03-16 21:16:24,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-16 21:16:24,139 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 100 transitions. [2025-03-16 21:16:24,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-16 21:16:24,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:16:24,139 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] [2025-03-16 21:16:24,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 21:16:24,139 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:16:24,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:16:24,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1123976389, now seen corresponding path program 1 times [2025-03-16 21:16:24,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:16:24,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521288538] [2025-03-16 21:16:24,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:16:24,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:16:24,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-16 21:16:24,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-16 21:16:24,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:16:24,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:16:24,417 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-16 21:16:24,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:16:24,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521288538] [2025-03-16 21:16:24,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521288538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:16:24,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:16:24,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:16:24,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384782115] [2025-03-16 21:16:24,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:16:24,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:16:24,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:16:24,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:16:24,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:16:24,418 INFO L87 Difference]: Start difference. First operand 70 states and 100 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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-16 21:16:24,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:16:24,548 INFO L93 Difference]: Finished difference Result 160 states and 226 transitions. [2025-03-16 21:16:24,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:16:24,549 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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 28 [2025-03-16 21:16:24,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:16:24,550 INFO L225 Difference]: With dead ends: 160 [2025-03-16 21:16:24,550 INFO L226 Difference]: Without dead ends: 107 [2025-03-16 21:16:24,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:16:24,551 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 185 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:16:24,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 284 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:16:24,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-16 21:16:24,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 88. [2025-03-16 21:16:24,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 87 states have internal predecessors, (126), 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-16 21:16:24,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 126 transitions. [2025-03-16 21:16:24,556 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 126 transitions. Word has length 28 [2025-03-16 21:16:24,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:16:24,556 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 126 transitions. [2025-03-16 21:16:24,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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-16 21:16:24,556 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 126 transitions. [2025-03-16 21:16:24,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-16 21:16:24,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:16:24,557 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-16 21:16:24,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 21:16:24,557 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:16:24,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:16:24,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1404832840, now seen corresponding path program 1 times [2025-03-16 21:16:24,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:16:24,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163284107] [2025-03-16 21:16:24,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:16:24,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:16:24,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-16 21:16:24,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-16 21:16:24,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:16:24,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:16:24,760 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-16 21:16:24,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:16:24,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163284107] [2025-03-16 21:16:24,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163284107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:16:24,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:16:24,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:16:24,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791645059] [2025-03-16 21:16:24,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:16:24,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 21:16:24,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:16:24,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 21:16:24,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:16:24,763 INFO L87 Difference]: Start difference. First operand 88 states and 126 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 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-16 21:16:24,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:16:24,992 INFO L93 Difference]: Finished difference Result 162 states and 228 transitions. [2025-03-16 21:16:24,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 21:16:24,993 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 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-16 21:16:24,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:16:24,993 INFO L225 Difference]: With dead ends: 162 [2025-03-16 21:16:24,993 INFO L226 Difference]: Without dead ends: 109 [2025-03-16 21:16:24,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-16 21:16:24,994 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 188 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:16:24,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 415 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:16:24,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-16 21:16:25,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 91. [2025-03-16 21:16:25,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.4444444444444444) internal successors, (130), 90 states have internal predecessors, (130), 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-16 21:16:25,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 130 transitions. [2025-03-16 21:16:25,004 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 130 transitions. Word has length 29 [2025-03-16 21:16:25,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:16:25,004 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 130 transitions. [2025-03-16 21:16:25,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 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-16 21:16:25,005 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 130 transitions. [2025-03-16 21:16:25,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-16 21:16:25,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:16:25,006 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-16 21:16:25,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 21:16:25,007 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:16:25,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:16:25,007 INFO L85 PathProgramCache]: Analyzing trace with hash -66167954, now seen corresponding path program 1 times [2025-03-16 21:16:25,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:16:25,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264228092] [2025-03-16 21:16:25,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:16:25,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:16:25,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-16 21:16:25,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-16 21:16:25,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:16:25,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:16:25,331 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-16 21:16:25,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:16:25,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264228092] [2025-03-16 21:16:25,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264228092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:16:25,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:16:25,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 21:16:25,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726917980] [2025-03-16 21:16:25,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:16:25,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 21:16:25,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:16:25,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 21:16:25,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:16:25,333 INFO L87 Difference]: Start difference. First operand 91 states and 130 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 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-16 21:16:25,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:16:25,527 INFO L93 Difference]: Finished difference Result 162 states and 227 transitions. [2025-03-16 21:16:25,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 21:16:25,527 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 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-16 21:16:25,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:16:25,528 INFO L225 Difference]: With dead ends: 162 [2025-03-16 21:16:25,528 INFO L226 Difference]: Without dead ends: 109 [2025-03-16 21:16:25,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-03-16 21:16:25,529 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 182 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:16:25,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 466 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:16:25,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-16 21:16:25,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 95. [2025-03-16 21:16:25,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.4361702127659575) internal successors, (135), 94 states have internal predecessors, (135), 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-16 21:16:25,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 135 transitions. [2025-03-16 21:16:25,534 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 135 transitions. Word has length 30 [2025-03-16 21:16:25,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:16:25,534 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 135 transitions. [2025-03-16 21:16:25,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 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-16 21:16:25,534 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 135 transitions. [2025-03-16 21:16:25,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-16 21:16:25,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:16:25,535 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-16 21:16:25,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 21:16:25,535 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:16:25,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:16:25,535 INFO L85 PathProgramCache]: Analyzing trace with hash -722098791, now seen corresponding path program 1 times [2025-03-16 21:16:25,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:16:25,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311133991] [2025-03-16 21:16:25,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:16:25,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:16:25,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-16 21:16:25,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-16 21:16:25,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:16:25,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 21:16:25,561 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 21:16:25,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-16 21:16:25,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-16 21:16:25,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:16:25,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 21:16:25,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 21:16:25,597 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 21:16:25,598 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 21:16:25,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 21:16:25,602 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-16 21:16:25,616 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-16 21:16:25,620 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 21:16:25,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 09:16:25 BoogieIcfgContainer [2025-03-16 21:16:25,623 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 21:16:25,623 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 21:16:25,623 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 21:16:25,623 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 21:16:25,624 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:16:23" (3/4) ... [2025-03-16 21:16:25,625 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 21:16:25,626 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 21:16:25,628 INFO L158 Benchmark]: Toolchain (without parser) took 3217.70ms. Allocated memory is still 201.3MB. Free memory was 158.9MB in the beginning and 131.1MB in the end (delta: 27.9MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. [2025-03-16 21:16:25,628 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 21:16:25,628 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.64ms. Allocated memory is still 201.3MB. Free memory was 158.9MB in the beginning and 144.6MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 21:16:25,628 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.13ms. Allocated memory is still 201.3MB. Free memory was 144.6MB in the beginning and 138.2MB in the end (delta: 6.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 21:16:25,628 INFO L158 Benchmark]: Boogie Preprocessor took 60.70ms. Allocated memory is still 201.3MB. Free memory was 138.2MB in the beginning and 134.2MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 21:16:25,628 INFO L158 Benchmark]: IcfgBuilder took 512.78ms. Allocated memory is still 201.3MB. Free memory was 134.2MB in the beginning and 94.1MB in the end (delta: 40.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-16 21:16:25,629 INFO L158 Benchmark]: TraceAbstraction took 2338.31ms. Allocated memory is still 201.3MB. Free memory was 93.3MB in the beginning and 131.1MB in the end (delta: -37.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 21:16:25,629 INFO L158 Benchmark]: Witness Printer took 2.91ms. Allocated memory is still 201.3MB. Free memory was 131.1MB in the beginning and 131.1MB in the end (delta: 60.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 21:16:25,629 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 245.64ms. Allocated memory is still 201.3MB. Free memory was 158.9MB in the beginning and 144.6MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.13ms. Allocated memory is still 201.3MB. Free memory was 144.6MB in the beginning and 138.2MB in the end (delta: 6.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 60.70ms. Allocated memory is still 201.3MB. Free memory was 138.2MB in the beginning and 134.2MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 512.78ms. Allocated memory is still 201.3MB. Free memory was 134.2MB in the beginning and 94.1MB in the end (delta: 40.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2338.31ms. Allocated memory is still 201.3MB. Free memory was 93.3MB in the beginning and 131.1MB in the end (delta: -37.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.91ms. Allocated memory is still 201.3MB. Free memory was 131.1MB in the beginning and 131.1MB in the end (delta: 60.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 bitwiseOr at line 92, overapproximation of bitwiseAnd at line 97. 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_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 2); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (2 - 1); [L32] const SORT_1 var_10 = 0; [L33] const SORT_5 var_14 = 0; [L34] const SORT_1 var_29 = 1; [L35] const SORT_5 var_39 = 1; [L37] SORT_1 input_2; [L38] SORT_1 input_3; [L39] SORT_1 input_4; [L40] SORT_5 input_6; [L41] SORT_1 input_7; [L42] SORT_5 input_8; [L43] SORT_5 input_9; [L45] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=3, var_10=0, var_14=0, var_29=1, var_39=1] [L45] SORT_1 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_5=3, var_10=0, var_14=0, var_29=1, var_39=1] [L46] SORT_5 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L47] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=3, var_10=0, var_14=0, var_29=1, var_39=1] [L47] SORT_1 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, var_10=0, var_14=0, var_29=1, var_39=1] [L48] SORT_5 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L50] SORT_1 init_12_arg_1 = var_10; [L51] state_11 = init_12_arg_1 [L52] SORT_5 init_16_arg_1 = var_14; [L53] state_15 = init_16_arg_1 [L54] SORT_1 init_18_arg_1 = var_10; [L55] state_17 = init_18_arg_1 [L56] SORT_5 init_22_arg_1 = var_14; [L57] state_21 = init_22_arg_1 VAL [mask_SORT_1=1, state_11=0, state_15=0, state_17=0, state_21=0, var_10=0, var_14=0, var_29=1, var_39=1] [L60] input_2 = __VERIFIER_nondet_uchar() [L61] EXPR input_2 & mask_SORT_1 VAL [mask_SORT_1=1, state_11=0, state_15=0, state_17=0, state_21=0, var_10=0, var_14=0, var_29=1, var_39=1] [L61] input_2 = input_2 & mask_SORT_1 [L62] input_3 = __VERIFIER_nondet_uchar() [L63] EXPR input_3 & mask_SORT_1 VAL [input_2=0, mask_SORT_1=1, state_11=0, state_15=0, state_17=0, state_21=0, var_10=0, var_14=0, var_29=1, var_39=1] [L63] input_3 = input_3 & mask_SORT_1 [L64] input_4 = __VERIFIER_nondet_uchar() [L65] input_6 = __VERIFIER_nondet_uchar() [L66] input_7 = __VERIFIER_nondet_uchar() [L67] input_8 = __VERIFIER_nondet_uchar() [L68] input_9 = __VERIFIER_nondet_uchar() [L71] SORT_1 var_13_arg_0 = state_11; [L72] SORT_1 var_13 = ~var_13_arg_0; [L73] SORT_1 var_19_arg_0 = state_17; [L74] SORT_5 var_19_arg_1 = state_15; [L75] SORT_5 var_19_arg_2 = input_6; [L76] SORT_5 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L77] SORT_5 var_20_arg_0 = var_19; [L78] SORT_1 var_20 = var_20_arg_0 >> 0; VAL [input_2=0, input_3=0, input_6=0, mask_SORT_1=1, state_11=0, state_17=0, state_21=0, var_10=0, var_13=-1, var_14=0, var_19=0, var_20=0, var_29=1, var_39=1] [L79] EXPR var_20 & mask_SORT_1 VAL [input_2=0, input_3=0, input_6=0, mask_SORT_1=1, state_11=0, state_17=0, state_21=0, var_10=0, var_13=-1, var_14=0, var_19=0, var_29=1, var_39=1] [L79] var_20 = var_20 & mask_SORT_1 [L80] SORT_1 var_23_arg_0 = state_17; [L81] SORT_5 var_23_arg_1 = state_21; [L82] SORT_5 var_23_arg_2 = input_6; [L83] SORT_5 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L84] SORT_5 var_24_arg_0 = var_23; [L85] SORT_1 var_24 = var_24_arg_0 >> 0; VAL [input_2=0, input_3=0, mask_SORT_1=1, state_11=0, var_10=0, var_13=-1, var_14=0, var_19=0, var_20=0, var_24=0, var_29=1, var_39=1] [L86] EXPR var_24 & mask_SORT_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, state_11=0, var_10=0, var_13=-1, var_14=0, var_19=0, var_20=0, var_29=1, var_39=1] [L86] var_24 = var_24 & mask_SORT_1 [L87] SORT_1 var_25_arg_0 = var_20; [L88] SORT_1 var_25_arg_1 = var_24; [L89] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L90] SORT_1 var_26_arg_0 = var_13; [L91] SORT_1 var_26_arg_1 = var_25; VAL [input_2=0, input_3=0, mask_SORT_1=1, state_11=0, var_10=0, var_14=0, var_19=0, var_20=0, var_26_arg_0=-1, var_26_arg_1=1, var_29=1, var_39=1] [L92] EXPR var_26_arg_0 | var_26_arg_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, state_11=0, var_10=0, var_14=0, var_19=0, var_20=0, var_29=1, var_39=1] [L92] SORT_1 var_26 = var_26_arg_0 | var_26_arg_1; [L93] SORT_1 var_30_arg_0 = var_26; [L94] SORT_1 var_30 = ~var_30_arg_0; [L95] SORT_1 var_31_arg_0 = var_29; [L96] SORT_1 var_31_arg_1 = var_30; VAL [input_2=0, input_3=0, mask_SORT_1=1, state_11=0, var_10=0, var_14=0, var_19=0, var_20=0, var_29=1, var_31_arg_0=1, var_31_arg_1=-1, var_39=1] [L97] EXPR var_31_arg_0 & var_31_arg_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, state_11=0, var_10=0, var_14=0, var_19=0, var_20=0, var_29=1, var_39=1] [L97] SORT_1 var_31 = var_31_arg_0 & var_31_arg_1; [L98] EXPR var_31 & mask_SORT_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, state_11=0, var_10=0, var_14=0, var_19=0, var_20=0, var_29=1, var_39=1] [L98] var_31 = var_31 & mask_SORT_1 [L99] SORT_1 bad_32_arg_0 = var_31; [L100] CALL __VERIFIER_assert(!(bad_32_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 68 locations, 99 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 555 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 555 mSDsluCounter, 1626 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1260 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 577 IncrementalHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 366 mSDtfsCounter, 577 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=5, InterpolantAutomatonStates: 31, 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, 5 MinimizatonAttempts, 51 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 171 NumberOfCodeBlocks, 171 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 484 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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-16 21:16:25,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal17.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 c94b3661676652faea857d81dc0e0e26cd1d6a51b23eb72c98391fe2e83a67ae --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 21:16:27,405 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 21:16:27,472 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-16 21:16:27,481 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 21:16:27,483 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 21:16:27,501 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 21:16:27,501 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 21:16:27,501 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 21:16:27,501 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 21:16:27,501 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 21:16:27,501 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 21:16:27,501 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 21:16:27,502 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 21:16:27,502 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 21:16:27,502 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 21:16:27,502 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 21:16:27,502 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 21:16:27,502 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 21:16:27,502 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 21:16:27,502 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 21:16:27,502 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 21:16:27,502 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 21:16:27,502 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 21:16:27,502 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 21:16:27,502 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 21:16:27,502 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 21:16:27,503 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 21:16:27,503 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 21:16:27,503 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 21:16:27,503 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 21:16:27,503 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 21:16:27,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:16:27,503 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 21:16:27,503 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 21:16:27,504 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 21:16:27,504 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 21:16:27,504 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 21:16:27,504 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 21:16:27,504 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 21:16:27,504 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 21:16:27,504 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 21:16:27,504 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 21:16:27,504 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 -> c94b3661676652faea857d81dc0e0e26cd1d6a51b23eb72c98391fe2e83a67ae [2025-03-16 21:16:27,739 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 21:16:27,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 21:16:27,747 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 21:16:27,748 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 21:16:27,748 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 21:16:27,749 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal17.c [2025-03-16 21:16:28,889 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9b750138/21718465d0324d04988473dbf403c14d/FLAG03cc0b9a1 [2025-03-16 21:16:29,080 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 21:16:29,081 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal17.c [2025-03-16 21:16:29,090 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9b750138/21718465d0324d04988473dbf403c14d/FLAG03cc0b9a1 [2025-03-16 21:16:29,447 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9b750138/21718465d0324d04988473dbf403c14d [2025-03-16 21:16:29,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 21:16:29,450 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 21:16:29,450 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 21:16:29,450 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 21:16:29,453 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 21:16:29,453 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:16:29" (1/1) ... [2025-03-16 21:16:29,454 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28357d11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:16:29, skipping insertion in model container [2025-03-16 21:16:29,454 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:16:29" (1/1) ... [2025-03-16 21:16:29,464 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 21:16:29,557 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.cal17.c[1245,1258] [2025-03-16 21:16:29,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:16:29,607 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 21:16:29,614 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.cal17.c[1245,1258] [2025-03-16 21:16:29,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:16:29,647 INFO L204 MainTranslator]: Completed translation [2025-03-16 21:16:29,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:16:29 WrapperNode [2025-03-16 21:16:29,648 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 21:16:29,649 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 21:16:29,649 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 21:16:29,650 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 21:16:29,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:16:29" (1/1) ... [2025-03-16 21:16:29,660 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:16:29" (1/1) ... [2025-03-16 21:16:29,681 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 174 [2025-03-16 21:16:29,682 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 21:16:29,682 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 21:16:29,682 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 21:16:29,682 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 21:16:29,688 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:16:29" (1/1) ... [2025-03-16 21:16:29,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:16:29" (1/1) ... [2025-03-16 21:16:29,690 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:16:29" (1/1) ... [2025-03-16 21:16:29,710 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-03-16 21:16:29,710 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:16:29" (1/1) ... [2025-03-16 21:16:29,710 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:16:29" (1/1) ... [2025-03-16 21:16:29,719 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:16:29" (1/1) ... [2025-03-16 21:16:29,719 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:16:29" (1/1) ... [2025-03-16 21:16:29,724 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:16:29" (1/1) ... [2025-03-16 21:16:29,725 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:16:29" (1/1) ... [2025-03-16 21:16:29,726 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 21:16:29,727 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 21:16:29,730 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 21:16:29,730 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 21:16:29,731 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:16:29" (1/1) ... [2025-03-16 21:16:29,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:16:29,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:16:29,755 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-16 21:16:29,757 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-16 21:16:29,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 21:16:29,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 21:16:29,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-16 21:16:29,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 21:16:29,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 21:16:29,840 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 21:16:29,842 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 21:16:30,015 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2025-03-16 21:16:30,016 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 21:16:30,024 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 21:16:30,025 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 21:16:30,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:16:30 BoogieIcfgContainer [2025-03-16 21:16:30,025 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 21:16:30,027 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 21:16:30,027 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 21:16:30,031 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 21:16:30,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 09:16:29" (1/3) ... [2025-03-16 21:16:30,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ded3a1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:16:30, skipping insertion in model container [2025-03-16 21:16:30,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:16:29" (2/3) ... [2025-03-16 21:16:30,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ded3a1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:16:30, skipping insertion in model container [2025-03-16 21:16:30,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:16:30" (3/3) ... [2025-03-16 21:16:30,033 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal17.c [2025-03-16 21:16:30,043 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 21:16:30,044 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal17.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 21:16:30,080 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 21:16:30,089 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;@19faa95e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 21:16:30,089 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 21:16:30,091 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 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-16 21:16:30,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-16 21:16:30,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:16:30,094 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-16 21:16:30,095 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:16:30,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:16:30,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-03-16 21:16:30,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 21:16:30,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2005596225] [2025-03-16 21:16:30,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:16:30,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:16:30,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:16:30,110 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-16 21:16:30,111 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-16 21:16:30,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-16 21:16:30,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-16 21:16:30,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:16:30,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:16:30,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 21:16:30,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:16:30,364 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-16 21:16:30,365 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 21:16:30,365 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 21:16:30,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005596225] [2025-03-16 21:16:30,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005596225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:16:30,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:16:30,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 21:16:30,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72898373] [2025-03-16 21:16:30,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:16:30,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:16:30,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 21:16:30,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:16:30,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:16:30,382 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 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) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-16 21:16:30,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:16:30,414 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-03-16 21:16:30,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:16:30,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-03-16 21:16:30,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:16:30,420 INFO L225 Difference]: With dead ends: 16 [2025-03-16 21:16:30,420 INFO L226 Difference]: Without dead ends: 9 [2025-03-16 21:16:30,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-16 21:16:30,423 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8 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-16 21:16:30,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 21:16:30,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-03-16 21:16:30,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-03-16 21:16:30,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-16 21:16:30,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-03-16 21:16:30,443 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-03-16 21:16:30,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:16:30,443 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-03-16 21:16:30,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-16 21:16:30,444 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-03-16 21:16:30,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 21:16:30,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:16:30,444 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-16 21:16:30,452 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-16 21:16:30,646 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-16 21:16:30,647 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:16:30,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:16:30,649 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-03-16 21:16:30,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 21:16:30,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2086220858] [2025-03-16 21:16:30,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:16:30,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:16:30,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:16:30,653 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-16 21:16:30,654 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-16 21:16:30,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 21:16:30,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 21:16:30,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:16:30,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:16:30,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-16 21:16:30,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:16:30,905 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-16 21:16:30,905 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 21:16:31,866 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-16 21:16:31,866 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 21:16:31,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086220858] [2025-03-16 21:16:31,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086220858] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 21:16:31,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 21:16:31,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-16 21:16:31,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48164336] [2025-03-16 21:16:31,866 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 21:16:31,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 21:16:31,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 21:16:31,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 21:16:31,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:16:31,870 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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-16 21:16:31,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:16:31,925 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2025-03-16 21:16:31,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 21:16:31,925 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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 7 [2025-03-16 21:16:31,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:16:31,926 INFO L225 Difference]: With dead ends: 13 [2025-03-16 21:16:31,926 INFO L226 Difference]: Without dead ends: 11 [2025-03-16 21:16:31,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-16 21:16:31,927 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 21:16:31,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 21:16:31,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-03-16 21:16:31,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-03-16 21:16:31,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-16 21:16:31,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2025-03-16 21:16:31,930 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2025-03-16 21:16:31,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:16:31,930 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2025-03-16 21:16:31,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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-16 21:16:31,931 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2025-03-16 21:16:31,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-16 21:16:31,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:16:31,932 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2025-03-16 21:16:31,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 21:16:32,132 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-16 21:16:32,133 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:16:32,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:16:32,133 INFO L85 PathProgramCache]: Analyzing trace with hash 55678175, now seen corresponding path program 2 times [2025-03-16 21:16:32,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 21:16:32,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1474723974] [2025-03-16 21:16:32,134 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 21:16:32,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:16:32,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:16:32,136 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-16 21:16:32,137 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-16 21:16:32,199 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-16 21:16:32,219 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-16 21:16:32,219 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 21:16:32,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:16:32,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-16 21:16:32,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:16:33,228 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:16:33,228 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 21:16:39,377 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-16 21:16:39,377 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 21:16:39,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474723974] [2025-03-16 21:16:39,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474723974] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 21:16:39,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 21:16:39,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-16 21:16:39,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759877166] [2025-03-16 21:16:39,377 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 21:16:39,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 21:16:39,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 21:16:39,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 21:16:39,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:16:39,378 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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-16 21:16:39,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:16:39,454 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2025-03-16 21:16:39,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:16:39,454 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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 10 [2025-03-16 21:16:39,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:16:39,455 INFO L225 Difference]: With dead ends: 11 [2025-03-16 21:16:39,455 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 21:16:39,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-16 21:16:39,455 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 21:16:39,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 21:16:39,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 21:16:39,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 21:16:39,456 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-16 21:16:39,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 21:16:39,456 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2025-03-16 21:16:39,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:16:39,456 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 21:16:39,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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-16 21:16:39,456 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 21:16:39,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 21:16:39,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 21:16:39,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 21:16:39,660 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-16 21:16:39,663 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1] [2025-03-16 21:16:39,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 21:16:39,729 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 21:16:39,736 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-16 21:16:39,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 09:16:39 BoogieIcfgContainer [2025-03-16 21:16:39,738 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 21:16:39,738 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 21:16:39,738 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 21:16:39,738 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 21:16:39,739 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:16:30" (3/4) ... [2025-03-16 21:16:39,740 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 21:16:39,746 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-16 21:16:39,747 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-16 21:16:39,747 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 21:16:39,747 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 21:16:39,747 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 21:16:39,799 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 21:16:39,799 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 21:16:39,799 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 21:16:39,800 INFO L158 Benchmark]: Toolchain (without parser) took 10350.01ms. Allocated memory was 117.4MB in the beginning and 746.6MB in the end (delta: 629.1MB). Free memory was 92.3MB in the beginning and 541.4MB in the end (delta: -449.1MB). Peak memory consumption was 175.1MB. Max. memory is 16.1GB. [2025-03-16 21:16:39,800 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 83.9MB. Free memory was 62.2MB in the beginning and 62.1MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 21:16:39,800 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.26ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 77.9MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 21:16:39,800 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.35ms. Allocated memory is still 117.4MB. Free memory was 77.9MB in the beginning and 76.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 21:16:39,800 INFO L158 Benchmark]: Boogie Preprocessor took 44.29ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 73.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 21:16:39,800 INFO L158 Benchmark]: IcfgBuilder took 298.48ms. Allocated memory is still 117.4MB. Free memory was 73.9MB in the beginning and 53.3MB in the end (delta: 20.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 21:16:39,801 INFO L158 Benchmark]: TraceAbstraction took 9710.56ms. Allocated memory was 117.4MB in the beginning and 746.6MB in the end (delta: 629.1MB). Free memory was 52.6MB in the beginning and 545.6MB in the end (delta: -492.9MB). Peak memory consumption was 133.1MB. Max. memory is 16.1GB. [2025-03-16 21:16:39,801 INFO L158 Benchmark]: Witness Printer took 60.78ms. Allocated memory is still 746.6MB. Free memory was 545.6MB in the beginning and 541.4MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 21:16:39,802 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.13ms. Allocated memory is still 83.9MB. Free memory was 62.2MB in the beginning and 62.1MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 198.26ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 77.9MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.35ms. Allocated memory is still 117.4MB. Free memory was 77.9MB in the beginning and 76.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.29ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 73.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 298.48ms. Allocated memory is still 117.4MB. Free memory was 73.9MB in the beginning and 53.3MB in the end (delta: 20.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9710.56ms. Allocated memory was 117.4MB in the beginning and 746.6MB in the end (delta: 629.1MB). Free memory was 52.6MB in the beginning and 545.6MB in the end (delta: -492.9MB). Peak memory consumption was 133.1MB. Max. memory is 16.1GB. * Witness Printer took 60.78ms. Allocated memory is still 746.6MB. Free memory was 545.6MB in the beginning and 541.4MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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, 8 locations, 9 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.6s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 31 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 68 IncrementalHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 9 mSDtfsCounter, 68 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=2, InterpolantAutomatonStates: 17, 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.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 33 ConstructedInterpolants, 12 QuantifiedInterpolants, 9375 SizeOfPredicates, 24 NumberOfNonLiveVariables, 309 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 3/18 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: 58]: Location Invariant Derived location invariant: (((((((0 == state_17) && (0 == var_10)) && (1 == var_29)) && (0 == state_11)) && (1 == mask_SORT_1)) || (((((1 == state_17) && (0 == var_10)) && (1 == var_29)) && (1 == mask_SORT_1)) && (1 == state_11))) || (((((0 == state_17) && (0 == var_10)) && (1 == var_29)) && (1 == mask_SORT_1)) && (1 == state_11))) RESULT: Ultimate proved your program to be correct! [2025-03-16 21:16:39,817 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