./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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.cal51.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 722f66c27e0daab44069acf5d7094f3a7f8b832453955e57154e2bc2fe9dd95b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:08:52,850 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:08:52,912 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 17:08:52,917 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:08:52,917 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:08:52,940 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:08:52,941 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:08:52,941 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:08:52,942 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:08:52,942 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:08:52,942 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:08:52,942 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:08:52,942 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:08:52,942 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:08:52,942 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:08:52,942 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:08:52,943 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:08:52,943 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 17:08:52,943 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:08:52,943 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:08:52,943 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:08:52,943 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:08:52,943 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:08:52,943 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:08:52,943 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:08:52,943 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:08:52,944 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:08:52,944 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:08:52,944 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:08:52,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:08:52,944 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:08:52,944 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:08:52,944 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:08:52,944 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:08:52,944 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 17:08:52,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 17:08:52,944 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:08:52,945 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:08:52,945 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:08:52,945 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:08:52,945 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 -> 722f66c27e0daab44069acf5d7094f3a7f8b832453955e57154e2bc2fe9dd95b [2025-03-03 17:08:53,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:08:53,172 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:08:53,175 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:08:53,176 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:08:53,176 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:08:53,177 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c [2025-03-03 17:08:54,302 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a8e75e70/b6137f90a7ff439986d9a5ea35ba14f9/FLAG8de2580c9 [2025-03-03 17:08:54,554 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:08:54,556 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c [2025-03-03 17:08:54,563 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a8e75e70/b6137f90a7ff439986d9a5ea35ba14f9/FLAG8de2580c9 [2025-03-03 17:08:54,873 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a8e75e70/b6137f90a7ff439986d9a5ea35ba14f9 [2025-03-03 17:08:54,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:08:54,876 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:08:54,877 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:08:54,877 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:08:54,880 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:08:54,880 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:08:54" (1/1) ... [2025-03-03 17:08:54,881 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fa6c45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:08:54, skipping insertion in model container [2025-03-03 17:08:54,881 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:08:54" (1/1) ... [2025-03-03 17:08:54,897 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:08:55,011 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.cal51.c[1245,1258] [2025-03-03 17:08:55,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:08:55,093 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:08:55,101 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.cal51.c[1245,1258] [2025-03-03 17:08:55,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:08:55,152 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:08:55,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:08:55 WrapperNode [2025-03-03 17:08:55,154 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:08:55,154 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:08:55,155 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:08:55,155 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:08:55,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:08:55" (1/1) ... [2025-03-03 17:08:55,167 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:08:55" (1/1) ... [2025-03-03 17:08:55,226 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 369 [2025-03-03 17:08:55,227 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:08:55,229 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:08:55,229 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:08:55,229 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:08:55,235 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:08:55" (1/1) ... [2025-03-03 17:08:55,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:08:55" (1/1) ... [2025-03-03 17:08:55,247 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:08:55" (1/1) ... [2025-03-03 17:08:55,273 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-03-03 17:08:55,276 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:08:55" (1/1) ... [2025-03-03 17:08:55,278 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:08:55" (1/1) ... [2025-03-03 17:08:55,295 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:08:55" (1/1) ... [2025-03-03 17:08:55,300 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:08:55" (1/1) ... [2025-03-03 17:08:55,304 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:08:55" (1/1) ... [2025-03-03 17:08:55,306 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:08:55" (1/1) ... [2025-03-03 17:08:55,312 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:08:55,312 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:08:55,313 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:08:55,313 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:08:55,313 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:08:55" (1/1) ... [2025-03-03 17:08:55,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:08:55,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:08:55,337 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-03 17:08:55,339 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-03 17:08:55,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:08:55,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 17:08:55,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 17:08:55,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:08:55,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:08:55,447 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:08:55,448 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:08:55,928 INFO L? ?]: Removed 168 outVars from TransFormulas that were not future-live. [2025-03-03 17:08:55,929 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:08:55,955 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:08:55,956 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:08:55,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:08:55 BoogieIcfgContainer [2025-03-03 17:08:55,957 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:08:55,959 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:08:55,959 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:08:55,963 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:08:55,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:08:54" (1/3) ... [2025-03-03 17:08:55,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d85e7c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:08:55, skipping insertion in model container [2025-03-03 17:08:55,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:08:55" (2/3) ... [2025-03-03 17:08:55,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d85e7c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:08:55, skipping insertion in model container [2025-03-03 17:08:55,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:08:55" (3/3) ... [2025-03-03 17:08:55,965 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal51.c [2025-03-03 17:08:55,977 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:08:55,978 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal51.c that has 1 procedures, 90 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:08:56,021 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:08:56,031 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;@6f5e86f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:08:56,032 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:08:56,035 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 88 states have (on average 1.4886363636363635) internal successors, (131), 89 states have internal predecessors, (131), 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-03 17:08:56,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 17:08:56,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:08:56,042 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-03 17:08:56,042 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:08:56,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:08:56,047 INFO L85 PathProgramCache]: Analyzing trace with hash 62576334, now seen corresponding path program 1 times [2025-03-03 17:08:56,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:08:56,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009564024] [2025-03-03 17:08:56,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:08:56,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:08:56,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 17:08:56,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 17:08:56,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:08:56,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:08:56,594 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-03 17:08:56,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:08:56,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009564024] [2025-03-03 17:08:56,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009564024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:08:56,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:08:56,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:08:56,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602365241] [2025-03-03 17:08:56,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:08:56,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:08:56,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:08:56,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:08:56,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:08:56,615 INFO L87 Difference]: Start difference. First operand has 90 states, 88 states have (on average 1.4886363636363635) internal successors, (131), 89 states have internal predecessors, (131), 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.75) internal successors, (39), 4 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-03 17:08:56,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:08:56,702 INFO L93 Difference]: Finished difference Result 161 states and 237 transitions. [2025-03-03 17:08:56,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:08:56,704 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 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-03 17:08:56,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:08:56,708 INFO L225 Difference]: With dead ends: 161 [2025-03-03 17:08:56,708 INFO L226 Difference]: Without dead ends: 89 [2025-03-03 17:08:56,710 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-03 17:08:56,712 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:08:56,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 310 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:08:56,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-03 17:08:56,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-03 17:08:56,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.4659090909090908) internal successors, (129), 88 states have internal predecessors, (129), 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-03 17:08:56,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 129 transitions. [2025-03-03 17:08:56,742 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 129 transitions. Word has length 39 [2025-03-03 17:08:56,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:08:56,742 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 129 transitions. [2025-03-03 17:08:56,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 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-03 17:08:56,743 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 129 transitions. [2025-03-03 17:08:56,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 17:08:56,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:08:56,744 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-03 17:08:56,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 17:08:56,745 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:08:56,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:08:56,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1944545520, now seen corresponding path program 1 times [2025-03-03 17:08:56,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:08:56,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169305267] [2025-03-03 17:08:56,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:08:56,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:08:56,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 17:08:56,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 17:08:56,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:08:56,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:08:56,930 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-03 17:08:56,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:08:56,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169305267] [2025-03-03 17:08:56,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169305267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:08:56,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:08:56,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:08:56,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958308402] [2025-03-03 17:08:56,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:08:56,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:08:56,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:08:56,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:08:56,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:08:56,932 INFO L87 Difference]: Start difference. First operand 89 states and 129 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-03 17:08:57,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:08:57,005 INFO L93 Difference]: Finished difference Result 162 states and 235 transitions. [2025-03-03 17:08:57,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:08:57,007 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-03 17:08:57,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:08:57,007 INFO L225 Difference]: With dead ends: 162 [2025-03-03 17:08:57,008 INFO L226 Difference]: Without dead ends: 91 [2025-03-03 17:08:57,008 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-03 17:08:57,008 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:08:57,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 307 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:08:57,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-03 17:08:57,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-03 17:08:57,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.4555555555555555) internal successors, (131), 90 states have internal predecessors, (131), 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-03 17:08:57,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 131 transitions. [2025-03-03 17:08:57,016 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 131 transitions. Word has length 40 [2025-03-03 17:08:57,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:08:57,016 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 131 transitions. [2025-03-03 17:08:57,016 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-03 17:08:57,016 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 131 transitions. [2025-03-03 17:08:57,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-03 17:08:57,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:08:57,018 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-03 17:08:57,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 17:08:57,019 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:08:57,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:08:57,022 INFO L85 PathProgramCache]: Analyzing trace with hash 2082878217, now seen corresponding path program 1 times [2025-03-03 17:08:57,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:08:57,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342223483] [2025-03-03 17:08:57,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:08:57,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:08:57,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-03 17:08:57,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 17:08:57,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:08:57,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:08:57,303 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-03 17:08:57,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:08:57,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342223483] [2025-03-03 17:08:57,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342223483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:08:57,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:08:57,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:08:57,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487081225] [2025-03-03 17:08:57,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:08:57,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:08:57,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:08:57,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:08:57,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:08:57,305 INFO L87 Difference]: Start difference. First operand 91 states and 131 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-03 17:08:57,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:08:57,382 INFO L93 Difference]: Finished difference Result 164 states and 236 transitions. [2025-03-03 17:08:57,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:08:57,383 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-03 17:08:57,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:08:57,384 INFO L225 Difference]: With dead ends: 164 [2025-03-03 17:08:57,384 INFO L226 Difference]: Without dead ends: 91 [2025-03-03 17:08:57,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:08:57,385 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 29 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:08:57,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 280 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:08:57,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-03 17:08:57,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-03 17:08:57,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.4444444444444444) internal successors, (130), 90 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:08:57,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 130 transitions. [2025-03-03 17:08:57,389 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 130 transitions. Word has length 41 [2025-03-03 17:08:57,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:08:57,389 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 130 transitions. [2025-03-03 17:08:57,389 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-03 17:08:57,389 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 130 transitions. [2025-03-03 17:08:57,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-03 17:08:57,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:08:57,389 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-03 17:08:57,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 17:08:57,390 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:08:57,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:08:57,390 INFO L85 PathProgramCache]: Analyzing trace with hash -991433517, now seen corresponding path program 1 times [2025-03-03 17:08:57,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:08:57,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130733048] [2025-03-03 17:08:57,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:08:57,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:08:57,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-03 17:08:57,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 17:08:57,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:08:57,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:08:57,772 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-03 17:08:57,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:08:57,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130733048] [2025-03-03 17:08:57,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130733048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:08:57,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:08:57,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:08:57,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680499110] [2025-03-03 17:08:57,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:08:57,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:08:57,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:08:57,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:08:57,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:08:57,773 INFO L87 Difference]: Start difference. First operand 91 states and 130 transitions. Second operand has 7 states, 7 states have (on average 6.0) 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-03 17:08:57,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:08:57,921 INFO L93 Difference]: Finished difference Result 168 states and 240 transitions. [2025-03-03 17:08:57,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:08:57,922 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) 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-03 17:08:57,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:08:57,924 INFO L225 Difference]: With dead ends: 168 [2025-03-03 17:08:57,924 INFO L226 Difference]: Without dead ends: 95 [2025-03-03 17:08:57,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:08:57,925 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 115 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:08:57,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 430 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:08:57,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-03 17:08:57,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2025-03-03 17:08:57,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.4301075268817205) internal successors, (133), 93 states have internal predecessors, (133), 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-03 17:08:57,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 133 transitions. [2025-03-03 17:08:57,933 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 133 transitions. Word has length 42 [2025-03-03 17:08:57,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:08:57,934 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 133 transitions. [2025-03-03 17:08:57,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) 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-03 17:08:57,935 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 133 transitions. [2025-03-03 17:08:57,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 17:08:57,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:08:57,935 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-03 17:08:57,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 17:08:57,935 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:08:57,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:08:57,936 INFO L85 PathProgramCache]: Analyzing trace with hash -492688451, now seen corresponding path program 1 times [2025-03-03 17:08:57,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:08:57,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978894236] [2025-03-03 17:08:57,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:08:57,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:08:57,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 17:08:57,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 17:08:57,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:08:57,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:08:58,061 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-03 17:08:58,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:08:58,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978894236] [2025-03-03 17:08:58,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978894236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:08:58,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:08:58,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:08:58,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310965313] [2025-03-03 17:08:58,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:08:58,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:08:58,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:08:58,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:08:58,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:08:58,062 INFO L87 Difference]: Start difference. First operand 94 states and 133 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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-03 17:08:58,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:08:58,116 INFO L93 Difference]: Finished difference Result 173 states and 244 transitions. [2025-03-03 17:08:58,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:08:58,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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-03 17:08:58,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:08:58,117 INFO L225 Difference]: With dead ends: 173 [2025-03-03 17:08:58,117 INFO L226 Difference]: Without dead ends: 97 [2025-03-03 17:08:58,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-03 17:08:58,119 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:08:58,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 303 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 17:08:58,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-03 17:08:58,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-03 17:08:58,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.4166666666666667) internal successors, (136), 96 states have internal predecessors, (136), 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-03 17:08:58,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 136 transitions. [2025-03-03 17:08:58,125 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 136 transitions. Word has length 43 [2025-03-03 17:08:58,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:08:58,125 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 136 transitions. [2025-03-03 17:08:58,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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-03 17:08:58,126 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 136 transitions. [2025-03-03 17:08:58,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 17:08:58,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:08:58,126 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-03 17:08:58,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 17:08:58,126 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:08:58,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:08:58,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1403825364, now seen corresponding path program 1 times [2025-03-03 17:08:58,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:08:58,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152774230] [2025-03-03 17:08:58,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:08:58,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:08:58,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 17:08:58,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 17:08:58,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:08:58,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:08:58,284 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-03 17:08:58,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:08:58,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152774230] [2025-03-03 17:08:58,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152774230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:08:58,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:08:58,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:08:58,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887297287] [2025-03-03 17:08:58,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:08:58,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:08:58,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:08:58,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:08:58,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:08:58,285 INFO L87 Difference]: Start difference. First operand 97 states and 136 transitions. Second operand has 4 states, 4 states have (on average 11.0) 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-03 17:08:58,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:08:58,376 INFO L93 Difference]: Finished difference Result 176 states and 246 transitions. [2025-03-03 17:08:58,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:08:58,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) 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-03 17:08:58,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:08:58,378 INFO L225 Difference]: With dead ends: 176 [2025-03-03 17:08:58,378 INFO L226 Difference]: Without dead ends: 97 [2025-03-03 17:08:58,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:08:58,379 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 114 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:08:58,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 129 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:08:58,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-03 17:08:58,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-03 17:08:58,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.40625) internal successors, (135), 96 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:08:58,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 135 transitions. [2025-03-03 17:08:58,385 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 135 transitions. Word has length 44 [2025-03-03 17:08:58,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:08:58,385 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 135 transitions. [2025-03-03 17:08:58,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) 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-03 17:08:58,386 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 135 transitions. [2025-03-03 17:08:58,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 17:08:58,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:08:58,386 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, 1] [2025-03-03 17:08:58,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 17:08:58,386 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:08:58,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:08:58,389 INFO L85 PathProgramCache]: Analyzing trace with hash -511993503, now seen corresponding path program 1 times [2025-03-03 17:08:58,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:08:58,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169247707] [2025-03-03 17:08:58,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:08:58,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:08:58,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 17:08:58,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 17:08:58,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:08:58,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:08:58,648 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-03 17:08:58,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:08:58,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169247707] [2025-03-03 17:08:58,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169247707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:08:58,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:08:58,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:08:58,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832626871] [2025-03-03 17:08:58,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:08:58,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:08:58,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:08:58,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:08:58,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:08:58,651 INFO L87 Difference]: Start difference. First operand 97 states and 135 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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-03 17:08:58,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:08:58,774 INFO L93 Difference]: Finished difference Result 243 states and 335 transitions. [2025-03-03 17:08:58,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:08:58,774 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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 45 [2025-03-03 17:08:58,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:08:58,776 INFO L225 Difference]: With dead ends: 243 [2025-03-03 17:08:58,776 INFO L226 Difference]: Without dead ends: 164 [2025-03-03 17:08:58,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:08:58,778 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 299 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:08:58,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 385 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:08:58,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-03 17:08:58,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 145. [2025-03-03 17:08:58,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.3958333333333333) internal successors, (201), 144 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-03 17:08:58,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 201 transitions. [2025-03-03 17:08:58,788 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 201 transitions. Word has length 45 [2025-03-03 17:08:58,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:08:58,788 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 201 transitions. [2025-03-03 17:08:58,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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-03 17:08:58,788 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 201 transitions. [2025-03-03 17:08:58,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-03 17:08:58,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:08:58,789 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, 1, 1] [2025-03-03 17:08:58,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 17:08:58,789 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:08:58,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:08:58,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1098534179, now seen corresponding path program 1 times [2025-03-03 17:08:58,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:08:58,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475605480] [2025-03-03 17:08:58,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:08:58,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:08:58,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-03 17:08:58,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 17:08:58,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:08:58,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:08:59,045 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-03 17:08:59,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:08:59,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475605480] [2025-03-03 17:08:59,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475605480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:08:59,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:08:59,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:08:59,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878105788] [2025-03-03 17:08:59,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:08:59,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:08:59,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:08:59,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:08:59,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:08:59,050 INFO L87 Difference]: Start difference. First operand 145 states and 201 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-03 17:08:59,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:08:59,183 INFO L93 Difference]: Finished difference Result 242 states and 334 transitions. [2025-03-03 17:08:59,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:08:59,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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 46 [2025-03-03 17:08:59,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:08:59,184 INFO L225 Difference]: With dead ends: 242 [2025-03-03 17:08:59,185 INFO L226 Difference]: Without dead ends: 153 [2025-03-03 17:08:59,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:08:59,185 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 103 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:08:59,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 188 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:08:59,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-03 17:08:59,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2025-03-03 17:08:59,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 1.38) internal successors, (207), 150 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:08:59,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 207 transitions. [2025-03-03 17:08:59,189 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 207 transitions. Word has length 46 [2025-03-03 17:08:59,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:08:59,190 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 207 transitions. [2025-03-03 17:08:59,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-03 17:08:59,190 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 207 transitions. [2025-03-03 17:08:59,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 17:08:59,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:08:59,190 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, 1, 1, 1] [2025-03-03 17:08:59,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 17:08:59,191 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:08:59,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:08:59,191 INFO L85 PathProgramCache]: Analyzing trace with hash -861951507, now seen corresponding path program 1 times [2025-03-03 17:08:59,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:08:59,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820073036] [2025-03-03 17:08:59,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:08:59,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:08:59,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 17:08:59,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 17:08:59,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:08:59,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:08:59,491 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-03 17:08:59,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:08:59,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820073036] [2025-03-03 17:08:59,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820073036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:08:59,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:08:59,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:08:59,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062865306] [2025-03-03 17:08:59,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:08:59,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:08:59,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:08:59,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:08:59,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:08:59,492 INFO L87 Difference]: Start difference. First operand 151 states and 207 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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-03 17:08:59,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:08:59,573 INFO L93 Difference]: Finished difference Result 305 states and 413 transitions. [2025-03-03 17:08:59,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:08:59,573 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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 47 [2025-03-03 17:08:59,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:08:59,574 INFO L225 Difference]: With dead ends: 305 [2025-03-03 17:08:59,574 INFO L226 Difference]: Without dead ends: 217 [2025-03-03 17:08:59,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:08:59,575 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 157 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:08:59,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 393 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:08:59,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-03 17:08:59,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 213. [2025-03-03 17:08:59,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 1.3443396226415094) internal successors, (285), 212 states have internal predecessors, (285), 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-03 17:08:59,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 285 transitions. [2025-03-03 17:08:59,585 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 285 transitions. Word has length 47 [2025-03-03 17:08:59,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:08:59,585 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 285 transitions. [2025-03-03 17:08:59,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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-03 17:08:59,585 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 285 transitions. [2025-03-03 17:08:59,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 17:08:59,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:08:59,586 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, 1, 1, 1, 1] [2025-03-03 17:08:59,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 17:08:59,586 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:08:59,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:08:59,586 INFO L85 PathProgramCache]: Analyzing trace with hash -618361, now seen corresponding path program 1 times [2025-03-03 17:08:59,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:08:59,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737797572] [2025-03-03 17:08:59,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:08:59,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:08:59,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 17:08:59,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 17:08:59,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:08:59,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:08:59,787 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-03 17:08:59,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:08:59,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737797572] [2025-03-03 17:08:59,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737797572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:08:59,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:08:59,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 17:08:59,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040078726] [2025-03-03 17:08:59,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:08:59,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 17:08:59,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:08:59,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 17:08:59,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:08:59,788 INFO L87 Difference]: Start difference. First operand 213 states and 285 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 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-03 17:08:59,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:08:59,953 INFO L93 Difference]: Finished difference Result 347 states and 463 transitions. [2025-03-03 17:08:59,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 17:08:59,953 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 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 48 [2025-03-03 17:08:59,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:08:59,954 INFO L225 Difference]: With dead ends: 347 [2025-03-03 17:08:59,954 INFO L226 Difference]: Without dead ends: 234 [2025-03-03 17:08:59,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-03 17:08:59,955 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 300 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:08:59,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 566 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:08:59,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-03 17:08:59,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 216. [2025-03-03 17:08:59,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.344186046511628) internal successors, (289), 215 states have internal predecessors, (289), 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-03 17:08:59,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 289 transitions. [2025-03-03 17:08:59,959 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 289 transitions. Word has length 48 [2025-03-03 17:08:59,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:08:59,959 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 289 transitions. [2025-03-03 17:08:59,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 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-03 17:08:59,960 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 289 transitions. [2025-03-03 17:08:59,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-03 17:08:59,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:08:59,960 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, 1, 1, 1, 1, 1] [2025-03-03 17:08:59,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 17:08:59,961 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:08:59,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:08:59,961 INFO L85 PathProgramCache]: Analyzing trace with hash -938655363, now seen corresponding path program 1 times [2025-03-03 17:08:59,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:08:59,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507382572] [2025-03-03 17:08:59,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:08:59,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:08:59,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-03 17:08:59,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 17:08:59,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:08:59,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:09:00,072 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-03 17:09:00,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:09:00,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507382572] [2025-03-03 17:09:00,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507382572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:09:00,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:09:00,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:09:00,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203950684] [2025-03-03 17:09:00,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:09:00,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:09:00,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:09:00,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:09:00,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:09:00,074 INFO L87 Difference]: Start difference. First operand 216 states and 289 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-03 17:09:00,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:09:00,157 INFO L93 Difference]: Finished difference Result 382 states and 510 transitions. [2025-03-03 17:09:00,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:09:00,157 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 49 [2025-03-03 17:09:00,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:09:00,158 INFO L225 Difference]: With dead ends: 382 [2025-03-03 17:09:00,158 INFO L226 Difference]: Without dead ends: 204 [2025-03-03 17:09:00,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:09:00,159 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 106 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:09:00,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 129 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:09:00,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-03 17:09:00,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-03-03 17:09:00,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 1.3251231527093597) internal successors, (269), 203 states have internal predecessors, (269), 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-03 17:09:00,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 269 transitions. [2025-03-03 17:09:00,163 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 269 transitions. Word has length 49 [2025-03-03 17:09:00,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:09:00,164 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 269 transitions. [2025-03-03 17:09:00,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-03 17:09:00,164 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 269 transitions. [2025-03-03 17:09:00,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-03 17:09:00,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:09:00,164 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, 1, 1, 1, 1, 1, 1] [2025-03-03 17:09:00,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 17:09:00,165 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:09:00,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:09:00,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1927380759, now seen corresponding path program 1 times [2025-03-03 17:09:00,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:09:00,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784480911] [2025-03-03 17:09:00,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:09:00,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:09:00,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 17:09:00,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 17:09:00,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:09:00,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:09:00,659 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-03 17:09:00,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:09:00,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784480911] [2025-03-03 17:09:00,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784480911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:09:00,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:09:00,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 17:09:00,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967403387] [2025-03-03 17:09:00,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:09:00,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 17:09:00,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:09:00,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 17:09:00,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:09:00,660 INFO L87 Difference]: Start difference. First operand 204 states and 269 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 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-03 17:09:00,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:09:00,872 INFO L93 Difference]: Finished difference Result 329 states and 432 transitions. [2025-03-03 17:09:00,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:09:00,873 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 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 50 [2025-03-03 17:09:00,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:09:00,874 INFO L225 Difference]: With dead ends: 329 [2025-03-03 17:09:00,874 INFO L226 Difference]: Without dead ends: 222 [2025-03-03 17:09:00,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-03-03 17:09:00,874 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 287 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:09:00,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 540 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:09:00,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-03-03 17:09:00,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 208. [2025-03-03 17:09:00,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 1.3236714975845412) internal successors, (274), 207 states have internal predecessors, (274), 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-03 17:09:00,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 274 transitions. [2025-03-03 17:09:00,879 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 274 transitions. Word has length 50 [2025-03-03 17:09:00,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:09:00,879 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 274 transitions. [2025-03-03 17:09:00,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 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-03 17:09:00,879 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 274 transitions. [2025-03-03 17:09:00,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-03 17:09:00,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:09:00,879 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:09:00,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 17:09:00,880 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:09:00,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:09:00,880 INFO L85 PathProgramCache]: Analyzing trace with hash -2047113494, now seen corresponding path program 1 times [2025-03-03 17:09:00,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:09:00,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316682915] [2025-03-03 17:09:00,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:09:00,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:09:00,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-03 17:09:00,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 17:09:00,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:09:00,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:09:01,148 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-03 17:09:01,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:09:01,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316682915] [2025-03-03 17:09:01,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316682915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:09:01,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:09:01,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 17:09:01,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620307966] [2025-03-03 17:09:01,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:09:01,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 17:09:01,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:09:01,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 17:09:01,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:09:01,149 INFO L87 Difference]: Start difference. First operand 208 states and 274 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 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-03 17:09:01,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:09:01,313 INFO L93 Difference]: Finished difference Result 336 states and 444 transitions. [2025-03-03 17:09:01,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 17:09:01,314 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 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 51 [2025-03-03 17:09:01,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:09:01,315 INFO L225 Difference]: With dead ends: 336 [2025-03-03 17:09:01,315 INFO L226 Difference]: Without dead ends: 220 [2025-03-03 17:09:01,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 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-03 17:09:01,315 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 155 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:09:01,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 511 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:09:01,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-03 17:09:01,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 216. [2025-03-03 17:09:01,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.3209302325581396) internal successors, (284), 215 states have internal predecessors, (284), 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-03 17:09:01,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 284 transitions. [2025-03-03 17:09:01,322 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 284 transitions. Word has length 51 [2025-03-03 17:09:01,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:09:01,323 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 284 transitions. [2025-03-03 17:09:01,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 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-03 17:09:01,323 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 284 transitions. [2025-03-03 17:09:01,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-03 17:09:01,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:09:01,323 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:09:01,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 17:09:01,324 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:09:01,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:09:01,324 INFO L85 PathProgramCache]: Analyzing trace with hash -56918188, now seen corresponding path program 1 times [2025-03-03 17:09:01,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:09:01,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741297731] [2025-03-03 17:09:01,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:09:01,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:09:01,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-03 17:09:01,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 17:09:01,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:09:01,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:09:01,815 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-03 17:09:01,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:09:01,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741297731] [2025-03-03 17:09:01,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741297731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:09:01,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:09:01,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 17:09:01,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024249518] [2025-03-03 17:09:01,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:09:01,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 17:09:01,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:09:01,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 17:09:01,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:09:01,816 INFO L87 Difference]: Start difference. First operand 216 states and 284 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 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-03 17:09:02,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:09:02,374 INFO L93 Difference]: Finished difference Result 409 states and 533 transitions. [2025-03-03 17:09:02,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:09:02,375 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 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 51 [2025-03-03 17:09:02,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:09:02,376 INFO L225 Difference]: With dead ends: 409 [2025-03-03 17:09:02,376 INFO L226 Difference]: Without dead ends: 270 [2025-03-03 17:09:02,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-03-03 17:09:02,377 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 132 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 17:09:02,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 292 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 17:09:02,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-03 17:09:02,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 236. [2025-03-03 17:09:02,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 1.3021276595744682) internal successors, (306), 235 states have internal predecessors, (306), 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-03 17:09:02,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 306 transitions. [2025-03-03 17:09:02,386 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 306 transitions. Word has length 51 [2025-03-03 17:09:02,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:09:02,386 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 306 transitions. [2025-03-03 17:09:02,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 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-03 17:09:02,386 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 306 transitions. [2025-03-03 17:09:02,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 17:09:02,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:09:02,387 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:09:02,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 17:09:02,387 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:09:02,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:09:02,388 INFO L85 PathProgramCache]: Analyzing trace with hash -946481519, now seen corresponding path program 1 times [2025-03-03 17:09:02,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:09:02,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057006469] [2025-03-03 17:09:02,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:09:02,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:09:02,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 17:09:02,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 17:09:02,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:09:02,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:09:02,735 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-03 17:09:02,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:09:02,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057006469] [2025-03-03 17:09:02,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057006469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:09:02,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:09:02,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 17:09:02,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809069997] [2025-03-03 17:09:02,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:09:02,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 17:09:02,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:09:02,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 17:09:02,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:09:02,737 INFO L87 Difference]: Start difference. First operand 236 states and 306 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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-03 17:09:02,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:09:02,974 INFO L93 Difference]: Finished difference Result 402 states and 521 transitions. [2025-03-03 17:09:02,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 17:09:02,975 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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 52 [2025-03-03 17:09:02,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:09:02,976 INFO L225 Difference]: With dead ends: 402 [2025-03-03 17:09:02,976 INFO L226 Difference]: Without dead ends: 236 [2025-03-03 17:09:02,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-03 17:09:02,977 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 115 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:09:02,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 241 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:09:02,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-03 17:09:02,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 204. [2025-03-03 17:09:02,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 1.3004926108374384) internal successors, (264), 203 states have internal predecessors, (264), 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-03 17:09:02,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 264 transitions. [2025-03-03 17:09:02,984 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 264 transitions. Word has length 52 [2025-03-03 17:09:02,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:09:02,984 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 264 transitions. [2025-03-03 17:09:02,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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-03 17:09:02,984 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 264 transitions. [2025-03-03 17:09:02,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 17:09:02,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:09:02,985 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:09:02,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 17:09:02,985 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:09:02,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:09:02,985 INFO L85 PathProgramCache]: Analyzing trace with hash -91948030, now seen corresponding path program 1 times [2025-03-03 17:09:02,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:09:02,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566158847] [2025-03-03 17:09:02,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:09:02,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:09:02,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 17:09:03,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 17:09:03,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:09:03,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:09:03,108 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-03 17:09:03,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:09:03,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566158847] [2025-03-03 17:09:03,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566158847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:09:03,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:09:03,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:09:03,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336953423] [2025-03-03 17:09:03,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:09:03,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:09:03,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:09:03,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:09:03,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:09:03,109 INFO L87 Difference]: Start difference. First operand 204 states and 264 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-03 17:09:03,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:09:03,151 INFO L93 Difference]: Finished difference Result 322 states and 417 transitions. [2025-03-03 17:09:03,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:09:03,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 52 [2025-03-03 17:09:03,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:09:03,152 INFO L225 Difference]: With dead ends: 322 [2025-03-03 17:09:03,152 INFO L226 Difference]: Without dead ends: 204 [2025-03-03 17:09:03,152 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-03 17:09:03,153 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 9 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:09:03,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 265 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 17:09:03,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-03 17:09:03,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-03-03 17:09:03,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 1.29064039408867) internal successors, (262), 203 states have internal predecessors, (262), 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-03 17:09:03,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 262 transitions. [2025-03-03 17:09:03,157 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 262 transitions. Word has length 52 [2025-03-03 17:09:03,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:09:03,157 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 262 transitions. [2025-03-03 17:09:03,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-03 17:09:03,157 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 262 transitions. [2025-03-03 17:09:03,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 17:09:03,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:09:03,157 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:09:03,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 17:09:03,157 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:09:03,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:09:03,158 INFO L85 PathProgramCache]: Analyzing trace with hash -536853865, now seen corresponding path program 1 times [2025-03-03 17:09:03,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:09:03,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012551469] [2025-03-03 17:09:03,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:09:03,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:09:03,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 17:09:03,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 17:09:03,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:09:03,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:09:03,507 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-03 17:09:03,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:09:03,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012551469] [2025-03-03 17:09:03,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012551469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:09:03,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:09:03,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 17:09:03,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561662284] [2025-03-03 17:09:03,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:09:03,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 17:09:03,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:09:03,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 17:09:03,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:09:03,509 INFO L87 Difference]: Start difference. First operand 204 states and 262 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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-03 17:09:03,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:09:03,827 INFO L93 Difference]: Finished difference Result 328 states and 422 transitions. [2025-03-03 17:09:03,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 17:09:03,828 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 53 [2025-03-03 17:09:03,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:09:03,828 INFO L225 Difference]: With dead ends: 328 [2025-03-03 17:09:03,828 INFO L226 Difference]: Without dead ends: 214 [2025-03-03 17:09:03,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-03-03 17:09:03,829 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 147 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:09:03,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 341 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:09:03,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-03 17:09:03,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 210. [2025-03-03 17:09:03,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 1.2822966507177034) internal successors, (268), 209 states have internal predecessors, (268), 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-03 17:09:03,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 268 transitions. [2025-03-03 17:09:03,833 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 268 transitions. Word has length 53 [2025-03-03 17:09:03,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:09:03,834 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 268 transitions. [2025-03-03 17:09:03,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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-03 17:09:03,834 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 268 transitions. [2025-03-03 17:09:03,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 17:09:03,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:09:03,834 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:09:03,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 17:09:03,834 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:09:03,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:09:03,835 INFO L85 PathProgramCache]: Analyzing trace with hash -117017008, now seen corresponding path program 1 times [2025-03-03 17:09:03,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:09:03,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467732160] [2025-03-03 17:09:03,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:09:03,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:09:03,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 17:09:03,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 17:09:03,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:09:03,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:09:03,990 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-03 17:09:03,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:09:03,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467732160] [2025-03-03 17:09:03,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467732160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:09:03,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:09:03,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:09:03,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294283024] [2025-03-03 17:09:03,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:09:03,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:09:03,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:09:03,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:09:03,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:09:03,992 INFO L87 Difference]: Start difference. First operand 210 states and 268 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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-03 17:09:04,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:09:04,097 INFO L93 Difference]: Finished difference Result 335 states and 429 transitions. [2025-03-03 17:09:04,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:09:04,098 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 53 [2025-03-03 17:09:04,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:09:04,098 INFO L225 Difference]: With dead ends: 335 [2025-03-03 17:09:04,098 INFO L226 Difference]: Without dead ends: 218 [2025-03-03 17:09:04,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:09:04,099 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 10 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:09:04,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 495 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:09:04,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-03 17:09:04,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 210. [2025-03-03 17:09:04,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 1.2822966507177034) internal successors, (268), 209 states have internal predecessors, (268), 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-03 17:09:04,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 268 transitions. [2025-03-03 17:09:04,104 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 268 transitions. Word has length 53 [2025-03-03 17:09:04,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:09:04,104 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 268 transitions. [2025-03-03 17:09:04,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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-03 17:09:04,104 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 268 transitions. [2025-03-03 17:09:04,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 17:09:04,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:09:04,104 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:09:04,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 17:09:04,105 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:09:04,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:09:04,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1951065800, now seen corresponding path program 1 times [2025-03-03 17:09:04,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:09:04,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126265468] [2025-03-03 17:09:04,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:09:04,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:09:04,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 17:09:04,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 17:09:04,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:09:04,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 17:09:04,130 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 17:09:04,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 17:09:04,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 17:09:04,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:09:04,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 17:09:04,174 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 17:09:04,174 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 17:09:04,175 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 17:09:04,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 17:09:04,179 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:09:04,207 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 17:09:04,220 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 17:09:04,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 05:09:04 BoogieIcfgContainer [2025-03-03 17:09:04,222 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 17:09:04,223 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 17:09:04,223 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 17:09:04,223 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 17:09:04,223 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:08:55" (3/4) ... [2025-03-03 17:09:04,225 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 17:09:04,225 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 17:09:04,226 INFO L158 Benchmark]: Toolchain (without parser) took 9350.08ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 110.8MB in the beginning and 128.5MB in the end (delta: -17.7MB). Peak memory consumption was 184.8MB. Max. memory is 16.1GB. [2025-03-03 17:09:04,226 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 121.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:09:04,226 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.31ms. Allocated memory is still 142.6MB. Free memory was 110.3MB in the beginning and 94.9MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 17:09:04,226 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.10ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 87.0MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 17:09:04,226 INFO L158 Benchmark]: Boogie Preprocessor took 82.91ms. Allocated memory is still 142.6MB. Free memory was 86.6MB in the beginning and 81.8MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 17:09:04,226 INFO L158 Benchmark]: IcfgBuilder took 644.58ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 98.0MB in the end (delta: -16.2MB). Peak memory consumption was 49.9MB. Max. memory is 16.1GB. [2025-03-03 17:09:04,228 INFO L158 Benchmark]: TraceAbstraction took 8263.40ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 98.0MB in the beginning and 128.5MB in the end (delta: -30.5MB). Peak memory consumption was 168.5MB. Max. memory is 16.1GB. [2025-03-03 17:09:04,230 INFO L158 Benchmark]: Witness Printer took 2.54ms. Allocated memory is still 343.9MB. Free memory was 128.5MB in the beginning and 128.5MB in the end (delta: 45.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:09:04,230 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.27ms. Allocated memory is still 201.3MB. Free memory is still 121.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.31ms. Allocated memory is still 142.6MB. Free memory was 110.3MB in the beginning and 94.9MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.10ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 87.0MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.91ms. Allocated memory is still 142.6MB. Free memory was 86.6MB in the beginning and 81.8MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 644.58ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 98.0MB in the end (delta: -16.2MB). Peak memory consumption was 49.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8263.40ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 98.0MB in the beginning and 128.5MB in the end (delta: -30.5MB). Peak memory consumption was 168.5MB. Max. memory is 16.1GB. * Witness Printer took 2.54ms. Allocated memory is still 343.9MB. Free memory was 128.5MB in the beginning and 128.5MB in the end (delta: 45.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 123, overapproximation of bitwiseAnd at line 115, overapproximation of bitwiseAnd at line 128, overapproximation of bitwiseAnd at line 111, overapproximation of bitwiseAnd at line 94, overapproximation of bitwiseAnd at line 98. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 3); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (3 - 1); [L32] const SORT_27 mask_SORT_27 = (SORT_27)-1 >> (sizeof(SORT_27) * 8 - 2); [L33] const SORT_27 msb_SORT_27 = (SORT_27)1 << (2 - 1); [L35] const SORT_1 var_11 = 0; [L36] const SORT_5 var_15 = 0; [L37] const SORT_5 var_21 = 2; [L38] const SORT_5 var_24 = 1; [L39] const SORT_1 var_41 = 1; [L41] SORT_1 input_2; [L42] SORT_1 input_3; [L43] SORT_1 input_4; [L44] SORT_5 input_6; [L45] SORT_5 input_7; [L46] SORT_1 input_8; [L47] SORT_5 input_9; [L48] SORT_5 input_10; [L50] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, var_11=0, var_15=0, var_21=2, var_24=1, var_41=1] [L50] SORT_1 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L51] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, var_11=0, var_15=0, var_21=2, var_24=1, var_41=1] [L51] SORT_5 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L52] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, var_11=0, var_15=0, var_21=2, var_24=1, var_41=1] [L52] SORT_1 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L53] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, var_11=0, var_15=0, var_21=2, var_24=1, var_41=1] [L53] SORT_5 state_30 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L55] SORT_1 init_13_arg_1 = var_11; [L56] state_12 = init_13_arg_1 [L57] SORT_5 init_17_arg_1 = var_15; [L58] state_16 = init_17_arg_1 [L59] SORT_1 init_19_arg_1 = var_11; [L60] state_18 = init_19_arg_1 [L61] SORT_5 init_31_arg_1 = var_15; [L62] state_30 = init_31_arg_1 VAL [mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_15=0, var_21=2, var_24=1, var_41=1] [L65] input_2 = __VERIFIER_nondet_uchar() [L66] EXPR input_2 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_15=0, var_21=2, var_24=1, var_41=1] [L66] input_2 = input_2 & mask_SORT_1 [L67] input_3 = __VERIFIER_nondet_uchar() [L68] EXPR input_3 & mask_SORT_1 VAL [input_2=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_15=0, var_21=2, var_24=1, var_41=1] [L68] input_3 = input_3 & mask_SORT_1 [L69] input_4 = __VERIFIER_nondet_uchar() [L70] input_6 = __VERIFIER_nondet_uchar() [L71] input_7 = __VERIFIER_nondet_uchar() [L72] input_8 = __VERIFIER_nondet_uchar() [L73] input_9 = __VERIFIER_nondet_uchar() [L74] input_10 = __VERIFIER_nondet_uchar() [L77] SORT_1 var_14_arg_0 = state_12; [L78] SORT_1 var_14 = ~var_14_arg_0; [L79] SORT_1 var_20_arg_0 = state_18; [L80] SORT_5 var_20_arg_1 = state_16; [L81] SORT_5 var_20_arg_2 = input_7; [L82] SORT_5 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, state_18=0, state_30=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_41=1] [L83] EXPR var_20 & mask_SORT_5 VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, state_18=0, state_30=0, var_11=0, var_14=-1, var_15=0, var_21=2, var_24=1, var_41=1] [L83] var_20 = var_20 & mask_SORT_5 [L84] SORT_5 var_25_arg_0 = var_20; [L85] SORT_5 var_25_arg_1 = var_24; [L86] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L87] SORT_1 var_26_arg_0 = var_25; [L88] SORT_1 var_26 = ~var_26_arg_0; [L89] SORT_5 var_22_arg_0 = var_20; [L90] SORT_5 var_22_arg_1 = var_21; [L91] SORT_1 var_22 = var_22_arg_0 == var_22_arg_1; [L92] SORT_1 var_23_arg_0 = var_22; [L93] SORT_1 var_23 = ~var_23_arg_0; VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, state_18=0, state_30=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_23=-1, var_24=1, var_26=-1, var_41=1] [L94] EXPR var_23 & mask_SORT_1 VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, state_18=0, state_30=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_26=-1, var_41=1] [L94] var_23 = var_23 & mask_SORT_1 [L95] SORT_1 var_28_arg_0 = var_26; [L96] SORT_1 var_28_arg_1 = var_23; VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, state_18=0, state_30=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_26=-1, var_28_arg_0=-1, var_28_arg_1=0, var_41=1] [L97] EXPR ((SORT_27)var_28_arg_0 << 1) | var_28_arg_1 VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, state_18=0, state_30=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_26=-1, var_41=1] [L97] SORT_27 var_28 = ((SORT_27)var_28_arg_0 << 1) | var_28_arg_1; [L98] EXPR var_28 & mask_SORT_27 VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, state_18=0, state_30=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_26=-1, var_41=1] [L98] var_28 = var_28 & mask_SORT_27 [L99] SORT_27 var_29_arg_0 = var_28; [L100] SORT_1 var_29 = var_29_arg_0 == mask_SORT_27; [L101] SORT_1 var_32_arg_0 = state_18; [L102] SORT_5 var_32_arg_1 = state_30; [L103] SORT_5 var_32_arg_2 = input_7; [L104] SORT_5 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_26=-1, var_29=1, var_32=0, var_41=1] [L105] EXPR var_32 & mask_SORT_5 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_26=-1, var_29=1, var_41=1] [L105] var_32 = var_32 & mask_SORT_5 [L106] SORT_5 var_33_arg_0 = var_32; [L107] SORT_5 var_33_arg_1 = var_21; [L108] SORT_1 var_33 = var_33_arg_0 == var_33_arg_1; [L109] SORT_1 var_34_arg_0 = var_33; [L110] SORT_1 var_34 = ~var_34_arg_0; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_26=-1, var_29=1, var_32=0, var_34=-1, var_41=1] [L111] EXPR var_34 & mask_SORT_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_26=-1, var_29=1, var_32=0, var_41=1] [L111] var_34 = var_34 & mask_SORT_1 [L112] SORT_1 var_35_arg_0 = var_26; [L113] SORT_1 var_35_arg_1 = var_34; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_29=1, var_32=0, var_35_arg_0=-1, var_35_arg_1=0, var_41=1] [L114] EXPR ((SORT_27)var_35_arg_0 << 1) | var_35_arg_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_29=1, var_32=0, var_41=1] [L114] SORT_27 var_35 = ((SORT_27)var_35_arg_0 << 1) | var_35_arg_1; [L115] EXPR var_35 & mask_SORT_27 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_29=1, var_32=0, var_41=1] [L115] var_35 = var_35 & mask_SORT_27 [L116] SORT_27 var_36_arg_0 = var_35; [L117] SORT_1 var_36 = var_36_arg_0 == mask_SORT_27; [L118] SORT_1 var_37_arg_0 = var_29; [L119] SORT_1 var_37_arg_1 = var_36; [L120] SORT_1 var_37 = var_37_arg_0 == var_37_arg_1; [L121] SORT_1 var_38_arg_0 = var_14; [L122] SORT_1 var_38_arg_1 = var_37; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=2, var_24=1, var_32=0, var_38_arg_0=-1, var_38_arg_1=1, var_41=1] [L123] EXPR var_38_arg_0 | var_38_arg_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=2, var_24=1, var_32=0, var_41=1] [L123] SORT_1 var_38 = var_38_arg_0 | var_38_arg_1; [L124] SORT_1 var_42_arg_0 = var_38; [L125] SORT_1 var_42 = ~var_42_arg_0; [L126] SORT_1 var_43_arg_0 = var_41; [L127] SORT_1 var_43_arg_1 = var_42; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=2, var_24=1, var_32=0, var_41=1, var_43_arg_0=1, var_43_arg_1=-1] [L128] EXPR var_43_arg_0 & var_43_arg_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=2, var_24=1, var_32=0, var_41=1] [L128] SORT_1 var_43 = var_43_arg_0 & var_43_arg_1; [L129] EXPR var_43 & mask_SORT_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=2, var_24=1, var_32=0, var_41=1] [L129] var_43 = var_43 & mask_SORT_1 [L130] SORT_1 bad_44_arg_0 = var_43; [L131] CALL __VERIFIER_assert(!(bad_44_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.2s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2078 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2078 mSDsluCounter, 6105 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4607 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3683 IncrementalHoareTripleChecker+Invalid, 3695 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 1498 mSDtfsCounter, 3683 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236occurred in iteration=14, InterpolantAutomatonStates: 111, 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, 18 MinimizatonAttempts, 140 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 900 NumberOfCodeBlocks, 900 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 828 ConstructedInterpolants, 0 QuantifiedInterpolants, 3789 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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-03 17:09:04,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.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 722f66c27e0daab44069acf5d7094f3a7f8b832453955e57154e2bc2fe9dd95b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:09:06,038 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:09:06,123 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-03 17:09:06,129 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:09:06,131 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:09:06,153 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:09:06,153 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:09:06,154 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:09:06,154 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:09:06,154 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:09:06,154 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:09:06,154 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:09:06,154 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:09:06,154 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:09:06,154 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:09:06,154 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:09:06,154 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:09:06,154 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:09:06,154 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:09:06,155 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:09:06,155 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:09:06,155 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 17:09:06,155 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 17:09:06,155 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 17:09:06,155 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:09:06,155 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:09:06,155 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:09:06,155 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:09:06,155 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:09:06,155 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:09:06,155 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:09:06,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:09:06,155 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:09:06,155 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:09:06,155 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:09:06,155 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:09:06,156 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 17:09:06,156 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 17:09:06,156 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:09:06,156 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:09:06,156 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:09:06,156 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:09:06,156 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 -> 722f66c27e0daab44069acf5d7094f3a7f8b832453955e57154e2bc2fe9dd95b [2025-03-03 17:09:06,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:09:06,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:09:06,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:09:06,384 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:09:06,385 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:09:06,386 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c [2025-03-03 17:09:07,539 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/583c8ff5c/b5dbc3cbf44c469d96a1ad60eb54201d/FLAGac730e0e2 [2025-03-03 17:09:07,732 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:09:07,732 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c [2025-03-03 17:09:07,740 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/583c8ff5c/b5dbc3cbf44c469d96a1ad60eb54201d/FLAGac730e0e2 [2025-03-03 17:09:07,754 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/583c8ff5c/b5dbc3cbf44c469d96a1ad60eb54201d [2025-03-03 17:09:07,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:09:07,759 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:09:07,761 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:09:07,762 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:09:07,765 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:09:07,766 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:09:07" (1/1) ... [2025-03-03 17:09:07,766 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b6959f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:07, skipping insertion in model container [2025-03-03 17:09:07,766 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:09:07" (1/1) ... [2025-03-03 17:09:07,784 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:09:07,903 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.cal51.c[1245,1258] [2025-03-03 17:09:07,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:09:07,963 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:09:07,971 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c[1245,1258] [2025-03-03 17:09:07,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:09:08,004 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:09:08,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:08 WrapperNode [2025-03-03 17:09:08,005 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:09:08,005 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:09:08,005 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:09:08,005 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:09:08,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:08" (1/1) ... [2025-03-03 17:09:08,016 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:08" (1/1) ... [2025-03-03 17:09:08,032 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 209 [2025-03-03 17:09:08,032 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:09:08,033 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:09:08,033 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:09:08,033 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:09:08,040 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:08" (1/1) ... [2025-03-03 17:09:08,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:08" (1/1) ... [2025-03-03 17:09:08,047 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:08" (1/1) ... [2025-03-03 17:09:08,059 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-03-03 17:09:08,063 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:08" (1/1) ... [2025-03-03 17:09:08,063 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:08" (1/1) ... [2025-03-03 17:09:08,072 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:08" (1/1) ... [2025-03-03 17:09:08,076 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:08" (1/1) ... [2025-03-03 17:09:08,077 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:08" (1/1) ... [2025-03-03 17:09:08,078 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:08" (1/1) ... [2025-03-03 17:09:08,080 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:09:08,085 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:09:08,085 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:09:08,085 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:09:08,086 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:08" (1/1) ... [2025-03-03 17:09:08,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:09:08,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:09:08,112 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-03 17:09:08,117 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-03 17:09:08,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:09:08,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 17:09:08,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-03 17:09:08,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:09:08,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:09:08,231 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:09:08,233 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:09:08,445 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2025-03-03 17:09:08,446 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:09:08,454 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:09:08,454 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:09:08,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:09:08 BoogieIcfgContainer [2025-03-03 17:09:08,454 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:09:08,456 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:09:08,456 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:09:08,462 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:09:08,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:09:07" (1/3) ... [2025-03-03 17:09:08,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ddb5430 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:09:08, skipping insertion in model container [2025-03-03 17:09:08,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:09:08" (2/3) ... [2025-03-03 17:09:08,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ddb5430 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:09:08, skipping insertion in model container [2025-03-03 17:09:08,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:09:08" (3/3) ... [2025-03-03 17:09:08,464 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal51.c [2025-03-03 17:09:08,475 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:09:08,477 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal51.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:09:08,508 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:09:08,516 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;@7e99d66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:09:08,517 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:09:08,519 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:08,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 17:09:08,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:09:08,524 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 17:09:08,524 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:09:08,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:09:08,528 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-03 17:09:08,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:09:08,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [269279908] [2025-03-03 17:09:08,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:09:08,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:09:08,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:09:08,538 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-03 17:09:08,539 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-03 17:09:08,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 17:09:08,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 17:09:08,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:09:08,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:09:08,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 17:09:08,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:09:08,815 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-03 17:09:08,815 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 17:09:08,815 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:09:08,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269279908] [2025-03-03 17:09:08,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269279908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:09:08,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:09:08,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:09:08,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919358165] [2025-03-03 17:09:08,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:09:08,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:09:08,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 17:09:08,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:09:08,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:09:08,833 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:08,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:09:08,875 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-03-03 17:09:08,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:09:08,876 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-03 17:09:08,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:09:08,880 INFO L225 Difference]: With dead ends: 18 [2025-03-03 17:09:08,880 INFO L226 Difference]: Without dead ends: 10 [2025-03-03 17:09:08,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:09:08,885 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:09:08,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 17:09:08,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-03 17:09:08,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-03 17:09:08,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:08,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-03 17:09:08,903 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-03 17:09:08,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:09:08,903 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-03 17:09:08,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:08,903 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-03 17:09:08,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 17:09:08,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:09:08,903 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-03 17:09:08,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 17:09:09,107 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-03 17:09:09,108 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:09:09,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:09:09,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-03 17:09:09,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:09:09,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1425680265] [2025-03-03 17:09:09,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:09:09,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:09:09,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:09:09,111 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-03 17:09:09,112 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-03 17:09:09,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 17:09:09,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 17:09:09,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:09:09,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:09:09,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-03 17:09:09,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:09:09,546 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-03 17:09:09,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:09:13,068 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-03 17:09:13,068 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:09:13,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425680265] [2025-03-03 17:09:13,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425680265] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 17:09:13,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 17:09:13,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-03 17:09:13,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946854937] [2025-03-03 17:09:13,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 17:09:13,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 17:09:13,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 17:09:13,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 17:09:13,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:09:13,070 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:13,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:09:13,155 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-03-03 17:09:13,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:09:13,156 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-03 17:09:13,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:09:13,156 INFO L225 Difference]: With dead ends: 14 [2025-03-03 17:09:13,156 INFO L226 Difference]: Without dead ends: 12 [2025-03-03 17:09:13,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-03 17:09:13,157 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:09:13,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:09:13,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-03-03 17:09:13,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-03 17:09:13,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:13,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2025-03-03 17:09:13,159 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2025-03-03 17:09:13,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:09:13,159 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2025-03-03 17:09:13,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:09:13,159 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2025-03-03 17:09:13,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-03 17:09:13,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:09:13,160 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-03-03 17:09:13,170 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-03 17:09:13,360 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-03 17:09:13,360 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:09:13,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:09:13,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1791040441, now seen corresponding path program 2 times [2025-03-03 17:09:13,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:09:13,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1022648455] [2025-03-03 17:09:13,362 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 17:09:13,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:09:13,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:09:13,366 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-03 17:09:13,367 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-03 17:09:13,444 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-03 17:09:13,474 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 17:09:13,474 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 17:09:13,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:09:13,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-03 17:09:13,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:09:14,123 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:09:14,124 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:10:02,194 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:10:02,194 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:10:02,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022648455] [2025-03-03 17:10:02,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022648455] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 17:10:02,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 17:10:02,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-03-03 17:10:02,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470736225] [2025-03-03 17:10:02,195 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 17:10:02,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 17:10:02,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 17:10:02,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 17:10:02,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-03 17:10:02,196 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:10:02,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:10:02,442 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2025-03-03 17:10:02,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:10:02,442 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-03 17:10:02,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:10:02,443 INFO L225 Difference]: With dead ends: 17 [2025-03-03 17:10:02,443 INFO L226 Difference]: Without dead ends: 15 [2025-03-03 17:10:02,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-03-03 17:10:02,444 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:10:02,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:10:02,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-03 17:10:02,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-03 17:10:02,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:10:02,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2025-03-03 17:10:02,446 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2025-03-03 17:10:02,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:10:02,446 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2025-03-03 17:10:02,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:10:02,446 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2025-03-03 17:10:02,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-03 17:10:02,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:10:02,446 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2025-03-03 17:10:02,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 17:10:02,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:10:02,647 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:10:02,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:10:02,647 INFO L85 PathProgramCache]: Analyzing trace with hash -506187805, now seen corresponding path program 3 times [2025-03-03 17:10:02,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:10:02,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1568497345] [2025-03-03 17:10:02,648 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 17:10:02,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:10:02,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:10:02,650 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:10:02,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 17:10:02,742 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 4 equivalence classes. [2025-03-03 17:10:02,770 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 11 of 14 statements. [2025-03-03 17:10:02,770 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 17:10:02,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:10:02,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-03-03 17:10:02,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:10:04,114 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 17:10:04,114 INFO L312 TraceCheckSpWp]: Computing backward predicates...