./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.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_p15.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 0d0a862dd3f95e8b2502b6a1be20dfc20f0039208cf14059ff6db118b9fb41b2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:45:18,922 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:45:18,977 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:18,982 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:45:18,984 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:45:19,001 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:45:19,002 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:45:19,002 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:45:19,002 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:45:19,002 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:45:19,002 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:45:19,002 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:45:19,003 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:45:19,003 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:45:19,003 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:45:19,003 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:45:19,003 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:45:19,003 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 22:45:19,003 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:45:19,003 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:45:19,003 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:45:19,003 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:45:19,004 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:45:19,004 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:45:19,004 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:45:19,004 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:45:19,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:45:19,004 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:45:19,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:45:19,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:45:19,004 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:45:19,004 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:45:19,005 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:45:19,005 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:45:19,005 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 22:45:19,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 22:45:19,005 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:45:19,005 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:45:19,005 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:45:19,005 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:45:19,005 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 -> 0d0a862dd3f95e8b2502b6a1be20dfc20f0039208cf14059ff6db118b9fb41b2 [2025-03-16 22:45:19,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:45:19,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:45:19,267 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:45:19,268 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:45:19,268 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:45:19,269 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_p15.c [2025-03-16 22:45:20,505 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d420f70ec/bfba1d4d73a54ab48d4f737b3d9ec447/FLAG2731bb21b [2025-03-16 22:45:20,808 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:45:20,809 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c [2025-03-16 22:45:20,816 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d420f70ec/bfba1d4d73a54ab48d4f737b3d9ec447/FLAG2731bb21b [2025-03-16 22:45:20,827 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d420f70ec/bfba1d4d73a54ab48d4f737b3d9ec447 [2025-03-16 22:45:20,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:45:20,831 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:45:20,832 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:45:20,832 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:45:20,835 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:45:20,835 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:45:20" (1/1) ... [2025-03-16 22:45:20,836 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@718ab5fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:20, skipping insertion in model container [2025-03-16 22:45:20,836 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:45:20" (1/1) ... [2025-03-16 22:45:20,857 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:45:20,973 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_p15.c[1266,1279] [2025-03-16 22:45:21,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:45:21,066 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:45:21,075 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_p15.c[1266,1279] [2025-03-16 22:45:21,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:45:21,135 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:45:21,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:21 WrapperNode [2025-03-16 22:45:21,136 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:45:21,136 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:45:21,136 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:45:21,137 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:45:21,141 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:21" (1/1) ... [2025-03-16 22:45:21,153 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:21" (1/1) ... [2025-03-16 22:45:21,205 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 705 [2025-03-16 22:45:21,205 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:45:21,206 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:45:21,206 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:45:21,206 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:45:21,213 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:21" (1/1) ... [2025-03-16 22:45:21,213 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:21" (1/1) ... [2025-03-16 22:45:21,223 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:21" (1/1) ... [2025-03-16 22:45:21,257 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:21,258 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:21" (1/1) ... [2025-03-16 22:45:21,258 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:21" (1/1) ... [2025-03-16 22:45:21,276 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:21" (1/1) ... [2025-03-16 22:45:21,282 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:21" (1/1) ... [2025-03-16 22:45:21,289 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:21" (1/1) ... [2025-03-16 22:45:21,293 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:21" (1/1) ... [2025-03-16 22:45:21,306 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:45:21,308 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:45:21,308 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:45:21,308 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:45:21,309 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:21" (1/1) ... [2025-03-16 22:45:21,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:45:21,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:45:21,339 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:21,342 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:21,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:45:21,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 22:45:21,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:45:21,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:45:21,470 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:45:21,471 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:45:22,203 INFO L? ?]: Removed 340 outVars from TransFormulas that were not future-live. [2025-03-16 22:45:22,203 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:45:22,237 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:45:22,237 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:45:22,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:45:22 BoogieIcfgContainer [2025-03-16 22:45:22,237 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:45:22,239 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:45:22,239 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:45:22,243 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:45:22,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:45:20" (1/3) ... [2025-03-16 22:45:22,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@618cfd3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:45:22, skipping insertion in model container [2025-03-16 22:45:22,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:21" (2/3) ... [2025-03-16 22:45:22,244 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@618cfd3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:45:22, skipping insertion in model container [2025-03-16 22:45:22,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:45:22" (3/3) ... [2025-03-16 22:45:22,245 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c [2025-03-16 22:45:22,255 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:45:22,256 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c that has 1 procedures, 136 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:45:22,296 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:45:22,305 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;@460d5649, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:45:22,305 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:45:22,308 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 134 states have (on average 1.5) internal successors, (201), 135 states have internal predecessors, (201), 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:22,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-16 22:45:22,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:22,312 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] [2025-03-16 22:45:22,313 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:22,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:22,318 INFO L85 PathProgramCache]: Analyzing trace with hash -804968270, now seen corresponding path program 1 times [2025-03-16 22:45:22,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:45:22,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709383827] [2025-03-16 22:45:22,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:22,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:45:22,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-16 22:45:22,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-16 22:45:22,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:22,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:22,896 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:22,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:45:22,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709383827] [2025-03-16 22:45:22,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709383827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:45:22,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:45:22,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:45:22,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268935723] [2025-03-16 22:45:22,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:45:22,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:45:22,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:45:22,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:45:22,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:45:22,922 INFO L87 Difference]: Start difference. First operand has 136 states, 134 states have (on average 1.5) internal successors, (201), 135 states have internal predecessors, (201), 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 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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:23,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:23,061 INFO L93 Difference]: Finished difference Result 223 states and 331 transitions. [2025-03-16 22:45:23,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:45:23,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 38 [2025-03-16 22:45:23,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:23,068 INFO L225 Difference]: With dead ends: 223 [2025-03-16 22:45:23,069 INFO L226 Difference]: Without dead ends: 136 [2025-03-16 22:45:23,071 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:23,072 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:45:23,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 487 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:45:23,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-16 22:45:23,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-03-16 22:45:23,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.4814814814814814) internal successors, (200), 135 states have internal predecessors, (200), 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:23,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 200 transitions. [2025-03-16 22:45:23,100 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 200 transitions. Word has length 38 [2025-03-16 22:45:23,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:23,101 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 200 transitions. [2025-03-16 22:45:23,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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:23,102 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 200 transitions. [2025-03-16 22:45:23,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-16 22:45:23,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:23,103 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] [2025-03-16 22:45:23,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 22:45:23,103 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:23,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:23,104 INFO L85 PathProgramCache]: Analyzing trace with hash 820466654, now seen corresponding path program 1 times [2025-03-16 22:45:23,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:45:23,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742386809] [2025-03-16 22:45:23,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:23,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:45:23,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-16 22:45:23,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-16 22:45:23,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:23,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:23,307 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:23,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:45:23,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742386809] [2025-03-16 22:45:23,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742386809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:45:23,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:45:23,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:45:23,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647551735] [2025-03-16 22:45:23,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:45:23,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:45:23,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:45:23,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:45:23,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:45:23,309 INFO L87 Difference]: Start difference. First operand 136 states and 200 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 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:23,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:23,667 INFO L93 Difference]: Finished difference Result 330 states and 481 transitions. [2025-03-16 22:45:23,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:45:23,668 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 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 39 [2025-03-16 22:45:23,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:23,669 INFO L225 Difference]: With dead ends: 330 [2025-03-16 22:45:23,669 INFO L226 Difference]: Without dead ends: 171 [2025-03-16 22:45:23,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-16 22:45:23,670 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 457 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:45:23,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 453 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:45:23,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-16 22:45:23,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 142. [2025-03-16 22:45:23,682 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:23,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 208 transitions. [2025-03-16 22:45:23,683 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 208 transitions. Word has length 39 [2025-03-16 22:45:23,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:23,683 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 208 transitions. [2025-03-16 22:45:23,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 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:23,683 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 208 transitions. [2025-03-16 22:45:23,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-16 22:45:23,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:23,684 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:23,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 22:45:23,684 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:23,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:23,687 INFO L85 PathProgramCache]: Analyzing trace with hash 811421155, now seen corresponding path program 1 times [2025-03-16 22:45:23,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:45:23,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992686326] [2025-03-16 22:45:23,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:23,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:45:23,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-16 22:45:23,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 22:45:23,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:23,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:23,817 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:23,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:45:23,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992686326] [2025-03-16 22:45:23,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992686326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:45:23,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:45:23,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:45:23,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440332892] [2025-03-16 22:45:23,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:45:23,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:45:23,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:45:23,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:45:23,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:45:23,821 INFO L87 Difference]: Start difference. First operand 142 states and 208 transitions. 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:23,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:23,893 INFO L93 Difference]: Finished difference Result 231 states and 338 transitions. [2025-03-16 22:45:23,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:45:23,893 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:23,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:23,895 INFO L225 Difference]: With dead ends: 231 [2025-03-16 22:45:23,896 INFO L226 Difference]: Without dead ends: 144 [2025-03-16 22:45:23,896 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:23,897 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 484 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:23,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 484 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:23,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-16 22:45:23,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2025-03-16 22:45:23,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.4685314685314685) internal successors, (210), 143 states have internal predecessors, (210), 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:23,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 210 transitions. [2025-03-16 22:45:23,909 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 210 transitions. Word has length 40 [2025-03-16 22:45:23,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:23,909 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 210 transitions. [2025-03-16 22:45:23,909 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:23,909 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 210 transitions. [2025-03-16 22:45:23,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-16 22:45:23,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:23,910 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:23,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 22:45:23,910 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:23,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:23,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1315761352, now seen corresponding path program 1 times [2025-03-16 22:45:23,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:45:23,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251770375] [2025-03-16 22:45:23,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:23,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:45:23,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-16 22:45:23,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-16 22:45:23,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:23,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:24,194 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:24,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:45:24,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251770375] [2025-03-16 22:45:24,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251770375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:45:24,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:45:24,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:45:24,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406323661] [2025-03-16 22:45:24,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:45:24,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:45:24,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:45:24,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:45:24,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:45:24,197 INFO L87 Difference]: Start difference. First operand 144 states and 210 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:24,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:24,276 INFO L93 Difference]: Finished difference Result 233 states and 339 transitions. [2025-03-16 22:45:24,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:45:24,276 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:24,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:24,277 INFO L225 Difference]: With dead ends: 233 [2025-03-16 22:45:24,277 INFO L226 Difference]: Without dead ends: 144 [2025-03-16 22:45:24,277 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:24,278 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 5 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:45:24,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 474 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:45:24,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-16 22:45:24,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2025-03-16 22:45:24,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.4615384615384615) internal successors, (209), 143 states have internal predecessors, (209), 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:24,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 209 transitions. [2025-03-16 22:45:24,285 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 209 transitions. Word has length 41 [2025-03-16 22:45:24,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:24,285 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 209 transitions. [2025-03-16 22:45:24,285 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:24,285 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 209 transitions. [2025-03-16 22:45:24,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-16 22:45:24,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:24,289 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:24,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 22:45:24,290 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:24,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:24,290 INFO L85 PathProgramCache]: Analyzing trace with hash -272708440, now seen corresponding path program 1 times [2025-03-16 22:45:24,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:45:24,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471822141] [2025-03-16 22:45:24,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:24,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:45:24,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-16 22:45:24,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 22:45:24,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:24,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:24,663 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:24,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:45:24,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471822141] [2025-03-16 22:45:24,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471822141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:45:24,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:45:24,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 22:45:24,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920704367] [2025-03-16 22:45:24,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:45:24,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 22:45:24,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:45:24,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 22:45:24,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:45:24,664 INFO L87 Difference]: Start difference. First operand 144 states and 209 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 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:24,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:24,842 INFO L93 Difference]: Finished difference Result 245 states and 353 transitions. [2025-03-16 22:45:24,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 22:45:24,843 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 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:24,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:24,844 INFO L225 Difference]: With dead ends: 245 [2025-03-16 22:45:24,844 INFO L226 Difference]: Without dead ends: 156 [2025-03-16 22:45:24,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-16 22:45:24,844 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 187 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:45:24,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 938 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:45:24,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-16 22:45:24,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2025-03-16 22:45:24,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.448051948051948) internal successors, (223), 154 states have internal predecessors, (223), 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:24,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 223 transitions. [2025-03-16 22:45:24,849 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 223 transitions. Word has length 42 [2025-03-16 22:45:24,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:24,849 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 223 transitions. [2025-03-16 22:45:24,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 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:24,849 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 223 transitions. [2025-03-16 22:45:24,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 22:45:24,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:24,850 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:24,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 22:45:24,850 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:24,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:24,850 INFO L85 PathProgramCache]: Analyzing trace with hash 4426472, now seen corresponding path program 1 times [2025-03-16 22:45:24,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:45:24,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825812480] [2025-03-16 22:45:24,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:24,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:45:24,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 22:45:24,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 22:45:24,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:24,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:25,102 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:25,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:45:25,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825812480] [2025-03-16 22:45:25,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825812480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:45:25,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:45:25,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:45:25,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768432976] [2025-03-16 22:45:25,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:45:25,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:45:25,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:45:25,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:45:25,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:45:25,105 INFO L87 Difference]: Start difference. First operand 155 states and 223 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:25,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:25,602 INFO L93 Difference]: Finished difference Result 333 states and 475 transitions. [2025-03-16 22:45:25,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:45:25,603 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:25,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:25,605 INFO L225 Difference]: With dead ends: 333 [2025-03-16 22:45:25,605 INFO L226 Difference]: Without dead ends: 233 [2025-03-16 22:45:25,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-16 22:45:25,606 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 404 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:45:25,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 198 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:45:25,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-03-16 22:45:25,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 155. [2025-03-16 22:45:25,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.4415584415584415) internal successors, (222), 154 states have internal predecessors, (222), 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:25,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 222 transitions. [2025-03-16 22:45:25,617 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 222 transitions. Word has length 43 [2025-03-16 22:45:25,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:25,617 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 222 transitions. [2025-03-16 22:45:25,617 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:25,617 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 222 transitions. [2025-03-16 22:45:25,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 22:45:25,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:25,618 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:25,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 22:45:25,618 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:25,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:25,619 INFO L85 PathProgramCache]: Analyzing trace with hash 199054387, now seen corresponding path program 1 times [2025-03-16 22:45:25,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:45:25,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275652194] [2025-03-16 22:45:25,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:25,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:45:25,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 22:45:25,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 22:45:25,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:25,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:26,149 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:26,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:45:26,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275652194] [2025-03-16 22:45:26,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275652194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:45:26,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:45:26,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 22:45:26,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603049326] [2025-03-16 22:45:26,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:45:26,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 22:45:26,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:45:26,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 22:45:26,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-16 22:45:26,151 INFO L87 Difference]: Start difference. First operand 155 states and 222 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 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:26,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:26,423 INFO L93 Difference]: Finished difference Result 258 states and 369 transitions. [2025-03-16 22:45:26,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 22:45:26,424 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 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:26,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:26,424 INFO L225 Difference]: With dead ends: 258 [2025-03-16 22:45:26,425 INFO L226 Difference]: Without dead ends: 160 [2025-03-16 22:45:26,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-16 22:45:26,426 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 191 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:45:26,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 998 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:45:26,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-16 22:45:26,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2025-03-16 22:45:26,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 1.4367088607594938) internal successors, (227), 158 states have internal predecessors, (227), 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:26,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 227 transitions. [2025-03-16 22:45:26,437 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 227 transitions. Word has length 43 [2025-03-16 22:45:26,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:26,437 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 227 transitions. [2025-03-16 22:45:26,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 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:26,438 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 227 transitions. [2025-03-16 22:45:26,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 22:45:26,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:26,438 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, 1] [2025-03-16 22:45:26,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 22:45:26,438 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:26,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:26,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1493527333, now seen corresponding path program 1 times [2025-03-16 22:45:26,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:45:26,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147142856] [2025-03-16 22:45:26,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:26,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:45:26,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 22:45:26,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 22:45:26,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:26,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:26,542 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:26,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:45:26,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147142856] [2025-03-16 22:45:26,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147142856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:45:26,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:45:26,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:45:26,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041086935] [2025-03-16 22:45:26,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:45:26,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:45:26,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:45:26,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:45:26,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:45:26,543 INFO L87 Difference]: Start difference. First operand 159 states and 227 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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:26,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:26,653 INFO L93 Difference]: Finished difference Result 334 states and 474 transitions. [2025-03-16 22:45:26,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:45:26,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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 44 [2025-03-16 22:45:26,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:26,654 INFO L225 Difference]: With dead ends: 334 [2025-03-16 22:45:26,654 INFO L226 Difference]: Without dead ends: 228 [2025-03-16 22:45:26,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:45:26,655 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 372 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:45:26,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 456 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:45:26,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-03-16 22:45:26,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 155. [2025-03-16 22:45:26,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.4415584415584415) internal successors, (222), 154 states have internal predecessors, (222), 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:26,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 222 transitions. [2025-03-16 22:45:26,659 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 222 transitions. Word has length 44 [2025-03-16 22:45:26,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:26,660 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 222 transitions. [2025-03-16 22:45:26,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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:26,660 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 222 transitions. [2025-03-16 22:45:26,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 22:45:26,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:26,660 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, 1] [2025-03-16 22:45:26,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 22:45:26,661 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:26,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:26,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1614385143, now seen corresponding path program 1 times [2025-03-16 22:45:26,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:45:26,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642323631] [2025-03-16 22:45:26,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:26,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:45:26,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 22:45:26,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 22:45:26,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:26,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 22:45:26,686 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 22:45:26,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 22:45:26,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 22:45:26,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:26,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 22:45:26,733 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 22:45:26,733 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 22:45:26,734 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 22:45:26,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 22:45:26,739 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:45:26,769 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-16 22:45:26,781 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 22:45:26,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 10:45:26 BoogieIcfgContainer [2025-03-16 22:45:26,786 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 22:45:26,787 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 22:45:26,787 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 22:45:26,787 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 22:45:26,788 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:22" (3/4) ... [2025-03-16 22:45:26,789 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 22:45:26,790 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 22:45:26,790 INFO L158 Benchmark]: Toolchain (without parser) took 5959.91ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 110.2MB in the beginning and 175.6MB in the end (delta: -65.3MB). Peak memory consumption was 111.6MB. Max. memory is 16.1GB. [2025-03-16 22:45:26,791 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:45:26,791 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.37ms. Allocated memory is still 142.6MB. Free memory was 110.2MB in the beginning and 89.8MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 22:45:26,792 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.91ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 75.9MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 22:45:26,792 INFO L158 Benchmark]: Boogie Preprocessor took 100.47ms. Allocated memory is still 142.6MB. Free memory was 75.9MB in the beginning and 68.5MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 22:45:26,792 INFO L158 Benchmark]: IcfgBuilder took 929.65ms. Allocated memory is still 142.6MB. Free memory was 68.5MB in the beginning and 53.6MB in the end (delta: 14.9MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. [2025-03-16 22:45:26,792 INFO L158 Benchmark]: TraceAbstraction took 4547.43ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 52.5MB in the beginning and 175.7MB in the end (delta: -123.2MB). Peak memory consumption was 50.2MB. Max. memory is 16.1GB. [2025-03-16 22:45:26,793 INFO L158 Benchmark]: Witness Printer took 3.08ms. Allocated memory is still 318.8MB. Free memory was 175.7MB in the beginning and 175.6MB in the end (delta: 63.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:45:26,794 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.25ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.37ms. Allocated memory is still 142.6MB. Free memory was 110.2MB in the beginning and 89.8MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.91ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 75.9MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 100.47ms. Allocated memory is still 142.6MB. Free memory was 75.9MB in the beginning and 68.5MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 929.65ms. Allocated memory is still 142.6MB. Free memory was 68.5MB in the beginning and 53.6MB in the end (delta: 14.9MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4547.43ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 52.5MB in the beginning and 175.7MB in the end (delta: -123.2MB). Peak memory consumption was 50.2MB. Max. memory is 16.1GB. * Witness Printer took 3.08ms. Allocated memory is still 318.8MB. Free memory was 175.7MB in the beginning and 175.6MB in the end (delta: 63.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 162, overapproximation of bitwiseAnd at line 167. 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_18 mask_SORT_18 = (SORT_18)-1 >> (sizeof(SORT_18) * 8 - 4); [L36] const SORT_18 msb_SORT_18 = (SORT_18)1 << (4 - 1); [L38] const SORT_71 mask_SORT_71 = (SORT_71)-1 >> (sizeof(SORT_71) * 8 - 10); [L39] const SORT_71 msb_SORT_71 = (SORT_71)1 << (10 - 1); [L41] const SORT_1 var_7 = 0; [L42] const SORT_10 var_12 = 1; [L43] const SORT_1 var_15 = 1; [L44] const SORT_18 var_20 = 1; [L45] const SORT_71 var_72 = 0; [L46] const SORT_10 var_81 = 104; [L48] SORT_1 input_2; [L49] SORT_3 input_4; [L50] SORT_1 input_5; [L51] SORT_1 input_6; [L52] SORT_1 input_32; [L53] SORT_18 input_34; [L54] SORT_1 input_36; [L55] SORT_18 input_38; [L56] SORT_1 input_40; [L57] SORT_1 input_42; [L58] SORT_1 input_48; [L59] SORT_1 input_50; [L60] SORT_1 input_52; [L61] SORT_3 input_54; [L62] SORT_1 input_57; [L63] SORT_1 input_67; [L64] SORT_1 input_75; [L65] SORT_1 input_76; [L66] SORT_1 input_77; [L67] SORT_1 input_89; [L68] SORT_1 input_90; [L69] SORT_1 input_91; [L70] SORT_1 input_102; [L71] SORT_1 input_108; [L72] SORT_1 input_114; [L73] SORT_1 input_125; [L74] SORT_1 input_127; [L75] SORT_71 input_142; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L77] SORT_1 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L78] SORT_1 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L79] SORT_1 state_28 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L80] SORT_1 state_30 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L81] SORT_1 state_44 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L82] SORT_1 state_46 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L83] SORT_1 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L84] SORT_1 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L85] SORT_1 state_63 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L86] SORT_1 state_65 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L87] SORT_1 state_69 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L88] EXPR __VERIFIER_nondet_ushort() & mask_SORT_71 VAL [mask_SORT_1=1, mask_SORT_71=1023, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L88] SORT_71 state_73 = __VERIFIER_nondet_ushort() & mask_SORT_71; [L90] SORT_1 init_9_arg_1 = var_7; [L91] state_8 = init_9_arg_1 [L92] SORT_1 init_17_arg_1 = var_15; [L93] state_16 = init_17_arg_1 [L94] SORT_1 init_29_arg_1 = var_7; [L95] state_28 = init_29_arg_1 [L96] SORT_1 init_31_arg_1 = var_7; [L97] state_30 = init_31_arg_1 [L98] SORT_1 init_45_arg_1 = var_7; [L99] state_44 = init_45_arg_1 [L100] SORT_1 init_47_arg_1 = var_7; [L101] state_46 = init_47_arg_1 [L102] SORT_1 init_60_arg_1 = var_7; [L103] state_59 = init_60_arg_1 [L104] SORT_1 init_62_arg_1 = var_7; [L105] state_61 = init_62_arg_1 [L106] SORT_1 init_64_arg_1 = var_7; [L107] state_63 = init_64_arg_1 [L108] SORT_1 init_66_arg_1 = var_7; [L109] state_65 = init_66_arg_1 [L110] SORT_1 init_70_arg_1 = var_7; [L111] state_69 = init_70_arg_1 [L112] SORT_71 init_74_arg_1 = var_72; [L113] state_73 = init_74_arg_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, state_16=1, state_28=0, state_30=0, state_44=0, state_46=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_73=0, state_8=0, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L116] input_2 = __VERIFIER_nondet_uchar() [L117] input_4 = __VERIFIER_nondet_uchar() [L118] input_5 = __VERIFIER_nondet_uchar() [L119] input_6 = __VERIFIER_nondet_uchar() [L120] input_32 = __VERIFIER_nondet_uchar() [L121] input_34 = __VERIFIER_nondet_uchar() [L122] input_36 = __VERIFIER_nondet_uchar() [L123] input_38 = __VERIFIER_nondet_uchar() [L124] input_40 = __VERIFIER_nondet_uchar() [L125] input_42 = __VERIFIER_nondet_uchar() [L126] input_48 = __VERIFIER_nondet_uchar() [L127] input_50 = __VERIFIER_nondet_uchar() [L128] input_52 = __VERIFIER_nondet_uchar() [L129] input_54 = __VERIFIER_nondet_uchar() [L130] input_57 = __VERIFIER_nondet_uchar() [L131] input_67 = __VERIFIER_nondet_uchar() [L132] input_75 = __VERIFIER_nondet_uchar() [L133] input_76 = __VERIFIER_nondet_uchar() [L134] input_77 = __VERIFIER_nondet_uchar() [L135] input_89 = __VERIFIER_nondet_uchar() [L136] input_90 = __VERIFIER_nondet_uchar() [L137] input_91 = __VERIFIER_nondet_uchar() [L138] input_102 = __VERIFIER_nondet_uchar() [L139] input_108 = __VERIFIER_nondet_uchar() [L140] input_114 = __VERIFIER_nondet_uchar() [L141] input_125 = __VERIFIER_nondet_uchar() [L142] input_127 = __VERIFIER_nondet_uchar() [L143] input_142 = __VERIFIER_nondet_ushort() [L146] SORT_1 var_11_arg_0 = state_8; VAL [mask_SORT_1=1, mask_SORT_71=1023, state_16=1, state_28=0, state_30=0, state_44=0, state_46=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_73=0, state_8=0, var_11_arg_0=0, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L147] EXPR var_11_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, state_16=1, state_28=0, state_30=0, state_44=0, state_46=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_73=0, state_8=0, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L147] var_11_arg_0 = var_11_arg_0 & mask_SORT_1 [L148] SORT_10 var_11 = var_11_arg_0; [L149] SORT_10 var_13_arg_0 = var_11; [L150] SORT_10 var_13_arg_1 = var_12; [L151] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L152] SORT_1 var_14_arg_0 = var_13; [L153] SORT_1 var_14 = ~var_14_arg_0; [L154] SORT_1 var_19_arg_0 = state_16; VAL [mask_SORT_1=1, mask_SORT_71=1023, state_16=1, state_28=0, state_30=0, state_44=0, state_46=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_73=0, state_8=0, var_12=1, var_14=-1, var_15=1, var_19_arg_0=1, var_20=1, var_72=0, var_7=0, var_81=104] [L155] EXPR var_19_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, state_16=1, state_28=0, state_30=0, state_44=0, state_46=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_73=0, state_8=0, var_12=1, var_14=-1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L155] var_19_arg_0 = var_19_arg_0 & mask_SORT_1 [L156] SORT_18 var_19 = var_19_arg_0; [L157] SORT_18 var_21_arg_0 = var_19; [L158] SORT_18 var_21_arg_1 = var_20; [L159] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L160] SORT_1 var_22_arg_0 = var_14; [L161] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_1=1, mask_SORT_71=1023, state_16=1, state_28=0, state_30=0, state_44=0, state_46=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_73=0, state_8=0, var_12=1, var_15=1, var_20=1, var_22_arg_0=-1, var_22_arg_1=1, var_72=0, var_7=0, var_81=104] [L162] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, state_16=1, state_28=0, state_30=0, state_44=0, state_46=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_73=0, state_8=0, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L162] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L163] SORT_1 var_25_arg_0 = var_22; [L164] SORT_1 var_25 = ~var_25_arg_0; [L165] SORT_1 var_26_arg_0 = var_15; [L166] SORT_1 var_26_arg_1 = var_25; VAL [mask_SORT_1=1, mask_SORT_71=1023, state_16=1, state_28=0, state_30=0, state_44=0, state_46=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_73=0, state_8=0, var_12=1, var_15=1, var_20=1, var_26_arg_0=1, var_26_arg_1=-1, var_72=0, var_7=0, var_81=104] [L167] EXPR var_26_arg_0 & var_26_arg_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, state_16=1, state_28=0, state_30=0, state_44=0, state_46=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_73=0, state_8=0, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L167] SORT_1 var_26 = var_26_arg_0 & var_26_arg_1; [L168] EXPR var_26 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_71=1023, state_16=1, state_28=0, state_30=0, state_44=0, state_46=0, state_59=0, state_61=0, state_63=0, state_65=0, state_69=0, state_73=0, state_8=0, var_12=1, var_15=1, var_20=1, var_72=0, var_7=0, var_81=104] [L168] var_26 = var_26 & mask_SORT_1 [L169] SORT_1 bad_27_arg_0 = var_26; [L170] CALL __VERIFIER_assert(!(bad_27_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 136 locations, 201 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1616 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1616 mSDsluCounter, 4488 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3355 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2014 IncrementalHoareTripleChecker+Invalid, 2031 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 1133 mSDtfsCounter, 2014 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=7, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 182 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 374 NumberOfCodeBlocks, 374 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 322 ConstructedInterpolants, 0 QuantifiedInterpolants, 1339 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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:26,814 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_p15.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 0d0a862dd3f95e8b2502b6a1be20dfc20f0039208cf14059ff6db118b9fb41b2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:45:28,798 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:45:28,871 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:28,878 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:45:28,878 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:45:28,894 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:45:28,895 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:45:28,895 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:45:28,895 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:45:28,895 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:45:28,895 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:45:28,895 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:45:28,895 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:45:28,896 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:45:28,896 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:45:28,896 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:45:28,896 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:45:28,896 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:45:28,896 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:45:28,896 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:45:28,896 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:45:28,896 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 22:45:28,896 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 22:45:28,897 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 22:45:28,897 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:45:28,897 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:45:28,897 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:45:28,897 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:45:28,897 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:45:28,897 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:45:28,897 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:45:28,897 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:45:28,897 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:45:28,897 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:45:28,898 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:45:28,898 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:45:28,898 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 22:45:28,898 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 22:45:28,898 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:45:28,898 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:45:28,898 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:45:28,898 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:45:28,898 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 -> 0d0a862dd3f95e8b2502b6a1be20dfc20f0039208cf14059ff6db118b9fb41b2 [2025-03-16 22:45:29,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:45:29,197 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:45:29,198 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:45:29,200 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:45:29,201 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:45:29,202 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_p15.c [2025-03-16 22:45:30,422 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b26ecc294/3e51ee1cfc3a4b759a5cb46a6af77887/FLAG263f9d5ce [2025-03-16 22:45:30,658 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:45:30,658 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c [2025-03-16 22:45:30,673 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b26ecc294/3e51ee1cfc3a4b759a5cb46a6af77887/FLAG263f9d5ce [2025-03-16 22:45:30,693 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b26ecc294/3e51ee1cfc3a4b759a5cb46a6af77887 [2025-03-16 22:45:30,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:45:30,697 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:45:30,700 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:45:30,700 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:45:30,703 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:45:30,704 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:45:30" (1/1) ... [2025-03-16 22:45:30,705 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73ad26ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:30, skipping insertion in model container [2025-03-16 22:45:30,705 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:45:30" (1/1) ... [2025-03-16 22:45:30,728 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:45:30,850 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_p15.c[1266,1279] [2025-03-16 22:45:30,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:45:30,961 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:45:30,972 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_p15.c[1266,1279] [2025-03-16 22:45:31,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:45:31,064 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:45:31,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:31 WrapperNode [2025-03-16 22:45:31,068 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:45:31,069 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:45:31,069 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:45:31,070 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:45:31,074 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:31" (1/1) ... [2025-03-16 22:45:31,089 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:31" (1/1) ... [2025-03-16 22:45:31,129 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 449 [2025-03-16 22:45:31,131 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:45:31,132 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:45:31,132 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:45:31,132 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:45:31,138 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:31" (1/1) ... [2025-03-16 22:45:31,139 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:31" (1/1) ... [2025-03-16 22:45:31,146 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:31" (1/1) ... [2025-03-16 22:45:31,168 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:31,169 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:31" (1/1) ... [2025-03-16 22:45:31,169 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:31" (1/1) ... [2025-03-16 22:45:31,185 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:31" (1/1) ... [2025-03-16 22:45:31,186 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:31" (1/1) ... [2025-03-16 22:45:31,188 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:31" (1/1) ... [2025-03-16 22:45:31,194 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:31" (1/1) ... [2025-03-16 22:45:31,201 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:45:31,201 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:45:31,202 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:45:31,202 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:45:31,203 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:45:31" (1/1) ... [2025-03-16 22:45:31,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:45:31,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:45:31,233 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:31,235 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:31,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:45:31,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 22:45:31,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:45:31,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:45:31,354 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:45:31,356 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:45:31,648 INFO L? ?]: Removed 57 outVars from TransFormulas that were not future-live. [2025-03-16 22:45:31,648 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:45:31,656 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:45:31,656 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:45:31,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:45:31 BoogieIcfgContainer [2025-03-16 22:45:31,657 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:45:31,659 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:45:31,659 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:45:31,663 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:45:31,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:45:30" (1/3) ... [2025-03-16 22:45:31,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a01e23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:45:31, skipping insertion in model container [2025-03-16 22:45:31,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:31" (2/3) ... [2025-03-16 22:45:31,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a01e23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:45:31, skipping insertion in model container [2025-03-16 22:45:31,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:45:31" (3/3) ... [2025-03-16 22:45:31,666 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c [2025-03-16 22:45:31,677 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:45:31,679 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p15.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:45:31,715 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:45:31,724 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;@15da73fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:45:31,726 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:45:31,729 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:31,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-16 22:45:31,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:31,734 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-16 22:45:31,734 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:31,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:31,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-03-16 22:45:31,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:45:31,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [736422228] [2025-03-16 22:45:31,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:31,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:45:31,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:45:31,754 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:31,756 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:31,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-16 22:45:31,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-16 22:45:31,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:31,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:31,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-16 22:45:31,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:45:32,058 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:32,058 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:45:32,059 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:45:32,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736422228] [2025-03-16 22:45:32,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736422228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:45:32,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:45:32,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 22:45:32,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012262859] [2025-03-16 22:45:32,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:45:32,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:45:32,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:45:32,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:45:32,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:45:32,083 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:32,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:32,121 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-03-16 22:45:32,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:45:32,123 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:32,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:32,127 INFO L225 Difference]: With dead ends: 16 [2025-03-16 22:45:32,127 INFO L226 Difference]: Without dead ends: 9 [2025-03-16 22:45:32,129 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:32,131 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:32,131 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:32,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-03-16 22:45:32,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-03-16 22:45:32,148 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:32,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-03-16 22:45:32,153 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-03-16 22:45:32,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:32,153 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-03-16 22:45:32,153 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:32,153 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-03-16 22:45:32,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 22:45:32,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:32,154 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-16 22:45:32,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 22:45:32,358 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:32,358 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:32,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:32,359 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-03-16 22:45:32,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:45:32,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [745916746] [2025-03-16 22:45:32,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:45:32,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:45:32,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:45:32,361 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:32,363 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:32,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 22:45:32,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 22:45:32,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:45:32,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:32,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-16 22:45:32,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:45:32,744 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:32,745 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:45:33,328 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:33,328 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:45:33,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745916746] [2025-03-16 22:45:33,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745916746] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:45:33,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 22:45:33,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-16 22:45:33,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909176055] [2025-03-16 22:45:33,329 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 22:45:33,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 22:45:33,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:45:33,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 22:45:33,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-16 22:45:33,332 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:33,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:45:33,492 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2025-03-16 22:45:33,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 22:45:33,492 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:33,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:45:33,493 INFO L225 Difference]: With dead ends: 17 [2025-03-16 22:45:33,493 INFO L226 Difference]: Without dead ends: 15 [2025-03-16 22:45:33,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-03-16 22:45:33,494 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 5 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:45:33,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 14 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:45:33,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-16 22:45:33,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2025-03-16 22:45:33,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:45:33,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2025-03-16 22:45:33,500 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2025-03-16 22:45:33,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:45:33,500 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2025-03-16 22:45:33,501 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:33,501 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2025-03-16 22:45:33,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-16 22:45:33,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:45:33,501 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2025-03-16 22:45:33,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 22:45:33,702 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:33,702 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:45:33,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:45:33,704 INFO L85 PathProgramCache]: Analyzing trace with hash 852005001, now seen corresponding path program 2 times [2025-03-16 22:45:33,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:45:33,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2017050839] [2025-03-16 22:45:33,704 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 22:45:33,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:45:33,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:45:33,706 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:33,708 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:33,875 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-16 22:45:33,916 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-16 22:45:33,916 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 22:45:33,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:45:33,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-16 22:45:33,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:45:34,961 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:45:34,961 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:46:48,509 WARN L286 SmtUtils]: Spent 42.20s on a formula simplification. DAG size of input: 639 DAG size of output: 634 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)