./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal55.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal55.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 bee37cc3aa930a1b9dc8d03049770a16229b9136afc75c48614cf8a9ab0bb811 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 22:45:43,489 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 22:45:43,539 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-07 22:45:43,544 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 22:45:43,545 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 22:45:43,565 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 22:45:43,566 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 22:45:43,566 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 22:45:43,566 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 22:45:43,566 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 22:45:43,567 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 22:45:43,567 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 22:45:43,567 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 22:45:43,568 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 22:45:43,568 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 22:45:43,568 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 22:45:43,568 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 22:45:43,568 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 22:45:43,568 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 22:45:43,568 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 22:45:43,568 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 22:45:43,569 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 22:45:43,569 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 22:45:43,569 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 22:45:43,569 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 22:45:43,569 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 22:45:43,569 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 22:45:43,569 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 22:45:43,569 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 22:45:43,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:45:43,569 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 22:45:43,569 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 22:45:43,569 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 22:45:43,570 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 22:45:43,570 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 22:45:43,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 22:45:43,570 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 22:45:43,570 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 22:45:43,570 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 22:45:43,570 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 22:45:43,571 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-jdk21/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 -> bee37cc3aa930a1b9dc8d03049770a16229b9136afc75c48614cf8a9ab0bb811 [2025-02-07 22:45:43,775 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 22:45:43,780 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 22:45:43,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 22:45:43,782 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 22:45:43,782 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 22:45:43,782 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal55.c [2025-02-07 22:45:44,876 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6eab8bc34/20269aa5279b48828f10457b8cb9999d/FLAG64fc78169 [2025-02-07 22:45:45,130 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 22:45:45,130 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal55.c [2025-02-07 22:45:45,140 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6eab8bc34/20269aa5279b48828f10457b8cb9999d/FLAG64fc78169 [2025-02-07 22:45:45,421 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6eab8bc34/20269aa5279b48828f10457b8cb9999d [2025-02-07 22:45:45,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 22:45:45,424 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 22:45:45,425 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 22:45:45,425 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 22:45:45,428 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 22:45:45,429 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:45:45" (1/1) ... [2025-02-07 22:45:45,430 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fd648c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:45, skipping insertion in model container [2025-02-07 22:45:45,431 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:45:45" (1/1) ... [2025-02-07 22:45:45,445 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 22:45:45,541 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal55.c[1245,1258] [2025-02-07 22:45:45,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:45:45,608 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 22:45:45,616 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal55.c[1245,1258] [2025-02-07 22:45:45,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:45:45,665 INFO L204 MainTranslator]: Completed translation [2025-02-07 22:45:45,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:45 WrapperNode [2025-02-07 22:45:45,666 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 22:45:45,666 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 22:45:45,666 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 22:45:45,666 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 22:45:45,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:45" (1/1) ... [2025-02-07 22:45:45,680 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:45" (1/1) ... [2025-02-07 22:45:45,710 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 347 [2025-02-07 22:45:45,710 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 22:45:45,711 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 22:45:45,711 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 22:45:45,711 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 22:45:45,716 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:45" (1/1) ... [2025-02-07 22:45:45,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:45" (1/1) ... [2025-02-07 22:45:45,721 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:45" (1/1) ... [2025-02-07 22:45:45,742 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-02-07 22:45:45,745 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:45" (1/1) ... [2025-02-07 22:45:45,745 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:45" (1/1) ... [2025-02-07 22:45:45,754 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:45" (1/1) ... [2025-02-07 22:45:45,758 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:45" (1/1) ... [2025-02-07 22:45:45,760 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:45" (1/1) ... [2025-02-07 22:45:45,762 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:45" (1/1) ... [2025-02-07 22:45:45,766 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 22:45:45,766 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 22:45:45,766 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 22:45:45,766 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 22:45:45,767 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:45" (1/1) ... [2025-02-07 22:45:45,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:45:45,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:45:45,792 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 22:45:45,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 22:45:45,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 22:45:45,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 22:45:45,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 22:45:45,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 22:45:45,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 22:45:45,898 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 22:45:45,899 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 22:45:46,295 INFO L? ?]: Removed 156 outVars from TransFormulas that were not future-live. [2025-02-07 22:45:46,296 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 22:45:46,319 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 22:45:46,320 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 22:45:46,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:45:46 BoogieIcfgContainer [2025-02-07 22:45:46,320 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 22:45:46,323 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 22:45:46,323 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 22:45:46,326 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 22:45:46,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 10:45:45" (1/3) ... [2025-02-07 22:45:46,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@309dd9cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:45:46, skipping insertion in model container [2025-02-07 22:45:46,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:45" (2/3) ... [2025-02-07 22:45:46,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@309dd9cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:45:46, skipping insertion in model container [2025-02-07 22:45:46,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:45:46" (3/3) ... [2025-02-07 22:45:46,327 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal55.c [2025-02-07 22:45:46,337 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 22:45:46,339 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal55.c that has 1 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 22:45:46,376 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 22:45:46,384 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;@1951f7db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 22:45:46,385 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 22:45:46,388 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 78 states have (on average 1.5) internal successors, (117), 79 states have internal predecessors, (117), 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-02-07 22:45:46,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-07 22:45:46,392 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:45:46,392 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] [2025-02-07 22:45:46,392 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:45:46,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:45:46,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1452607036, now seen corresponding path program 1 times [2025-02-07 22:45:46,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:45:46,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944465580] [2025-02-07 22:45:46,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:45:46,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:45:46,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-07 22:45:46,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-07 22:45:46,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:45:46,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:45:46,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:45:46,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:45:46,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944465580] [2025-02-07 22:45:46,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944465580] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:45:46,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:45:46,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:45:46,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338153023] [2025-02-07 22:45:46,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:45:46,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:45:46,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:45:47,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:45:47,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:45:47,019 INFO L87 Difference]: Start difference. First operand has 80 states, 78 states have (on average 1.5) internal successors, (117), 79 states have internal predecessors, (117), 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 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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-02-07 22:45:47,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:45:47,101 INFO L93 Difference]: Finished difference Result 143 states and 211 transitions. [2025-02-07 22:45:47,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:45:47,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2025-02-07 22:45:47,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:45:47,107 INFO L225 Difference]: With dead ends: 143 [2025-02-07 22:45:47,108 INFO L226 Difference]: Without dead ends: 80 [2025-02-07 22:45:47,111 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-02-07 22:45:47,114 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:45:47,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 277 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:45:47,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-07 22:45:47,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-02-07 22:45:47,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.4683544303797469) internal successors, (116), 79 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:45:47,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 116 transitions. [2025-02-07 22:45:47,138 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 116 transitions. Word has length 34 [2025-02-07 22:45:47,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:45:47,138 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 116 transitions. [2025-02-07 22:45:47,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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-02-07 22:45:47,139 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 116 transitions. [2025-02-07 22:45:47,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-07 22:45:47,139 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:45:47,139 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:45:47,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 22:45:47,140 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:45:47,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:45:47,140 INFO L85 PathProgramCache]: Analyzing trace with hash 2085824320, now seen corresponding path program 1 times [2025-02-07 22:45:47,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:45:47,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092046642] [2025-02-07 22:45:47,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:45:47,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:45:47,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-07 22:45:47,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-07 22:45:47,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:45:47,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:45:47,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:45:47,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:45:47,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092046642] [2025-02-07 22:45:47,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092046642] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:45:47,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:45:47,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:45:47,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041715221] [2025-02-07 22:45:47,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:45:47,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:45:47,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:45:47,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:45:47,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:45:47,325 INFO L87 Difference]: Start difference. First operand 80 states and 116 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-02-07 22:45:47,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:45:47,399 INFO L93 Difference]: Finished difference Result 145 states and 210 transitions. [2025-02-07 22:45:47,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:45:47,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 35 [2025-02-07 22:45:47,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:45:47,400 INFO L225 Difference]: With dead ends: 145 [2025-02-07 22:45:47,400 INFO L226 Difference]: Without dead ends: 82 [2025-02-07 22:45:47,400 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-02-07 22:45:47,401 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:45:47,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 274 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:45:47,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-07 22:45:47,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-02-07 22:45:47,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.4567901234567902) internal successors, (118), 81 states have internal predecessors, (118), 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-02-07 22:45:47,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 118 transitions. [2025-02-07 22:45:47,407 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 118 transitions. Word has length 35 [2025-02-07 22:45:47,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:45:47,407 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 118 transitions. [2025-02-07 22:45:47,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-02-07 22:45:47,409 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 118 transitions. [2025-02-07 22:45:47,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-07 22:45:47,410 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:45:47,410 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] [2025-02-07 22:45:47,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 22:45:47,410 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:45:47,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:45:47,411 INFO L85 PathProgramCache]: Analyzing trace with hash -2127413577, now seen corresponding path program 1 times [2025-02-07 22:45:47,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:45:47,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856400064] [2025-02-07 22:45:47,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:45:47,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:45:47,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-07 22:45:47,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-07 22:45:47,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:45:47,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:45:47,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:45:47,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:45:47,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856400064] [2025-02-07 22:45:47,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856400064] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:45:47,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:45:47,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:45:47,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052130942] [2025-02-07 22:45:47,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:45:47,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:45:47,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:45:47,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:45:47,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:45:47,842 INFO L87 Difference]: Start difference. First operand 82 states and 118 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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-02-07 22:45:47,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:45:47,968 INFO L93 Difference]: Finished difference Result 200 states and 286 transitions. [2025-02-07 22:45:47,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:45:47,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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 36 [2025-02-07 22:45:47,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:45:47,970 INFO L225 Difference]: With dead ends: 200 [2025-02-07 22:45:47,972 INFO L226 Difference]: Without dead ends: 135 [2025-02-07 22:45:47,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-07 22:45:47,973 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 267 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 348 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-02-07 22:45:47,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 348 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:45:47,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-02-07 22:45:47,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 116. [2025-02-07 22:45:47,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.4608695652173913) internal successors, (168), 115 states have internal predecessors, (168), 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-02-07 22:45:47,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions. [2025-02-07 22:45:47,983 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 36 [2025-02-07 22:45:47,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:45:47,983 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 168 transitions. [2025-02-07 22:45:47,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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-02-07 22:45:47,984 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions. [2025-02-07 22:45:47,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-07 22:45:47,985 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:45:47,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] [2025-02-07 22:45:47,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 22:45:47,985 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:45:47,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:45:47,986 INFO L85 PathProgramCache]: Analyzing trace with hash 363051077, now seen corresponding path program 1 times [2025-02-07 22:45:47,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:45:47,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840493993] [2025-02-07 22:45:47,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:45:47,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:45:48,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-07 22:45:48,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-07 22:45:48,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:45:48,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:45:48,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:45:48,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:45:48,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840493993] [2025-02-07 22:45:48,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840493993] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:45:48,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:45:48,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 22:45:48,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418696005] [2025-02-07 22:45:48,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:45:48,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 22:45:48,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:45:48,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 22:45:48,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 22:45:48,183 INFO L87 Difference]: Start difference. First operand 116 states and 168 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-02-07 22:45:48,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:45:48,223 INFO L93 Difference]: Finished difference Result 199 states and 287 transitions. [2025-02-07 22:45:48,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 22:45:48,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 37 [2025-02-07 22:45:48,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:45:48,224 INFO L225 Difference]: With dead ends: 199 [2025-02-07 22:45:48,224 INFO L226 Difference]: Without dead ends: 116 [2025-02-07 22:45:48,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 22:45:48,226 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 2 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 22:45:48,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 182 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 22:45:48,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-07 22:45:48,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-02-07 22:45:48,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.4434782608695653) internal successors, (166), 115 states have internal predecessors, (166), 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-02-07 22:45:48,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 166 transitions. [2025-02-07 22:45:48,235 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 166 transitions. Word has length 37 [2025-02-07 22:45:48,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:45:48,235 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 166 transitions. [2025-02-07 22:45:48,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-02-07 22:45:48,235 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 166 transitions. [2025-02-07 22:45:48,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-07 22:45:48,237 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:45:48,237 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:45:48,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 22:45:48,237 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:45:48,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:45:48,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1082385310, now seen corresponding path program 1 times [2025-02-07 22:45:48,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:45:48,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747808737] [2025-02-07 22:45:48,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:45:48,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:45:48,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-07 22:45:48,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-07 22:45:48,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:45:48,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:45:48,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:45:48,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:45:48,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747808737] [2025-02-07 22:45:48,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747808737] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:45:48,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:45:48,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 22:45:48,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633572362] [2025-02-07 22:45:48,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:45:48,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:45:48,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:45:48,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:45:48,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:45:48,541 INFO L87 Difference]: Start difference. First operand 116 states and 166 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:45:48,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:45:48,614 INFO L93 Difference]: Finished difference Result 187 states and 266 transitions. [2025-02-07 22:45:48,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:45:48,614 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-02-07 22:45:48,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:45:48,615 INFO L225 Difference]: With dead ends: 187 [2025-02-07 22:45:48,615 INFO L226 Difference]: Without dead ends: 116 [2025-02-07 22:45:48,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:45:48,615 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 13 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:45:48,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 335 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:45:48,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-07 22:45:48,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-02-07 22:45:48,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.4260869565217391) internal successors, (164), 115 states have internal predecessors, (164), 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-02-07 22:45:48,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 164 transitions. [2025-02-07 22:45:48,623 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 164 transitions. Word has length 38 [2025-02-07 22:45:48,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:45:48,624 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 164 transitions. [2025-02-07 22:45:48,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:45:48,624 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 164 transitions. [2025-02-07 22:45:48,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-07 22:45:48,624 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:45:48,624 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-02-07 22:45:48,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 22:45:48,625 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:45:48,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:45:48,625 INFO L85 PathProgramCache]: Analyzing trace with hash 144280820, now seen corresponding path program 1 times [2025-02-07 22:45:48,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:45:48,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037709187] [2025-02-07 22:45:48,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:45:48,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:45:48,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-07 22:45:48,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-07 22:45:48,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:45:48,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:45:48,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:45:48,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:45:48,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037709187] [2025-02-07 22:45:48,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037709187] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:45:48,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:45:48,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:45:48,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933611415] [2025-02-07 22:45:48,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:45:48,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:45:48,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:45:48,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:45:48,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:45:48,862 INFO L87 Difference]: Start difference. First operand 116 states and 164 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:45:48,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:45:48,944 INFO L93 Difference]: Finished difference Result 203 states and 286 transitions. [2025-02-07 22:45:48,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:45:48,944 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-02-07 22:45:48,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:45:48,946 INFO L225 Difference]: With dead ends: 203 [2025-02-07 22:45:48,946 INFO L226 Difference]: Without dead ends: 124 [2025-02-07 22:45:48,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:45:48,947 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 99 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:45:48,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 316 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:45:48,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-02-07 22:45:48,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2025-02-07 22:45:48,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.411764705882353) internal successors, (168), 119 states have internal predecessors, (168), 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-02-07 22:45:48,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 168 transitions. [2025-02-07 22:45:48,951 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 168 transitions. Word has length 39 [2025-02-07 22:45:48,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:45:48,951 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 168 transitions. [2025-02-07 22:45:48,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:45:48,951 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 168 transitions. [2025-02-07 22:45:48,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-07 22:45:48,952 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:45:48,952 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-02-07 22:45:48,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 22:45:48,952 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:45:48,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:45:48,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1753945648, now seen corresponding path program 1 times [2025-02-07 22:45:48,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:45:48,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935217547] [2025-02-07 22:45:48,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:45:48,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:45:48,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-07 22:45:48,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-07 22:45:48,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:45:48,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:45:49,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:45:49,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:45:49,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935217547] [2025-02-07 22:45:49,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935217547] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:45:49,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:45:49,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:45:49,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085907155] [2025-02-07 22:45:49,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:45:49,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:45:49,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:45:49,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:45:49,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:45:49,136 INFO L87 Difference]: Start difference. First operand 120 states and 168 transitions. Second operand has 5 states, 5 states have (on average 8.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-02-07 22:45:49,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:45:49,190 INFO L93 Difference]: Finished difference Result 212 states and 295 transitions. [2025-02-07 22:45:49,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:45:49,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.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-02-07 22:45:49,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:45:49,191 INFO L225 Difference]: With dead ends: 212 [2025-02-07 22:45:49,191 INFO L226 Difference]: Without dead ends: 126 [2025-02-07 22:45:49,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:45:49,192 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 100 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 22:45:49,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 264 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 22:45:49,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-02-07 22:45:49,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-02-07 22:45:49,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.392) internal successors, (174), 125 states have internal predecessors, (174), 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-02-07 22:45:49,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 174 transitions. [2025-02-07 22:45:49,199 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 174 transitions. Word has length 40 [2025-02-07 22:45:49,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:45:49,200 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 174 transitions. [2025-02-07 22:45:49,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.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-02-07 22:45:49,200 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 174 transitions. [2025-02-07 22:45:49,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-07 22:45:49,200 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:45:49,200 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-02-07 22:45:49,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 22:45:49,200 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:45:49,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:45:49,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1461826408, now seen corresponding path program 1 times [2025-02-07 22:45:49,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:45:49,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029515453] [2025-02-07 22:45:49,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:45:49,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:45:49,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-07 22:45:49,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-07 22:45:49,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:45:49,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:45:49,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:45:49,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:45:49,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029515453] [2025-02-07 22:45:49,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029515453] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:45:49,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:45:49,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 22:45:49,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352010507] [2025-02-07 22:45:49,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:45:49,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 22:45:49,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:45:49,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 22:45:49,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-07 22:45:49,360 INFO L87 Difference]: Start difference. First operand 126 states and 174 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 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-02-07 22:45:49,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:45:49,526 INFO L93 Difference]: Finished difference Result 217 states and 297 transitions. [2025-02-07 22:45:49,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 22:45:49,526 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 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-02-07 22:45:49,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:45:49,527 INFO L225 Difference]: With dead ends: 217 [2025-02-07 22:45:49,527 INFO L226 Difference]: Without dead ends: 147 [2025-02-07 22:45:49,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-02-07 22:45:49,527 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 259 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:45:49,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 499 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:45:49,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-02-07 22:45:49,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 129. [2025-02-07 22:45:49,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.390625) internal successors, (178), 128 states have internal predecessors, (178), 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-02-07 22:45:49,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 178 transitions. [2025-02-07 22:45:49,534 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 178 transitions. Word has length 40 [2025-02-07 22:45:49,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:45:49,534 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 178 transitions. [2025-02-07 22:45:49,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 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-02-07 22:45:49,535 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 178 transitions. [2025-02-07 22:45:49,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-07 22:45:49,535 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:45:49,535 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:45:49,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 22:45:49,535 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:45:49,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:45:49,535 INFO L85 PathProgramCache]: Analyzing trace with hash -96318712, now seen corresponding path program 1 times [2025-02-07 22:45:49,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:45:49,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002287789] [2025-02-07 22:45:49,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:45:49,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:45:49,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-07 22:45:49,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-07 22:45:49,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:45:49,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:45:49,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:45:49,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:45:49,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002287789] [2025-02-07 22:45:49,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002287789] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:45:49,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:45:49,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:45:49,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413364216] [2025-02-07 22:45:49,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:45:49,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:45:49,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:45:49,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:45:49,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:45:49,672 INFO L87 Difference]: Start difference. First operand 129 states and 178 transitions. Second operand has 5 states, 5 states have (on average 8.2) 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-02-07 22:45:49,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:45:49,739 INFO L93 Difference]: Finished difference Result 218 states and 301 transitions. [2025-02-07 22:45:49,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:45:49,739 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) 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-02-07 22:45:49,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:45:49,740 INFO L225 Difference]: With dead ends: 218 [2025-02-07 22:45:49,740 INFO L226 Difference]: Without dead ends: 131 [2025-02-07 22:45:49,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:45:49,740 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 99 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:45:49,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 245 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:45:49,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-02-07 22:45:49,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-02-07 22:45:49,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.3846153846153846) internal successors, (180), 130 states have internal predecessors, (180), 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-02-07 22:45:49,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 180 transitions. [2025-02-07 22:45:49,743 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 180 transitions. Word has length 41 [2025-02-07 22:45:49,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:45:49,743 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 180 transitions. [2025-02-07 22:45:49,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) 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-02-07 22:45:49,743 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 180 transitions. [2025-02-07 22:45:49,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-07 22:45:49,744 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:45:49,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, 1, 1] [2025-02-07 22:45:49,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 22:45:49,744 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:45:49,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:45:49,744 INFO L85 PathProgramCache]: Analyzing trace with hash 317744514, now seen corresponding path program 1 times [2025-02-07 22:45:49,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:45:49,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450574976] [2025-02-07 22:45:49,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:45:49,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:45:49,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-07 22:45:49,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-07 22:45:49,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:45:49,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:45:50,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:45:50,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:45:50,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450574976] [2025-02-07 22:45:50,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450574976] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:45:50,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:45:50,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 22:45:50,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063600550] [2025-02-07 22:45:50,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:45:50,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 22:45:50,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:45:50,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 22:45:50,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-07 22:45:50,010 INFO L87 Difference]: Start difference. First operand 131 states and 180 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:45:50,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:45:50,188 INFO L93 Difference]: Finished difference Result 220 states and 299 transitions. [2025-02-07 22:45:50,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 22:45:50,188 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-02-07 22:45:50,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:45:50,189 INFO L225 Difference]: With dead ends: 220 [2025-02-07 22:45:50,189 INFO L226 Difference]: Without dead ends: 149 [2025-02-07 22:45:50,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-02-07 22:45:50,190 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 252 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:45:50,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 485 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:45:50,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-02-07 22:45:50,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 135. [2025-02-07 22:45:50,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 1.3805970149253732) internal successors, (185), 134 states have internal predecessors, (185), 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-02-07 22:45:50,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 185 transitions. [2025-02-07 22:45:50,197 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 185 transitions. Word has length 42 [2025-02-07 22:45:50,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:45:50,197 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 185 transitions. [2025-02-07 22:45:50,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:45:50,197 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 185 transitions. [2025-02-07 22:45:50,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-07 22:45:50,197 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:45:50,197 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-02-07 22:45:50,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 22:45:50,198 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:45:50,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:45:50,198 INFO L85 PathProgramCache]: Analyzing trace with hash -707856415, now seen corresponding path program 1 times [2025-02-07 22:45:50,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:45:50,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938465047] [2025-02-07 22:45:50,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:45:50,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:45:50,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-07 22:45:50,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-07 22:45:50,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:45:50,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:45:50,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:45:50,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:45:50,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938465047] [2025-02-07 22:45:50,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938465047] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:45:50,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:45:50,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 22:45:50,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029161198] [2025-02-07 22:45:50,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:45:50,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 22:45:50,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:45:50,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 22:45:50,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:45:50,385 INFO L87 Difference]: Start difference. First operand 135 states and 185 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 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-02-07 22:45:50,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:45:50,489 INFO L93 Difference]: Finished difference Result 239 states and 327 transitions. [2025-02-07 22:45:50,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 22:45:50,490 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 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-02-07 22:45:50,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:45:50,490 INFO L225 Difference]: With dead ends: 239 [2025-02-07 22:45:50,490 INFO L226 Difference]: Without dead ends: 159 [2025-02-07 22:45:50,491 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-02-07 22:45:50,491 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 22 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:45:50,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 398 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:45:50,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-02-07 22:45:50,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 153. [2025-02-07 22:45:50,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 1.375) internal successors, (209), 152 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:45:50,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 209 transitions. [2025-02-07 22:45:50,499 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 209 transitions. Word has length 43 [2025-02-07 22:45:50,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:45:50,499 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 209 transitions. [2025-02-07 22:45:50,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 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-02-07 22:45:50,499 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 209 transitions. [2025-02-07 22:45:50,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-07 22:45:50,500 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:45:50,500 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-02-07 22:45:50,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 22:45:50,500 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:45:50,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:45:50,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1235166449, now seen corresponding path program 1 times [2025-02-07 22:45:50,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:45:50,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353451398] [2025-02-07 22:45:50,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:45:50,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:45:50,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-07 22:45:50,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-07 22:45:50,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:45:50,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:45:50,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:45:50,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:45:50,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353451398] [2025-02-07 22:45:50,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353451398] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:45:50,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:45:50,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:45:50,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854686266] [2025-02-07 22:45:50,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:45:50,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:45:50,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:45:50,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:45:50,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:45:50,690 INFO L87 Difference]: Start difference. First operand 153 states and 209 transitions. Second operand has 5 states, 5 states have (on average 8.6) 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-02-07 22:45:50,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:45:50,786 INFO L93 Difference]: Finished difference Result 274 states and 373 transitions. [2025-02-07 22:45:50,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:45:50,787 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) 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-02-07 22:45:50,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:45:50,788 INFO L225 Difference]: With dead ends: 274 [2025-02-07 22:45:50,788 INFO L226 Difference]: Without dead ends: 159 [2025-02-07 22:45:50,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:45:50,790 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 97 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:45:50,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 222 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:45:50,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-02-07 22:45:50,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 153. [2025-02-07 22:45:50,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 1.375) internal successors, (209), 152 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:45:50,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 209 transitions. [2025-02-07 22:45:50,797 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 209 transitions. Word has length 43 [2025-02-07 22:45:50,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:45:50,797 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 209 transitions. [2025-02-07 22:45:50,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) 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-02-07 22:45:50,797 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 209 transitions. [2025-02-07 22:45:50,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-07 22:45:50,798 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:45:50,798 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-02-07 22:45:50,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-07 22:45:50,798 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:45:50,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:45:50,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1744382116, now seen corresponding path program 1 times [2025-02-07 22:45:50,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:45:50,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636020899] [2025-02-07 22:45:50,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:45:50,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:45:50,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-07 22:45:50,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-07 22:45:50,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:45:50,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:45:50,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:45:50,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:45:50,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636020899] [2025-02-07 22:45:50,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636020899] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:45:50,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:45:50,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:45:50,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355780018] [2025-02-07 22:45:50,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:45:50,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:45:50,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:45:50,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:45:50,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:45:50,920 INFO L87 Difference]: Start difference. First operand 153 states and 209 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:45:50,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:45:50,996 INFO L93 Difference]: Finished difference Result 248 states and 339 transitions. [2025-02-07 22:45:50,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:45:50,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-02-07 22:45:50,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:45:50,997 INFO L225 Difference]: With dead ends: 248 [2025-02-07 22:45:50,997 INFO L226 Difference]: Without dead ends: 159 [2025-02-07 22:45:50,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:45:50,997 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 90 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:45:50,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 245 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:45:50,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-02-07 22:45:51,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2025-02-07 22:45:51,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 1.3734177215189873) internal successors, (217), 158 states have internal predecessors, (217), 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-02-07 22:45:51,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 217 transitions. [2025-02-07 22:45:51,003 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 217 transitions. Word has length 44 [2025-02-07 22:45:51,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:45:51,003 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 217 transitions. [2025-02-07 22:45:51,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:45:51,003 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 217 transitions. [2025-02-07 22:45:51,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-07 22:45:51,003 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:45:51,004 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-02-07 22:45:51,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-07 22:45:51,004 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:45:51,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:45:51,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1786689971, now seen corresponding path program 1 times [2025-02-07 22:45:51,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:45:51,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949506980] [2025-02-07 22:45:51,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:45:51,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:45:51,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-07 22:45:51,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-07 22:45:51,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:45:51,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:45:51,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:45:51,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:45:51,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949506980] [2025-02-07 22:45:51,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949506980] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:45:51,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:45:51,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:45:51,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377880307] [2025-02-07 22:45:51,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:45:51,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:45:51,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:45:51,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:45:51,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:45:51,157 INFO L87 Difference]: Start difference. First operand 159 states and 217 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:45:51,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:45:51,210 INFO L93 Difference]: Finished difference Result 268 states and 364 transitions. [2025-02-07 22:45:51,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:45:51,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-02-07 22:45:51,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:45:51,211 INFO L225 Difference]: With dead ends: 268 [2025-02-07 22:45:51,212 INFO L226 Difference]: Without dead ends: 171 [2025-02-07 22:45:51,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-02-07 22:45:51,212 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 91 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 22:45:51,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 264 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 22:45:51,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-02-07 22:45:51,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2025-02-07 22:45:51,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.3470588235294119) internal successors, (229), 170 states have internal predecessors, (229), 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-02-07 22:45:51,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 229 transitions. [2025-02-07 22:45:51,219 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 229 transitions. Word has length 44 [2025-02-07 22:45:51,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:45:51,219 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 229 transitions. [2025-02-07 22:45:51,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:45:51,220 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 229 transitions. [2025-02-07 22:45:51,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-07 22:45:51,220 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:45:51,220 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-02-07 22:45:51,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-07 22:45:51,220 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:45:51,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:45:51,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1964796581, now seen corresponding path program 1 times [2025-02-07 22:45:51,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:45:51,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208709158] [2025-02-07 22:45:51,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:45:51,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:45:51,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-07 22:45:51,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-07 22:45:51,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:45:51,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:45:51,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:45:51,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:45:51,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208709158] [2025-02-07 22:45:51,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208709158] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:45:51,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:45:51,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:45:51,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242032152] [2025-02-07 22:45:51,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:45:51,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:45:51,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:45:51,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:45:51,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:45:51,480 INFO L87 Difference]: Start difference. First operand 171 states and 229 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 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-02-07 22:45:51,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:45:51,575 INFO L93 Difference]: Finished difference Result 263 states and 351 transitions. [2025-02-07 22:45:51,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:45:51,575 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 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-02-07 22:45:51,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:45:51,576 INFO L225 Difference]: With dead ends: 263 [2025-02-07 22:45:51,576 INFO L226 Difference]: Without dead ends: 147 [2025-02-07 22:45:51,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:45:51,577 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 91 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:45:51,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 314 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:45:51,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-02-07 22:45:51,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-02-07 22:45:51,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 1.3356164383561644) internal successors, (195), 146 states have internal predecessors, (195), 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-02-07 22:45:51,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 195 transitions. [2025-02-07 22:45:51,584 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 195 transitions. Word has length 44 [2025-02-07 22:45:51,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:45:51,584 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 195 transitions. [2025-02-07 22:45:51,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 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-02-07 22:45:51,585 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 195 transitions. [2025-02-07 22:45:51,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-07 22:45:51,585 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:45:51,585 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-02-07 22:45:51,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-07 22:45:51,586 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:45:51,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:45:51,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1080525960, now seen corresponding path program 1 times [2025-02-07 22:45:51,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:45:51,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498359722] [2025-02-07 22:45:51,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:45:51,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:45:51,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-07 22:45:51,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-07 22:45:51,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:45:51,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:45:51,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:45:51,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:45:51,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498359722] [2025-02-07 22:45:51,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498359722] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:45:51,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:45:51,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:45:51,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060652673] [2025-02-07 22:45:51,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:45:51,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:45:51,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:45:51,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:45:51,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:45:51,738 INFO L87 Difference]: Start difference. First operand 147 states and 195 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 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-02-07 22:45:51,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:45:51,825 INFO L93 Difference]: Finished difference Result 244 states and 323 transitions. [2025-02-07 22:45:51,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:45:51,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 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-02-07 22:45:51,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:45:51,826 INFO L225 Difference]: With dead ends: 244 [2025-02-07 22:45:51,826 INFO L226 Difference]: Without dead ends: 153 [2025-02-07 22:45:51,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:45:51,827 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 87 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:45:51,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 219 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:45:51,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-02-07 22:45:51,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 147. [2025-02-07 22:45:51,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 1.3356164383561644) internal successors, (195), 146 states have internal predecessors, (195), 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-02-07 22:45:51,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 195 transitions. [2025-02-07 22:45:51,831 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 195 transitions. Word has length 45 [2025-02-07 22:45:51,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:45:51,831 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 195 transitions. [2025-02-07 22:45:51,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 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-02-07 22:45:51,831 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 195 transitions. [2025-02-07 22:45:51,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-07 22:45:51,831 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:45:51,831 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-02-07 22:45:51,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-07 22:45:51,831 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:45:51,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:45:51,832 INFO L85 PathProgramCache]: Analyzing trace with hash -851962072, now seen corresponding path program 1 times [2025-02-07 22:45:51,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:45:51,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163995260] [2025-02-07 22:45:51,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:45:51,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:45:51,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-07 22:45:51,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-07 22:45:51,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:45:51,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 22:45:51,857 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 22:45:51,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-07 22:45:51,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-07 22:45:51,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:45:51,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 22:45:51,899 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 22:45:51,899 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 22:45:51,900 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 22:45:51,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-07 22:45:51,904 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:45:51,929 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:45:51,936 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 22:45:51,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 10:45:51 BoogieIcfgContainer [2025-02-07 22:45:51,938 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 22:45:51,939 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 22:45:51,939 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 22:45:51,939 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 22:45:51,940 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:45:46" (3/4) ... [2025-02-07 22:45:51,941 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-07 22:45:51,942 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 22:45:51,942 INFO L158 Benchmark]: Toolchain (without parser) took 6518.41ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 123.1MB in the beginning and 188.2MB in the end (delta: -65.1MB). Peak memory consumption was 131.5MB. Max. memory is 16.1GB. [2025-02-07 22:45:51,943 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 22:45:51,943 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.06ms. Allocated memory is still 167.8MB. Free memory was 123.1MB in the beginning and 107.1MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 22:45:51,944 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.95ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 99.6MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 22:45:51,944 INFO L158 Benchmark]: Boogie Preprocessor took 55.19ms. Allocated memory is still 167.8MB. Free memory was 99.6MB in the beginning and 95.0MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 22:45:51,944 INFO L158 Benchmark]: IcfgBuilder took 554.22ms. Allocated memory is still 167.8MB. Free memory was 95.0MB in the beginning and 48.4MB in the end (delta: 46.6MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-02-07 22:45:51,944 INFO L158 Benchmark]: TraceAbstraction took 5615.86ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 47.5MB in the beginning and 188.3MB in the end (delta: -140.8MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. [2025-02-07 22:45:51,945 INFO L158 Benchmark]: Witness Printer took 3.01ms. Allocated memory is still 369.1MB. Free memory was 188.3MB in the beginning and 188.2MB in the end (delta: 75.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 22:45:51,946 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.12ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 241.06ms. Allocated memory is still 167.8MB. Free memory was 123.1MB in the beginning and 107.1MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.95ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 99.6MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.19ms. Allocated memory is still 167.8MB. Free memory was 99.6MB in the beginning and 95.0MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 554.22ms. Allocated memory is still 167.8MB. Free memory was 95.0MB in the beginning and 48.4MB in the end (delta: 46.6MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 5615.86ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 47.5MB in the beginning and 188.3MB in the end (delta: -140.8MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. * Witness Printer took 3.01ms. Allocated memory is still 369.1MB. Free memory was 188.3MB in the beginning and 188.2MB in the end (delta: 75.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 117, overapproximation of bitwiseAnd at line 109, overapproximation of bitwiseAnd at line 122, overapproximation of bitwiseAnd at line 95. 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_26 mask_SORT_26 = (SORT_26)-1 >> (sizeof(SORT_26) * 8 - 2); [L33] const SORT_26 msb_SORT_26 = (SORT_26)1 << (2 - 1); [L35] const SORT_1 var_11 = 0; [L36] const SORT_5 var_15 = 0; [L37] const SORT_5 var_21 = 5; [L38] const SORT_5 var_23 = 4; [L39] const SORT_1 var_39 = 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_26=3, mask_SORT_5=7, var_11=0, var_15=0, var_21=5, var_23=4, var_39=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_26=3, mask_SORT_5=7, var_11=0, var_15=0, var_21=5, var_23=4, var_39=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_26=3, mask_SORT_5=7, var_11=0, var_15=0, var_21=5, var_23=4, var_39=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_26=3, mask_SORT_5=7, var_11=0, var_15=0, var_21=5, var_23=4, var_39=1] [L53] SORT_5 state_29 = __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_30_arg_1 = var_15; [L62] state_29 = init_30_arg_1 VAL [mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, state_12=0, state_16=0, state_18=0, state_29=0, var_11=0, var_15=0, var_21=5, var_23=4, var_39=1] [L65] input_2 = __VERIFIER_nondet_uchar() [L66] EXPR input_2 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, state_12=0, state_16=0, state_18=0, state_29=0, var_11=0, var_15=0, var_21=5, var_23=4, var_39=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_26=3, mask_SORT_5=7, state_12=0, state_16=0, state_18=0, state_29=0, var_11=0, var_15=0, var_21=5, var_23=4, var_39=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_26=3, mask_SORT_5=7, state_12=0, state_18=0, state_29=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=5, var_23=4, var_39=1] [L83] EXPR var_20 & mask_SORT_5 VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, state_12=0, state_18=0, state_29=0, var_11=0, var_14=-1, var_15=0, var_21=5, var_23=4, var_39=1] [L83] var_20 = var_20 & mask_SORT_5 [L84] SORT_5 var_24_arg_0 = var_20; [L85] SORT_5 var_24_arg_1 = var_23; [L86] SORT_1 var_24 = var_24_arg_0 == var_24_arg_1; [L87] SORT_1 var_25_arg_0 = var_24; [L88] SORT_1 var_25 = ~var_25_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_27_arg_0 = var_25; [L93] SORT_1 var_27_arg_1 = var_22; VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, state_12=0, state_18=0, state_29=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=5, var_23=4, var_25=-1, var_27_arg_0=-1, var_27_arg_1=0, var_39=1] [L94] EXPR ((SORT_26)var_27_arg_0 << 1) | var_27_arg_1 VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, state_12=0, state_18=0, state_29=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=5, var_23=4, var_25=-1, var_39=1] [L94] SORT_26 var_27 = ((SORT_26)var_27_arg_0 << 1) | var_27_arg_1; [L95] EXPR var_27 & mask_SORT_26 VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, state_12=0, state_18=0, state_29=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=5, var_23=4, var_25=-1, var_39=1] [L95] var_27 = var_27 & mask_SORT_26 [L96] SORT_26 var_28_arg_0 = var_27; [L97] SORT_1 var_28 = var_28_arg_0 == mask_SORT_26; [L98] SORT_1 var_31_arg_0 = state_18; [L99] SORT_5 var_31_arg_1 = state_29; [L100] SORT_5 var_31_arg_2 = input_7; [L101] SORT_5 var_31 = var_31_arg_0 ? var_31_arg_1 : var_31_arg_2; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=5, var_23=4, var_25=-1, var_28=0, var_31=0, var_39=1] [L102] EXPR var_31 & mask_SORT_5 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=5, var_23=4, var_25=-1, var_28=0, var_39=1] [L102] var_31 = var_31 & mask_SORT_5 [L103] SORT_5 var_32_arg_0 = var_31; [L104] SORT_5 var_32_arg_1 = var_21; [L105] SORT_1 var_32 = var_32_arg_0 == var_32_arg_1; [L106] SORT_1 var_33_arg_0 = var_25; [L107] SORT_1 var_33_arg_1 = var_32; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=5, var_23=4, var_28=0, var_31=0, var_33_arg_0=-1, var_33_arg_1=0, var_39=1] [L108] EXPR ((SORT_26)var_33_arg_0 << 1) | var_33_arg_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=5, var_23=4, var_28=0, var_31=0, var_39=1] [L108] SORT_26 var_33 = ((SORT_26)var_33_arg_0 << 1) | var_33_arg_1; [L109] EXPR var_33 & mask_SORT_26 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=5, var_23=4, var_28=0, var_31=0, var_39=1] [L109] var_33 = var_33 & mask_SORT_26 [L110] SORT_26 var_34_arg_0 = var_33; [L111] SORT_1 var_34 = var_34_arg_0 == mask_SORT_26; [L112] SORT_1 var_35_arg_0 = var_28; [L113] SORT_1 var_35_arg_1 = var_34; [L114] SORT_1 var_35 = var_35_arg_0 == var_35_arg_1; [L115] SORT_1 var_36_arg_0 = var_14; [L116] SORT_1 var_36_arg_1 = var_35; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=5, var_23=4, var_31=0, var_36_arg_0=-1, var_36_arg_1=1, var_39=1] [L117] EXPR var_36_arg_0 | var_36_arg_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=5, var_23=4, var_31=0, var_39=1] [L117] SORT_1 var_36 = var_36_arg_0 | var_36_arg_1; [L118] SORT_1 var_40_arg_0 = var_36; [L119] SORT_1 var_40 = ~var_40_arg_0; [L120] SORT_1 var_41_arg_0 = var_39; [L121] SORT_1 var_41_arg_1 = var_40; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=5, var_23=4, var_31=0, var_39=1, var_41_arg_0=1, var_41_arg_1=-1] [L122] EXPR var_41_arg_0 & var_41_arg_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=5, var_23=4, var_31=0, var_39=1] [L122] SORT_1 var_41 = var_41_arg_0 & var_41_arg_1; [L123] EXPR var_41 & mask_SORT_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=5, var_23=4, var_31=0, var_39=1] [L123] var_41 = var_41 & mask_SORT_1 [L124] SORT_1 bad_42_arg_0 = var_41; [L125] CALL __VERIFIER_assert(!(bad_42_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 80 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1569 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1569 mSDsluCounter, 4887 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3523 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1698 IncrementalHoareTripleChecker+Invalid, 1703 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 1364 mSDtfsCounter, 1698 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171occurred in iteration=14, InterpolantAutomatonStates: 87, 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, 16 MinimizatonAttempts, 73 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 690 NumberOfCodeBlocks, 690 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 629 ConstructedInterpolants, 0 QuantifiedInterpolants, 2334 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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-02-07 22:45:51,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal55.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 bee37cc3aa930a1b9dc8d03049770a16229b9136afc75c48614cf8a9ab0bb811 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 22:45:53,897 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 22:45:53,980 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-07 22:45:53,986 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 22:45:53,986 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 22:45:54,008 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 22:45:54,009 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 22:45:54,009 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 22:45:54,009 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 22:45:54,009 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 22:45:54,009 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 22:45:54,009 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 22:45:54,009 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 22:45:54,010 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 22:45:54,010 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 22:45:54,010 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 22:45:54,010 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 22:45:54,010 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 22:45:54,010 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 22:45:54,010 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 22:45:54,010 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 22:45:54,010 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-07 22:45:54,010 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-07 22:45:54,010 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-07 22:45:54,011 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 22:45:54,011 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 22:45:54,011 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 22:45:54,011 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 22:45:54,011 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 22:45:54,011 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 22:45:54,011 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 22:45:54,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:45:54,011 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 22:45:54,011 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 22:45:54,011 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 22:45:54,012 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 22:45:54,012 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-07 22:45:54,012 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-07 22:45:54,012 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 22:45:54,012 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 22:45:54,012 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 22:45:54,012 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 22:45:54,012 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-jdk21/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 -> bee37cc3aa930a1b9dc8d03049770a16229b9136afc75c48614cf8a9ab0bb811 [2025-02-07 22:45:54,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 22:45:54,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 22:45:54,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 22:45:54,232 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 22:45:54,232 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 22:45:54,234 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal55.c [2025-02-07 22:45:55,432 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cf037dcc3/c29a7b0d1b08414a97b58271d61222fc/FLAG4f263fe3d [2025-02-07 22:45:55,633 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 22:45:55,635 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal55.c [2025-02-07 22:45:55,643 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cf037dcc3/c29a7b0d1b08414a97b58271d61222fc/FLAG4f263fe3d [2025-02-07 22:45:55,987 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cf037dcc3/c29a7b0d1b08414a97b58271d61222fc [2025-02-07 22:45:55,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 22:45:55,991 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 22:45:55,992 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 22:45:55,992 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 22:45:55,998 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 22:45:55,999 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:45:55" (1/1) ... [2025-02-07 22:45:56,000 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@345d0632 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:55, skipping insertion in model container [2025-02-07 22:45:56,000 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:45:55" (1/1) ... [2025-02-07 22:45:56,017 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 22:45:56,123 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal55.c[1245,1258] [2025-02-07 22:45:56,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:45:56,191 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 22:45:56,200 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal55.c[1245,1258] [2025-02-07 22:45:56,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:45:56,243 INFO L204 MainTranslator]: Completed translation [2025-02-07 22:45:56,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:56 WrapperNode [2025-02-07 22:45:56,244 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 22:45:56,244 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 22:45:56,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 22:45:56,244 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 22:45:56,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:56" (1/1) ... [2025-02-07 22:45:56,254 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:56" (1/1) ... [2025-02-07 22:45:56,268 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 203 [2025-02-07 22:45:56,268 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 22:45:56,268 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 22:45:56,268 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 22:45:56,268 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 22:45:56,278 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:56" (1/1) ... [2025-02-07 22:45:56,278 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:56" (1/1) ... [2025-02-07 22:45:56,283 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:56" (1/1) ... [2025-02-07 22:45:56,290 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-02-07 22:45:56,290 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:56" (1/1) ... [2025-02-07 22:45:56,290 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:56" (1/1) ... [2025-02-07 22:45:56,296 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:56" (1/1) ... [2025-02-07 22:45:56,296 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:56" (1/1) ... [2025-02-07 22:45:56,301 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:56" (1/1) ... [2025-02-07 22:45:56,301 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:56" (1/1) ... [2025-02-07 22:45:56,303 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 22:45:56,303 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 22:45:56,303 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 22:45:56,306 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 22:45:56,307 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:56" (1/1) ... [2025-02-07 22:45:56,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:45:56,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:45:56,335 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 22:45:56,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 22:45:56,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 22:45:56,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-07 22:45:56,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-07 22:45:56,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 22:45:56,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 22:45:56,433 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 22:45:56,435 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 22:45:56,686 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2025-02-07 22:45:56,686 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 22:45:56,691 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 22:45:56,691 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 22:45:56,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:45:56 BoogieIcfgContainer [2025-02-07 22:45:56,692 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 22:45:56,693 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 22:45:56,693 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 22:45:56,696 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 22:45:56,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 10:45:55" (1/3) ... [2025-02-07 22:45:56,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55a20300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:45:56, skipping insertion in model container [2025-02-07 22:45:56,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:56" (2/3) ... [2025-02-07 22:45:56,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55a20300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:45:56, skipping insertion in model container [2025-02-07 22:45:56,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:45:56" (3/3) ... [2025-02-07 22:45:56,697 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal55.c [2025-02-07 22:45:56,706 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 22:45:56,707 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal55.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 22:45:56,735 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 22:45:56,753 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;@67206f64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 22:45:56,757 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 22:45:56,760 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:45:56,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-07 22:45:56,772 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:45:56,773 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-07 22:45:56,773 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:45:56,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:45:56,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-02-07 22:45:56,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 22:45:56,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [992198547] [2025-02-07 22:45:56,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:45:56,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:45:56,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:45:56,793 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 22:45:56,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 22:45:56,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-07 22:45:56,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-07 22:45:56,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:45:56,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:45:56,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-07 22:45:56,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:45:57,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:45:57,059 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 22:45:57,060 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 22:45:57,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992198547] [2025-02-07 22:45:57,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992198547] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:45:57,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:45:57,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 22:45:57,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353989898] [2025-02-07 22:45:57,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:45:57,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:45:57,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 22:45:57,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:45:57,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:45:57,077 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:45:57,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:45:57,108 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-02-07 22:45:57,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:45:57,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-07 22:45:57,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:45:57,115 INFO L225 Difference]: With dead ends: 16 [2025-02-07 22:45:57,115 INFO L226 Difference]: Without dead ends: 9 [2025-02-07 22:45:57,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:45:57,118 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 22:45:57,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 22:45:57,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-02-07 22:45:57,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-02-07 22:45:57,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:45:57,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-02-07 22:45:57,138 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-02-07 22:45:57,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:45:57,138 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-02-07 22:45:57,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:45:57,138 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-02-07 22:45:57,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 22:45:57,139 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:45:57,139 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-07 22:45:57,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-07 22:45:57,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:45:57,343 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:45:57,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:45:57,344 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-02-07 22:45:57,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 22:45:57,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [989783790] [2025-02-07 22:45:57,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:45:57,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:45:57,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:45:57,347 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 22:45:57,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 22:45:57,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 22:45:57,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 22:45:57,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:45:57,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:45:57,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-02-07 22:45:57,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:45:58,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:45:58,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 22:46:04,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:46:04,217 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 22:46:04,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989783790] [2025-02-07 22:46:04,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989783790] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 22:46:04,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 22:46:04,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-02-07 22:46:04,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062384399] [2025-02-07 22:46:04,218 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 22:46:04,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 22:46:04,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 22:46:04,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 22:46:04,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-07 22:46:04,219 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:46:04,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:46:04,301 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2025-02-07 22:46:04,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 22:46:04,302 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-07 22:46:04,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:46:04,302 INFO L225 Difference]: With dead ends: 13 [2025-02-07 22:46:04,302 INFO L226 Difference]: Without dead ends: 11 [2025-02-07 22:46:04,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-02-07 22:46:04,303 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 22:46:04,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 22:46:04,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-02-07 22:46:04,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-02-07 22:46:04,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:46:04,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2025-02-07 22:46:04,305 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2025-02-07 22:46:04,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:46:04,305 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2025-02-07 22:46:04,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:46:04,305 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2025-02-07 22:46:04,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-07 22:46:04,305 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:46:04,305 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2025-02-07 22:46:04,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 22:46:04,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:46:04,506 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:46:04,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:46:04,506 INFO L85 PathProgramCache]: Analyzing trace with hash 55678175, now seen corresponding path program 2 times [2025-02-07 22:46:04,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 22:46:04,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1854762046] [2025-02-07 22:46:04,507 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 22:46:04,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:46:04,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:46:04,510 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 22:46:04,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-07 22:46:04,581 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-07 22:46:04,605 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-07 22:46:04,605 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 22:46:04,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:46:04,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-02-07 22:46:04,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:46:05,286 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:46:05,287 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 22:47:05,223 WARN L286 SmtUtils]: Spent 8.79s on a formula simplification. DAG size of input: 460 DAG size of output: 451 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-02-07 22:47:13,729 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:47:13,729 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 22:47:13,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854762046] [2025-02-07 22:47:13,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854762046] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 22:47:13,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 22:47:13,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-02-07 22:47:13,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143499538] [2025-02-07 22:47:13,730 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 22:47:13,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 22:47:13,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 22:47:13,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 22:47:13,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-02-07 22:47:13,730 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:47:13,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:47:13,936 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2025-02-07 22:47:13,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 22:47:13,936 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-07 22:47:13,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:47:13,937 INFO L225 Difference]: With dead ends: 16 [2025-02-07 22:47:13,937 INFO L226 Difference]: Without dead ends: 14 [2025-02-07 22:47:13,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-02-07 22:47:13,937 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:47:13,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:47:13,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-02-07 22:47:13,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-02-07 22:47:13,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:47:13,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2025-02-07 22:47:13,945 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2025-02-07 22:47:13,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:47:13,945 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2025-02-07 22:47:13,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 22:47:13,946 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2025-02-07 22:47:13,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-07 22:47:13,946 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:47:13,946 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2025-02-07 22:47:13,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-07 22:47:14,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:47:14,146 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:47:14,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:47:14,149 INFO L85 PathProgramCache]: Analyzing trace with hash 852005001, now seen corresponding path program 3 times [2025-02-07 22:47:14,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 22:47:14,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [960683998] [2025-02-07 22:47:14,149 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 22:47:14,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:47:14,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:47:14,151 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 22:47:14,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-07 22:47:14,234 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 4 equivalence classes. [2025-02-07 22:47:14,262 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 10 of 13 statements. [2025-02-07 22:47:14,262 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-07 22:47:14,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:47:14,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 92 conjuncts are in the unsatisfiable core [2025-02-07 22:47:14,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:47:15,732 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-07 22:47:15,733 INFO L312 TraceCheckSpWp]: Computing backward predicates...