./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p12.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.vcegar_QF_BV_itc99_b13_p12.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 4e02c03b322d505b0cc468468d173ed639fc016c75e6d327c68381184cb6fd73 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:45:02,760 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:45:02,814 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 22:45:02,819 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:45:02,822 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:45:02,841 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:45:02,842 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:45:02,842 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:45:02,843 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:45:02,843 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:45:02,843 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:45:02,843 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:45:02,843 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:45:02,843 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:45:02,844 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:45:02,844 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:45:02,844 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:45:02,844 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 22:45:02,844 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:45:02,844 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:45:02,844 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:45:02,845 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:45:02,845 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:45:02,845 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:45:02,845 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:45:02,845 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:45:02,845 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:45:02,845 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:45:02,845 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:45:02,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:45:02,846 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:45:02,846 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:45:02,846 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:45:02,846 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:45:02,846 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 22:45:02,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 22:45:02,846 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:45:02,847 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:45:02,847 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:45:02,847 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:45:02,847 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 -> 4e02c03b322d505b0cc468468d173ed639fc016c75e6d327c68381184cb6fd73 [2025-03-16 22:45:03,063 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:45:03,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:45:03,071 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:45:03,072 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:45:03,072 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:45:03,073 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p12.c [2025-03-16 22:45:04,160 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87031627b/ec3442c419be4f6c828e605c9338119f/FLAG6a03a039a [2025-03-16 22:45:04,372 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:45:04,372 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p12.c [2025-03-16 22:45:04,383 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87031627b/ec3442c419be4f6c828e605c9338119f/FLAG6a03a039a [2025-03-16 22:45:04,734 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87031627b/ec3442c419be4f6c828e605c9338119f [2025-03-16 22:45:04,736 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:45:04,737 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:45:04,738 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:45:04,738 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:45:04,741 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:45:04,742 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:45:04" (1/1) ... [2025-03-16 22:45:04,742 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@328b26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:04, skipping insertion in model container [2025-03-16 22:45:04,742 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:45:04" (1/1) ... [2025-03-16 22:45:04,760 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:45:04,865 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p12.c[1266,1279] [2025-03-16 22:45:04,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:45:04,984 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:45:04,991 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p12.c[1266,1279] [2025-03-16 22:45:05,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:45:05,061 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:45:05,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:05 WrapperNode [2025-03-16 22:45:05,061 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:45:05,062 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:45:05,062 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:45:05,062 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:45:05,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:05" (1/1) ... [2025-03-16 22:45:05,075 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:05" (1/1) ... [2025-03-16 22:45:05,125 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 746 [2025-03-16 22:45:05,125 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:45:05,127 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:45:05,127 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:45:05,127 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:45:05,132 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:05" (1/1) ... [2025-03-16 22:45:05,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:05" (1/1) ... [2025-03-16 22:45:05,150 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:05" (1/1) ... [2025-03-16 22:45:05,183 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 22:45:05,186 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:05" (1/1) ... [2025-03-16 22:45:05,186 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:05" (1/1) ... [2025-03-16 22:45:05,209 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:05" (1/1) ... [2025-03-16 22:45:05,212 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:05" (1/1) ... [2025-03-16 22:45:05,223 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:05" (1/1) ... [2025-03-16 22:45:05,227 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:05" (1/1) ... [2025-03-16 22:45:05,234 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:45:05,235 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:45:05,236 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:45:05,236 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:45:05,236 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:05" (1/1) ... [2025-03-16 22:45:05,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:45:05,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:45:05,261 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 22:45:05,264 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 22:45:05,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:45:05,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 22:45:05,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:45:05,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:45:05,399 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:45:05,400 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:45:06,036 INFO L? ?]: Removed 370 outVars from TransFormulas that were not future-live. [2025-03-16 22:45:06,036 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:45:06,070 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:45:06,071 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:45:06,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:45:06 BoogieIcfgContainer [2025-03-16 22:45:06,072 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:45:06,073 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:45:06,073 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:45:06,076 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:45:06,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:45:04" (1/3) ... [2025-03-16 22:45:06,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52a82c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:45:06, skipping insertion in model container [2025-03-16 22:45:06,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:05" (2/3) ... [2025-03-16 22:45:06,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52a82c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:45:06, skipping insertion in model container [2025-03-16 22:45:06,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:45:06" (3/3) ... [2025-03-16 22:45:06,078 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p12.c [2025-03-16 22:45:06,088 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:45:06,090 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p12.c that has 1 procedures, 140 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:45:06,132 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:45:06,143 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;@2464b1cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:45:06,143 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:45:06,146 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 138 states have (on average 1.5) internal successors, (207), 139 states have internal predecessors, (207), 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 22:45:06,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-16 22:45:06,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:06,152 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:45:06,152 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:06,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:06,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1168482644, now seen corresponding path program 1 times [2025-03-16 22:45:06,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:45:06,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130007020] [2025-03-16 22:45:06,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:06,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:45:06,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-16 22:45:06,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 22:45:06,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:06,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:06,658 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 22:45:06,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:45:06,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130007020] [2025-03-16 22:45:06,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130007020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:45:06,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:45:06,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:45:06,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586158619] [2025-03-16 22:45:06,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:45:06,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:45:06,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:45:06,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:45:06,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:45:06,683 INFO L87 Difference]: Start difference. First operand has 140 states, 138 states have (on average 1.5) internal successors, (207), 139 states have internal predecessors, (207), 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 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 22:45:06,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:06,791 INFO L93 Difference]: Finished difference Result 227 states and 337 transitions. [2025-03-16 22:45:06,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:45:06,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 40 [2025-03-16 22:45:06,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:06,798 INFO L225 Difference]: With dead ends: 227 [2025-03-16 22:45:06,798 INFO L226 Difference]: Without dead ends: 140 [2025-03-16 22:45:06,802 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 22:45:06,804 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:45:06,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 502 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:45:06,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-16 22:45:06,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2025-03-16 22:45:06,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.4820143884892085) internal successors, (206), 139 states have internal predecessors, (206), 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 22:45:06,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 206 transitions. [2025-03-16 22:45:06,835 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 206 transitions. Word has length 40 [2025-03-16 22:45:06,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:06,835 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 206 transitions. [2025-03-16 22:45:06,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 22:45:06,836 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 206 transitions. [2025-03-16 22:45:06,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-16 22:45:06,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:06,839 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:45:06,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 22:45:06,839 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:06,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:06,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1858544348, now seen corresponding path program 1 times [2025-03-16 22:45:06,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:45:06,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108938357] [2025-03-16 22:45:06,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:06,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:45:06,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-16 22:45:06,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-16 22:45:06,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:06,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:06,979 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 22:45:06,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:45:06,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108938357] [2025-03-16 22:45:06,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108938357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:45:06,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:45:06,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:45:06,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677019282] [2025-03-16 22:45:06,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:45:06,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:45:06,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:45:06,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:45:06,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:45:06,983 INFO L87 Difference]: Start difference. First operand 140 states and 206 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 22:45:07,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:07,082 INFO L93 Difference]: Finished difference Result 229 states and 336 transitions. [2025-03-16 22:45:07,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:45:07,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 41 [2025-03-16 22:45:07,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:07,083 INFO L225 Difference]: With dead ends: 229 [2025-03-16 22:45:07,083 INFO L226 Difference]: Without dead ends: 142 [2025-03-16 22:45:07,083 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 22:45:07,084 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:45:07,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 499 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:45:07,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-16 22:45:07,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2025-03-16 22:45:07,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.475177304964539) internal successors, (208), 141 states have internal predecessors, (208), 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 22:45:07,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 208 transitions. [2025-03-16 22:45:07,095 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 208 transitions. Word has length 41 [2025-03-16 22:45:07,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:07,095 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 208 transitions. [2025-03-16 22:45:07,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 22:45:07,095 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 208 transitions. [2025-03-16 22:45:07,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-16 22:45:07,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:07,096 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:45:07,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 22:45:07,096 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:07,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:07,097 INFO L85 PathProgramCache]: Analyzing trace with hash 151209383, now seen corresponding path program 1 times [2025-03-16 22:45:07,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:45:07,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619440908] [2025-03-16 22:45:07,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:07,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:45:07,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-16 22:45:07,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 22:45:07,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:07,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:07,429 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 22:45:07,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:45:07,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619440908] [2025-03-16 22:45:07,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619440908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:45:07,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:45:07,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:45:07,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311306755] [2025-03-16 22:45:07,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:45:07,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:45:07,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:45:07,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:45:07,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:45:07,431 INFO L87 Difference]: Start difference. First operand 142 states and 208 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 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 22:45:07,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:07,613 INFO L93 Difference]: Finished difference Result 235 states and 343 transitions. [2025-03-16 22:45:07,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:45:07,615 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 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 42 [2025-03-16 22:45:07,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:07,615 INFO L225 Difference]: With dead ends: 235 [2025-03-16 22:45:07,615 INFO L226 Difference]: Without dead ends: 146 [2025-03-16 22:45:07,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:45:07,616 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 178 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:45:07,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 600 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:45:07,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-16 22:45:07,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2025-03-16 22:45:07,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.4652777777777777) internal successors, (211), 144 states have internal predecessors, (211), 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 22:45:07,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 211 transitions. [2025-03-16 22:45:07,626 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 211 transitions. Word has length 42 [2025-03-16 22:45:07,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:07,626 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 211 transitions. [2025-03-16 22:45:07,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 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 22:45:07,627 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 211 transitions. [2025-03-16 22:45:07,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 22:45:07,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:07,628 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:45:07,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 22:45:07,628 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:07,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:07,630 INFO L85 PathProgramCache]: Analyzing trace with hash -2014081111, now seen corresponding path program 1 times [2025-03-16 22:45:07,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:45:07,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540959947] [2025-03-16 22:45:07,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:07,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:45:07,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 22:45:07,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 22:45:07,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:07,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:07,895 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 22:45:07,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:45:07,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540959947] [2025-03-16 22:45:07,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540959947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:45:07,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:45:07,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:45:07,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706029670] [2025-03-16 22:45:07,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:45:07,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:45:07,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:45:07,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:45:07,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:45:07,898 INFO L87 Difference]: Start difference. First operand 145 states and 211 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 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 22:45:08,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:08,073 INFO L93 Difference]: Finished difference Result 241 states and 349 transitions. [2025-03-16 22:45:08,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:45:08,073 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 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 43 [2025-03-16 22:45:08,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:08,074 INFO L225 Difference]: With dead ends: 241 [2025-03-16 22:45:08,074 INFO L226 Difference]: Without dead ends: 149 [2025-03-16 22:45:08,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:45:08,075 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 171 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:45:08,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 753 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:45:08,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-16 22:45:08,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145. [2025-03-16 22:45:08,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.4652777777777777) internal successors, (211), 144 states have internal predecessors, (211), 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 22:45:08,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 211 transitions. [2025-03-16 22:45:08,079 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 211 transitions. Word has length 43 [2025-03-16 22:45:08,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:08,080 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 211 transitions. [2025-03-16 22:45:08,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 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 22:45:08,080 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 211 transitions. [2025-03-16 22:45:08,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 22:45:08,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:08,080 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:45:08,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 22:45:08,081 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:08,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:08,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1799788492, now seen corresponding path program 1 times [2025-03-16 22:45:08,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:45:08,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130590514] [2025-03-16 22:45:08,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:08,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:45:08,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 22:45:08,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 22:45:08,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:08,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 22:45:08,116 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 22:45:08,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 22:45:08,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 22:45:08,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:08,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 22:45:08,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 22:45:08,176 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 22:45:08,177 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 22:45:08,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 22:45:08,181 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-16 22:45:08,212 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-16 22:45:08,222 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 22:45:08,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 10:45:08 BoogieIcfgContainer [2025-03-16 22:45:08,227 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 22:45:08,228 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 22:45:08,228 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 22:45:08,228 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 22:45:08,229 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:45:06" (3/4) ... [2025-03-16 22:45:08,231 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 22:45:08,231 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 22:45:08,232 INFO L158 Benchmark]: Toolchain (without parser) took 3495.14ms. Allocated memory is still 201.3MB. Free memory was 158.3MB in the beginning and 65.4MB in the end (delta: 92.9MB). Peak memory consumption was 95.2MB. Max. memory is 16.1GB. [2025-03-16 22:45:08,232 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:45:08,232 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.03ms. Allocated memory is still 201.3MB. Free memory was 158.3MB in the beginning and 137.2MB in the end (delta: 21.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 22:45:08,233 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.96ms. Allocated memory is still 201.3MB. Free memory was 136.8MB in the beginning and 123.5MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 22:45:08,233 INFO L158 Benchmark]: Boogie Preprocessor took 107.61ms. Allocated memory is still 201.3MB. Free memory was 123.5MB in the beginning and 115.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 22:45:08,233 INFO L158 Benchmark]: IcfgBuilder took 836.22ms. Allocated memory is still 201.3MB. Free memory was 115.1MB in the beginning and 127.3MB in the end (delta: -12.2MB). Peak memory consumption was 79.3MB. Max. memory is 16.1GB. [2025-03-16 22:45:08,234 INFO L158 Benchmark]: TraceAbstraction took 2154.30ms. Allocated memory is still 201.3MB. Free memory was 127.3MB in the beginning and 65.4MB in the end (delta: 61.9MB). Peak memory consumption was 66.1MB. Max. memory is 16.1GB. [2025-03-16 22:45:08,234 INFO L158 Benchmark]: Witness Printer took 3.35ms. Allocated memory is still 201.3MB. Free memory was 65.4MB in the beginning and 65.4MB in the end (delta: 23.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:45:08,236 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 324.03ms. Allocated memory is still 201.3MB. Free memory was 158.3MB in the beginning and 137.2MB in the end (delta: 21.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.96ms. Allocated memory is still 201.3MB. Free memory was 136.8MB in the beginning and 123.5MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 107.61ms. Allocated memory is still 201.3MB. Free memory was 123.5MB in the beginning and 115.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 836.22ms. Allocated memory is still 201.3MB. Free memory was 115.1MB in the beginning and 127.3MB in the end (delta: -12.2MB). Peak memory consumption was 79.3MB. Max. memory is 16.1GB. * TraceAbstraction took 2154.30ms. Allocated memory is still 201.3MB. Free memory was 127.3MB in the beginning and 65.4MB in the end (delta: 61.9MB). Peak memory consumption was 66.1MB. Max. memory is 16.1GB. * Witness Printer took 3.35ms. Allocated memory is still 201.3MB. Free memory was 65.4MB in the beginning and 65.4MB in the end (delta: 23.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 170. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 8); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (8 - 1); [L32] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 32); [L33] const SORT_10 msb_SORT_10 = (SORT_10)1 << (32 - 1); [L35] const SORT_31 mask_SORT_31 = (SORT_31)-1 >> (sizeof(SORT_31) * 8 - 4); [L36] const SORT_31 msb_SORT_31 = (SORT_31)1 << (4 - 1); [L38] const SORT_69 mask_SORT_69 = (SORT_69)-1 >> (sizeof(SORT_69) * 8 - 10); [L39] const SORT_69 msb_SORT_69 = (SORT_69)1 << (10 - 1); [L41] const SORT_1 var_7 = 0; [L42] const SORT_10 var_12 = 0; [L43] const SORT_1 var_21 = 1; [L44] const SORT_69 var_70 = 0; [L45] const SORT_10 var_97 = 104; [L46] const SORT_10 var_151 = 1; [L48] SORT_1 input_2; [L49] SORT_3 input_4; [L50] SORT_1 input_5; [L51] SORT_1 input_6; [L52] SORT_1 input_29; [L53] SORT_31 input_32; [L54] SORT_1 input_34; [L55] SORT_31 input_36; [L56] SORT_1 input_38; [L57] SORT_1 input_44; [L58] SORT_1 input_46; [L59] SORT_1 input_48; [L60] SORT_3 input_52; [L61] SORT_1 input_55; [L62] SORT_1 input_65; [L63] SORT_1 input_73; [L64] SORT_1 input_79; [L65] SORT_1 input_80; [L66] SORT_1 input_91; [L67] SORT_1 input_92; [L68] SORT_1 input_93; [L69] SORT_1 input_107; [L70] SORT_1 input_113; [L71] SORT_1 input_119; [L72] SORT_1 input_125; [L73] SORT_1 input_126; [L74] SORT_1 input_127; [L75] SORT_1 input_141; [L76] SORT_69 input_149; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_69=1023, var_12=0, var_151=1, var_21=1, var_70=0, var_7=0, var_97=104] [L78] SORT_1 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_69=1023, var_12=0, var_151=1, var_21=1, var_70=0, var_7=0, var_97=104] [L79] SORT_1 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_69=1023, var_12=0, var_151=1, var_21=1, var_70=0, var_7=0, var_97=104] [L80] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_69=1023, var_12=0, var_151=1, var_21=1, var_70=0, var_7=0, var_97=104] [L81] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_69=1023, var_12=0, var_151=1, var_21=1, var_70=0, var_7=0, var_97=104] [L82] SORT_1 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_69=1023, var_12=0, var_151=1, var_21=1, var_70=0, var_7=0, var_97=104] [L83] SORT_1 state_42 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_69=1023, var_12=0, var_151=1, var_21=1, var_70=0, var_7=0, var_97=104] [L84] SORT_1 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_69=1023, var_12=0, var_151=1, var_21=1, var_70=0, var_7=0, var_97=104] [L85] SORT_1 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_69=1023, var_12=0, var_151=1, var_21=1, var_70=0, var_7=0, var_97=104] [L86] SORT_1 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_69=1023, var_12=0, var_151=1, var_21=1, var_70=0, var_7=0, var_97=104] [L87] SORT_1 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_69=1023, var_12=0, var_151=1, var_21=1, var_70=0, var_7=0, var_97=104] [L88] SORT_1 state_63 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_69=1023, var_12=0, var_151=1, var_21=1, var_70=0, var_7=0, var_97=104] [L89] SORT_1 state_67 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L90] EXPR __VERIFIER_nondet_ushort() & mask_SORT_69 VAL [mask_SORT_1=1, mask_SORT_69=1023, var_12=0, var_151=1, var_21=1, var_70=0, var_7=0, var_97=104] [L90] SORT_69 state_71 = __VERIFIER_nondet_ushort() & mask_SORT_69; [L92] SORT_1 init_9_arg_1 = var_7; [L93] state_8 = init_9_arg_1 [L94] SORT_1 init_15_arg_1 = var_7; [L95] state_14 = init_15_arg_1 [L96] SORT_1 init_26_arg_1 = var_7; [L97] state_25 = init_26_arg_1 [L98] SORT_1 init_28_arg_1 = var_7; [L99] state_27 = init_28_arg_1 [L100] SORT_1 init_41_arg_1 = var_7; [L101] state_40 = init_41_arg_1 [L102] SORT_1 init_43_arg_1 = var_7; [L103] state_42 = init_43_arg_1 [L104] SORT_1 init_51_arg_1 = var_21; [L105] state_50 = init_51_arg_1 [L106] SORT_1 init_58_arg_1 = var_7; [L107] state_57 = init_58_arg_1 [L108] SORT_1 init_60_arg_1 = var_7; [L109] state_59 = init_60_arg_1 [L110] SORT_1 init_62_arg_1 = var_7; [L111] state_61 = init_62_arg_1 [L112] SORT_1 init_64_arg_1 = var_7; [L113] state_63 = init_64_arg_1 [L114] SORT_1 init_68_arg_1 = var_7; [L115] state_67 = init_68_arg_1 [L116] SORT_69 init_72_arg_1 = var_70; [L117] state_71 = init_72_arg_1 VAL [mask_SORT_1=1, mask_SORT_69=1023, state_14=0, state_25=0, state_27=0, state_40=0, state_42=0, state_50=1, state_57=0, state_59=0, state_61=0, state_63=0, state_67=0, state_71=0, state_8=0, var_12=0, var_151=1, var_21=1, var_70=0, var_7=0, var_97=104] [L120] input_2 = __VERIFIER_nondet_uchar() [L121] input_4 = __VERIFIER_nondet_uchar() [L122] input_5 = __VERIFIER_nondet_uchar() [L123] input_6 = __VERIFIER_nondet_uchar() [L124] input_29 = __VERIFIER_nondet_uchar() [L125] input_32 = __VERIFIER_nondet_uchar() [L126] input_34 = __VERIFIER_nondet_uchar() [L127] input_36 = __VERIFIER_nondet_uchar() [L128] input_38 = __VERIFIER_nondet_uchar() [L129] input_44 = __VERIFIER_nondet_uchar() [L130] input_46 = __VERIFIER_nondet_uchar() [L131] input_48 = __VERIFIER_nondet_uchar() [L132] input_52 = __VERIFIER_nondet_uchar() [L133] input_55 = __VERIFIER_nondet_uchar() [L134] input_65 = __VERIFIER_nondet_uchar() [L135] input_73 = __VERIFIER_nondet_uchar() [L136] input_79 = __VERIFIER_nondet_uchar() [L137] input_80 = __VERIFIER_nondet_uchar() [L138] input_91 = __VERIFIER_nondet_uchar() [L139] input_92 = __VERIFIER_nondet_uchar() [L140] input_93 = __VERIFIER_nondet_uchar() [L141] input_107 = __VERIFIER_nondet_uchar() [L142] input_113 = __VERIFIER_nondet_uchar() [L143] input_119 = __VERIFIER_nondet_uchar() [L144] input_125 = __VERIFIER_nondet_uchar() [L145] input_126 = __VERIFIER_nondet_uchar() [L146] input_127 = __VERIFIER_nondet_uchar() [L147] input_141 = __VERIFIER_nondet_uchar() [L148] input_149 = __VERIFIER_nondet_ushort() [L151] SORT_1 var_11_arg_0 = state_8; VAL [mask_SORT_1=1, mask_SORT_69=1023, state_14=0, state_25=0, state_27=0, state_40=0, state_42=0, state_50=1, state_57=0, state_59=0, state_61=0, state_63=0, state_67=0, state_71=0, state_8=0, var_11_arg_0=0, var_12=0, var_151=1, var_21=1, var_70=0, var_7=0, var_97=104] [L152] EXPR var_11_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_69=1023, state_14=0, state_25=0, state_27=0, state_40=0, state_42=0, state_50=1, state_57=0, state_59=0, state_61=0, state_63=0, state_67=0, state_71=0, state_8=0, var_12=0, var_151=1, var_21=1, var_70=0, var_7=0, var_97=104] [L152] var_11_arg_0 = var_11_arg_0 & mask_SORT_1 [L153] SORT_10 var_11 = var_11_arg_0; [L154] SORT_10 var_13_arg_0 = var_11; [L155] SORT_10 var_13_arg_1 = var_12; [L156] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L157] SORT_1 var_16_arg_0 = state_14; VAL [mask_SORT_1=1, mask_SORT_69=1023, state_14=0, state_25=0, state_27=0, state_40=0, state_42=0, state_50=1, state_57=0, state_59=0, state_61=0, state_63=0, state_67=0, state_71=0, state_8=0, var_12=0, var_13=1, var_151=1, var_16_arg_0=0, var_21=1, var_70=0, var_7=0, var_97=104] [L158] EXPR var_16_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_69=1023, state_14=0, state_25=0, state_27=0, state_40=0, state_42=0, state_50=1, state_57=0, state_59=0, state_61=0, state_63=0, state_67=0, state_71=0, state_8=0, var_12=0, var_13=1, var_151=1, var_21=1, var_70=0, var_7=0, var_97=104] [L158] var_16_arg_0 = var_16_arg_0 & mask_SORT_1 [L159] SORT_10 var_16 = var_16_arg_0; [L160] SORT_10 var_17_arg_0 = var_16; [L161] SORT_10 var_17_arg_1 = var_12; [L162] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L163] SORT_1 var_18_arg_0 = var_13; [L164] SORT_1 var_18_arg_1 = var_17; VAL [mask_SORT_1=1, mask_SORT_69=1023, state_14=0, state_25=0, state_27=0, state_40=0, state_42=0, state_50=1, state_57=0, state_59=0, state_61=0, state_63=0, state_67=0, state_71=0, state_8=0, var_12=0, var_151=1, var_18_arg_0=1, var_18_arg_1=1, var_21=1, var_70=0, var_7=0, var_97=104] [L165] EXPR var_18_arg_0 | var_18_arg_1 VAL [mask_SORT_1=1, mask_SORT_69=1023, state_14=0, state_25=0, state_27=0, state_40=0, state_42=0, state_50=1, state_57=0, state_59=0, state_61=0, state_63=0, state_67=0, state_71=0, state_8=0, var_12=0, var_151=1, var_21=1, var_70=0, var_7=0, var_97=104] [L165] SORT_1 var_18 = var_18_arg_0 | var_18_arg_1; [L166] SORT_1 var_22_arg_0 = var_18; [L167] SORT_1 var_22 = ~var_22_arg_0; [L168] SORT_1 var_23_arg_0 = var_21; [L169] SORT_1 var_23_arg_1 = var_22; VAL [mask_SORT_1=1, mask_SORT_69=1023, state_14=0, state_25=0, state_27=0, state_40=0, state_42=0, state_50=1, state_57=0, state_59=0, state_61=0, state_63=0, state_67=0, state_71=0, state_8=0, var_12=0, var_151=1, var_21=1, var_23_arg_0=1, var_23_arg_1=-2, var_70=0, var_7=0, var_97=104] [L170] EXPR var_23_arg_0 & var_23_arg_1 VAL [mask_SORT_1=1, mask_SORT_69=1023, state_14=0, state_25=0, state_27=0, state_40=0, state_42=0, state_50=1, state_57=0, state_59=0, state_61=0, state_63=0, state_67=0, state_71=0, state_8=0, var_12=0, var_151=1, var_21=1, var_70=0, var_7=0, var_97=104] [L170] SORT_1 var_23 = var_23_arg_0 & var_23_arg_1; [L171] EXPR var_23 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_69=1023, state_14=0, state_25=0, state_27=0, state_40=0, state_42=0, state_50=1, state_57=0, state_59=0, state_61=0, state_63=0, state_67=0, state_71=0, state_8=0, var_12=0, var_151=1, var_21=1, var_70=0, var_7=0, var_97=104] [L171] var_23 = var_23 & mask_SORT_1 [L172] SORT_1 bad_24_arg_0 = var_23; [L173] CALL __VERIFIER_assert(!(bad_24_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 140 locations, 207 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 349 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 349 mSDsluCounter, 2354 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1710 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 707 IncrementalHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 644 mSDtfsCounter, 707 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=3, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 209 NumberOfCodeBlocks, 209 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 162 ConstructedInterpolants, 0 QuantifiedInterpolants, 392 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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 22:45:08,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p12.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 4e02c03b322d505b0cc468468d173ed639fc016c75e6d327c68381184cb6fd73 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:45:09,987 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:45:10,057 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-16 22:45:10,065 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:45:10,065 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:45:10,085 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:45:10,086 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:45:10,086 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:45:10,086 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:45:10,086 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:45:10,087 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:45:10,087 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:45:10,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:45:10,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:45:10,088 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:45:10,088 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:45:10,088 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:45:10,088 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:45:10,088 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:45:10,088 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:45:10,088 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:45:10,088 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 22:45:10,089 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 22:45:10,089 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 22:45:10,089 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:45:10,089 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:45:10,089 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:45:10,089 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:45:10,089 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:45:10,089 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:45:10,089 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:45:10,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:45:10,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:45:10,090 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:45:10,090 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:45:10,090 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:45:10,090 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 22:45:10,090 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 22:45:10,090 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:45:10,090 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:45:10,091 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:45:10,091 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:45:10,091 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 -> 4e02c03b322d505b0cc468468d173ed639fc016c75e6d327c68381184cb6fd73 [2025-03-16 22:45:10,334 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:45:10,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:45:10,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:45:10,341 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:45:10,341 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:45:10,342 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p12.c [2025-03-16 22:45:11,494 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/584d74678/d104d9ac0e5d4182ad286202087cd55a/FLAG7c778543d [2025-03-16 22:45:11,733 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:45:11,734 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p12.c [2025-03-16 22:45:11,740 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/584d74678/d104d9ac0e5d4182ad286202087cd55a/FLAG7c778543d [2025-03-16 22:45:11,757 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/584d74678/d104d9ac0e5d4182ad286202087cd55a [2025-03-16 22:45:11,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:45:11,759 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:45:11,760 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:45:11,760 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:45:11,763 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:45:11,763 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:45:11" (1/1) ... [2025-03-16 22:45:11,765 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30b0aa53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:11, skipping insertion in model container [2025-03-16 22:45:11,765 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:45:11" (1/1) ... [2025-03-16 22:45:11,781 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:45:11,882 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p12.c[1266,1279] [2025-03-16 22:45:11,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:45:11,964 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:45:11,971 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p12.c[1266,1279] [2025-03-16 22:45:12,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:45:12,043 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:45:12,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:12 WrapperNode [2025-03-16 22:45:12,044 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:45:12,045 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:45:12,046 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:45:12,046 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:45:12,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:12" (1/1) ... [2025-03-16 22:45:12,061 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:12" (1/1) ... [2025-03-16 22:45:12,084 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 482 [2025-03-16 22:45:12,084 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:45:12,085 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:45:12,085 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:45:12,085 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:45:12,090 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:12" (1/1) ... [2025-03-16 22:45:12,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:12" (1/1) ... [2025-03-16 22:45:12,095 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:12" (1/1) ... [2025-03-16 22:45:12,107 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 22:45:12,107 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:12" (1/1) ... [2025-03-16 22:45:12,107 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:12" (1/1) ... [2025-03-16 22:45:12,118 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:12" (1/1) ... [2025-03-16 22:45:12,119 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:12" (1/1) ... [2025-03-16 22:45:12,121 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:12" (1/1) ... [2025-03-16 22:45:12,125 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:12" (1/1) ... [2025-03-16 22:45:12,129 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:45:12,133 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:45:12,133 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:45:12,133 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:45:12,134 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:12" (1/1) ... [2025-03-16 22:45:12,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:45:12,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:45:12,159 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 22:45:12,164 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 22:45:12,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:45:12,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 22:45:12,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:45:12,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:45:12,305 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:45:12,306 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:45:12,652 INFO L? ?]: Removed 58 outVars from TransFormulas that were not future-live. [2025-03-16 22:45:12,653 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:45:12,658 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:45:12,659 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:45:12,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:45:12 BoogieIcfgContainer [2025-03-16 22:45:12,659 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:45:12,661 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:45:12,661 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:45:12,664 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:45:12,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:45:11" (1/3) ... [2025-03-16 22:45:12,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@753814f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:45:12, skipping insertion in model container [2025-03-16 22:45:12,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:12" (2/3) ... [2025-03-16 22:45:12,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@753814f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:45:12, skipping insertion in model container [2025-03-16 22:45:12,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:45:12" (3/3) ... [2025-03-16 22:45:12,666 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p12.c [2025-03-16 22:45:12,677 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:45:12,679 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p12.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:45:12,711 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:45:12,720 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;@3988b70b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:45:12,720 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:45:12,724 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 22:45:12,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-16 22:45:12,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:12,728 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-16 22:45:12,729 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:12,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:12,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-03-16 22:45:12,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:45:12,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [326466490] [2025-03-16 22:45:12,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:12,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:45:12,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:45:12,748 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 22:45:12,750 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 22:45:12,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-16 22:45:12,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-16 22:45:12,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:12,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:12,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-16 22:45:12,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:45:13,040 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 22:45:13,041 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:45:13,042 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:45:13,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326466490] [2025-03-16 22:45:13,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326466490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:45:13,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:45:13,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 22:45:13,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572538638] [2025-03-16 22:45:13,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:45:13,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:45:13,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:45:13,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:45:13,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:45:13,062 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 22:45:13,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:13,103 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-03-16 22:45:13,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:45:13,106 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 22:45:13,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:13,110 INFO L225 Difference]: With dead ends: 16 [2025-03-16 22:45:13,111 INFO L226 Difference]: Without dead ends: 9 [2025-03-16 22:45:13,114 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 22:45:13,115 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 22:45:13,116 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 22:45:13,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-03-16 22:45:13,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-03-16 22:45:13,131 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 22:45:13,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-03-16 22:45:13,135 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-03-16 22:45:13,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:13,135 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-03-16 22:45:13,135 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 22:45:13,135 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-03-16 22:45:13,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 22:45:13,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:13,136 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-16 22:45:13,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 22:45:13,340 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 22:45:13,340 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:13,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:13,341 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-03-16 22:45:13,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:45:13,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1849663096] [2025-03-16 22:45:13,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:13,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:45:13,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:45:13,344 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 22:45:13,345 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 22:45:13,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 22:45:13,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 22:45:13,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:13,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:13,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-16 22:45:13,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:45:13,937 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 22:45:13,937 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:45:20,459 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (let ((.cse12 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_42~0#1|)) (.cse13 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_57~0#1|)) (.cse5 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_67~0#1_8| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_67~0#1_8|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|)))))))))))) (.cse7 (forall ((|ULTIMATE.start_main_~input_5~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~state_67~0#1_8| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |v_ULTIMATE.start_main_~state_67~0#1_8|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~input_5~0#1|))))))))))))) (.cse10 (forall ((|v_ULTIMATE.start_main_~var_18_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_23_arg_0~0#1_10| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_23_arg_0~0#1_10|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_18_arg_1~0#1_10|)))))))))))) (_ bv0 8)))) (.cse8 (forall ((|v_ULTIMATE.start_main_~var_18_arg_1~0#1_10| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_23_arg_0~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_23_arg_0~0#1_10|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_18_arg_1~0#1_10|))))))))))))))) (.cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_7~0#1|))))))))) (let ((.cse3 (forall ((|ULTIMATE.start_main_~state_67~0#1| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_67~0#1|))))))))))) (.cse2 (forall ((|ULTIMATE.start_main_~state_67~0#1| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~state_67~0#1|)))))))))))) (.cse11 (let ((.cse31 (let ((.cse32 (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) ((_ extract 7 0) .cse28)))))))) (and (or .cse32 .cse10) (or .cse8 (not .cse32)))))) (and (or .cse5 .cse31) (or .cse31 .cse7)))) (.cse1 (let ((.cse29 (let ((.cse30 (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_8~0#1|))))))))))) (and (or .cse10 .cse30) (or .cse8 (not .cse30)))))) (and (or .cse29 .cse7) (or .cse5 .cse29)))) (.cse0 (not .cse13)) (.cse4 (not .cse12)) (.cse17 (forall ((|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))))))))) (.cse21 (forall ((|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|)))))))))))) (.cse16 (let ((.cse27 (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 .cse9)))))) (and (or .cse27 .cse10) (or .cse8 (not .cse27)))))) (and (or .cse0 (and (or (and (or .cse1 .cse2) (or .cse1 .cse3)) .cse4) (or (and (or .cse2 (let ((.cse6 (and (or .cse8 (forall ((|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (not (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|)))))))))))))))) (or (forall ((|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|)))))))))))))) .cse10)))) (and (or .cse5 .cse6) (or .cse7 .cse6)))) (or .cse11 .cse3)) .cse12))) (or .cse13 (let ((.cse14 (let ((.cse15 (and (or .cse16 .cse7) (or .cse5 (and (or .cse10 (forall ((|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))))))))))) (or .cse8 (forall ((|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (not (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))))))))))))))))) (and (or .cse15 .cse3) (or .cse15 .cse2))))) (and (or .cse14 .cse12) (or .cse14 .cse4)))) (or (and (or (let ((.cse18 (and (or .cse10 (forall ((|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse19 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))) (or (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse19)))))))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse19))))))))))) (or .cse8 (forall ((|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse20 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))) (or (not (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse20))))))))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse20)))))))))))))) (and (or .cse17 .cse11) (or .cse5 .cse18) (or .cse18 .cse7))) .cse12) (or (and (or .cse1 .cse17) (or .cse1 .cse21)) .cse4)) .cse0) (or (let ((.cse22 (and (or .cse17 .cse16 .cse7) (or .cse21 .cse16 .cse7) (or .cse5 (and (or .cse8 (forall ((|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse23 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))) (or (not (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse23))))))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse23))))))))))) (or (forall ((|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse24 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))) (or (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse24)))))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse24)))))))))) .cse10))) (or .cse5 (and (or .cse8 (forall ((|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse25 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))) (or (not (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse25))))))))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse25)))))))))) (or .cse10 (forall ((|ULTIMATE.start_main_~var_21~0#1| (_ BitVec 8))) (let ((.cse26 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21~0#1|))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse26)))))) (= |c_ULTIMATE.start_main_~var_12~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse26))))))))))))))))) (and (or .cse22 .cse12) (or .cse22 .cse4))) .cse13))))) is different from false [2025-03-16 22:45:41,960 WARN L286 SmtUtils]: Spent 10.54s on a formula simplification that was a NOOP. DAG size: 227 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-16 22:45:51,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-03-16 22:45:51,988 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:45:51,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849663096] [2025-03-16 22:45:51,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849663096] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:45:51,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 22:45:51,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-16 22:45:51,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474328760] [2025-03-16 22:45:51,989 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 22:45:51,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 22:45:51,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:45:51,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 22:45:51,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=49, Unknown=1, NotChecked=14, Total=90 [2025-03-16 22:45:51,990 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 22:45:53,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:53,191 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-03-16 22:45:53,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:45:53,191 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 22:45:53,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:53,192 INFO L225 Difference]: With dead ends: 14 [2025-03-16 22:45:53,192 INFO L226 Difference]: Without dead ends: 12 [2025-03-16 22:45:53,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=42, Invalid=71, Unknown=1, NotChecked=18, Total=132 [2025-03-16 22:45:53,193 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:45:53,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 17 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 7 Unchecked, 0.5s Time] [2025-03-16 22:45:53,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-03-16 22:45:53,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2025-03-16 22:45:53,194 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 22:45:53,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2025-03-16 22:45:53,194 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2025-03-16 22:45:53,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:53,194 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2025-03-16 22:45:53,195 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 22:45:53,195 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2025-03-16 22:45:53,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-16 22:45:53,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:53,198 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2025-03-16 22:45:53,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 22:45:53,398 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 22:45:53,398 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:53,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:53,399 INFO L85 PathProgramCache]: Analyzing trace with hash 55678175, now seen corresponding path program 2 times [2025-03-16 22:45:53,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:45:53,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [884432374] [2025-03-16 22:45:53,400 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 22:45:53,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:45:53,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:45:53,403 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 22:45:53,404 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 22:45:53,516 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-16 22:45:53,547 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-16 22:45:53,548 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 22:45:53,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:53,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-16 22:45:53,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:45:59,185 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 22:45:59,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:46:10,399 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-03-16 22:46:10,399 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 101 [2025-03-16 22:46:10,399 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:46:10,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884432374] [2025-03-16 22:46:10,400 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2025-03-16 22:46:10,408 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 22:46:10,602 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 22:46:10,603 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:912) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:555) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 45 more [2025-03-16 22:46:10,607 INFO L158 Benchmark]: Toolchain (without parser) took 58847.37ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 90.8MB in the beginning and 256.9MB in the end (delta: -166.1MB). Peak memory consumption was 144.7MB. Max. memory is 16.1GB. [2025-03-16 22:46:10,607 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 83.9MB. Free memory was 61.6MB in the beginning and 61.6MB in the end (delta: 18.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:46:10,607 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.70ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 70.7MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 22:46:10,607 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.06ms. Allocated memory is still 117.4MB. Free memory was 70.7MB in the beginning and 67.1MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 22:46:10,607 INFO L158 Benchmark]: Boogie Preprocessor took 47.67ms. Allocated memory is still 117.4MB. Free memory was 67.1MB in the beginning and 63.2MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:46:10,609 INFO L158 Benchmark]: IcfgBuilder took 526.00ms. Allocated memory is still 117.4MB. Free memory was 63.2MB in the beginning and 77.1MB in the end (delta: -13.9MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. [2025-03-16 22:46:10,609 INFO L158 Benchmark]: TraceAbstraction took 57945.47ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 76.4MB in the beginning and 256.9MB in the end (delta: -180.5MB). Peak memory consumption was 131.1MB. Max. memory is 16.1GB. [2025-03-16 22:46:10,610 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 83.9MB. Free memory was 61.6MB in the beginning and 61.6MB in the end (delta: 18.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 284.70ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 70.7MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.06ms. Allocated memory is still 117.4MB. Free memory was 70.7MB in the beginning and 67.1MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.67ms. Allocated memory is still 117.4MB. Free memory was 67.1MB in the beginning and 63.2MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 526.00ms. Allocated memory is still 117.4MB. Free memory was 63.2MB in the beginning and 77.1MB in the end (delta: -13.9MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. * TraceAbstraction took 57945.47ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 76.4MB in the beginning and 256.9MB in the end (delta: -180.5MB). Peak memory consumption was 131.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")