./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal77.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.cal77.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 effebb003be4bd8a486f634b48315d6ea88e0de9078b4e02abb5c833e26f0e39 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 22:48:27,720 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 22:48:27,761 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:48:27,764 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 22:48:27,765 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 22:48:27,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 22:48:27,780 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 22:48:27,780 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 22:48:27,780 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 22:48:27,780 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 22:48:27,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 22:48:27,781 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 22:48:27,781 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 22:48:27,782 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 22:48:27,782 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 22:48:27,782 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 22:48:27,782 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 22:48:27,782 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 22:48:27,782 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 22:48:27,782 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 22:48:27,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 22:48:27,782 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 22:48:27,782 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 22:48:27,783 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 22:48:27,783 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 22:48:27,783 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 22:48:27,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 22:48:27,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 22:48:27,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 22:48:27,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:48:27,783 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 22:48:27,784 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 22:48:27,784 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 22:48:27,784 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 22:48:27,784 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 22:48:27,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 22:48:27,784 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 22:48:27,784 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 22:48:27,784 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 22:48:27,784 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 22:48:27,784 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 -> effebb003be4bd8a486f634b48315d6ea88e0de9078b4e02abb5c833e26f0e39 [2025-02-07 22:48:27,965 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 22:48:27,970 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 22:48:27,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 22:48:27,972 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 22:48:27,973 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 22:48:27,973 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.cal77.c [2025-02-07 22:48:29,034 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/645391d25/309c4f911de044eea07afa86b0983ffc/FLAG8cb552a71 [2025-02-07 22:48:29,454 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 22:48:29,454 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal77.c [2025-02-07 22:48:29,487 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/645391d25/309c4f911de044eea07afa86b0983ffc/FLAG8cb552a71 [2025-02-07 22:48:29,514 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/645391d25/309c4f911de044eea07afa86b0983ffc [2025-02-07 22:48:29,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 22:48:29,520 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 22:48:29,521 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 22:48:29,522 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 22:48:29,525 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 22:48:29,526 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:48:29" (1/1) ... [2025-02-07 22:48:29,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4717e1ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:48:29, skipping insertion in model container [2025-02-07 22:48:29,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:48:29" (1/1) ... [2025-02-07 22:48:29,616 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 22:48:29,853 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.cal77.c[1245,1258] [2025-02-07 22:48:30,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:48:30,758 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 22:48:30,765 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.cal77.c[1245,1258] [2025-02-07 22:48:31,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:48:31,398 INFO L204 MainTranslator]: Completed translation [2025-02-07 22:48:31,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:48:31 WrapperNode [2025-02-07 22:48:31,400 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 22:48:31,400 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 22:48:31,401 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 22:48:31,401 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 22:48:31,407 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:48:31" (1/1) ... [2025-02-07 22:48:31,523 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:48:31" (1/1) ... [2025-02-07 22:48:34,197 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 35941 [2025-02-07 22:48:34,198 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 22:48:34,201 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 22:48:34,201 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 22:48:34,201 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 22:48:34,207 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:48:31" (1/1) ... [2025-02-07 22:48:34,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:48:31" (1/1) ... [2025-02-07 22:48:34,861 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:48:31" (1/1) ... [2025-02-07 22:48:35,412 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:48:35,413 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:48:31" (1/1) ... [2025-02-07 22:48:35,413 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:48:31" (1/1) ... [2025-02-07 22:48:36,330 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:48:31" (1/1) ... [2025-02-07 22:48:36,409 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:48:31" (1/1) ... [2025-02-07 22:48:36,513 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:48:31" (1/1) ... [2025-02-07 22:48:36,593 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:48:31" (1/1) ... [2025-02-07 22:48:36,963 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 22:48:36,964 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 22:48:36,964 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 22:48:36,964 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 22:48:36,965 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:48:31" (1/1) ... [2025-02-07 22:48:36,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:48:36,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:48:36,992 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:48:37,000 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:48:37,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 22:48:37,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 22:48:37,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 22:48:37,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 22:48:37,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 22:48:38,202 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 22:48:38,203 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 22:49:38,481 INFO L? ?]: Removed 19827 outVars from TransFormulas that were not future-live. [2025-02-07 22:49:38,481 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 22:49:39,039 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 22:49:39,039 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 22:49:39,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:49:39 BoogieIcfgContainer [2025-02-07 22:49:39,040 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 22:49:39,041 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 22:49:39,041 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 22:49:39,044 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 22:49:39,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 10:48:29" (1/3) ... [2025-02-07 22:49:39,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@796ef197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:49:39, skipping insertion in model container [2025-02-07 22:49:39,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:48:31" (2/3) ... [2025-02-07 22:49:39,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@796ef197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:49:39, skipping insertion in model container [2025-02-07 22:49:39,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:49:39" (3/3) ... [2025-02-07 22:49:39,046 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal77.c [2025-02-07 22:49:39,057 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 22:49:39,058 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal77.c that has 1 procedures, 12344 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 22:49:39,221 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 22:49:39,230 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;@52cb2b1c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 22:49:39,231 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 22:49:39,256 INFO L276 IsEmpty]: Start isEmpty. Operand has 12344 states, 12342 states have (on average 1.5004861448711717) internal successors, (18519), 12343 states have internal predecessors, (18519), 0 states have call successors, (0), 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:49:39,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-07 22:49:39,265 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:49:39,265 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:39,266 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:49:39,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:49:39,270 INFO L85 PathProgramCache]: Analyzing trace with hash -857019528, now seen corresponding path program 1 times [2025-02-07 22:49:39,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:49:39,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350002300] [2025-02-07 22:49:39,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:49:39,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:49:39,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-07 22:49:39,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-07 22:49:39,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:49:39,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:49:40,192 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:49:40,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:49:40,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350002300] [2025-02-07 22:49:40,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350002300] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:49:40,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:49:40,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:49:40,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186281511] [2025-02-07 22:49:40,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:49:40,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:49:40,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:49:40,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:49:40,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:49:40,240 INFO L87 Difference]: Start difference. First operand has 12344 states, 12342 states have (on average 1.5004861448711717) internal successors, (18519), 12343 states have internal predecessors, (18519), 0 states have call successors, (0), 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 29.0) internal successors, (116), 4 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:49:44,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:49:44,821 INFO L93 Difference]: Finished difference Result 24547 states and 36829 transitions. [2025-02-07 22:49:44,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:49:44,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 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) Word has length 116 [2025-02-07 22:49:44,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:49:44,863 INFO L225 Difference]: With dead ends: 24547 [2025-02-07 22:49:44,864 INFO L226 Difference]: Without dead ends: 12344 [2025-02-07 22:49:44,880 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:49:44,882 INFO L435 NwaCegarLoop]: 15433 mSDtfsCounter, 0 mSDsluCounter, 30861 mSDsCounter, 0 mSdLazyCounter, 9253 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46294 SdHoareTripleChecker+Invalid, 9253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:49:44,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46294 Invalid, 9253 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 9253 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-02-07 22:49:44,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12344 states. [2025-02-07 22:49:45,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12344 to 12344. [2025-02-07 22:49:45,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12344 states, 12343 states have (on average 1.5002835615328527) internal successors, (18518), 12343 states have internal predecessors, (18518), 0 states have call successors, (0), 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:49:45,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12344 states to 12344 states and 18518 transitions. [2025-02-07 22:49:45,129 INFO L78 Accepts]: Start accepts. Automaton has 12344 states and 18518 transitions. Word has length 116 [2025-02-07 22:49:45,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:49:45,131 INFO L471 AbstractCegarLoop]: Abstraction has 12344 states and 18518 transitions. [2025-02-07 22:49:45,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 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:49:45,131 INFO L276 IsEmpty]: Start isEmpty. Operand 12344 states and 18518 transitions. [2025-02-07 22:49:45,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-07 22:49:45,133 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:49:45,133 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:45,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 22:49:45,134 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:49:45,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:49:45,134 INFO L85 PathProgramCache]: Analyzing trace with hash -793101250, now seen corresponding path program 1 times [2025-02-07 22:49:45,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:49:45,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264320085] [2025-02-07 22:49:45,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:49:45,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:49:45,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-07 22:49:45,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-07 22:49:45,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:49:45,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:49:45,487 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:49:45,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:49:45,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264320085] [2025-02-07 22:49:45,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264320085] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:49:45,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:49:45,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:49:45,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109603657] [2025-02-07 22:49:45,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:49:45,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:49:45,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:49:45,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:49:45,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:49:45,490 INFO L87 Difference]: Start difference. First operand 12344 states and 18518 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 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:49:49,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:49:49,849 INFO L93 Difference]: Finished difference Result 24549 states and 36828 transitions. [2025-02-07 22:49:49,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:49:49,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 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) Word has length 117 [2025-02-07 22:49:49,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:49:49,877 INFO L225 Difference]: With dead ends: 24549 [2025-02-07 22:49:49,877 INFO L226 Difference]: Without dead ends: 12346 [2025-02-07 22:49:49,887 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:49:49,888 INFO L435 NwaCegarLoop]: 15433 mSDtfsCounter, 0 mSDsluCounter, 30858 mSDsCounter, 0 mSdLazyCounter, 9256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46291 SdHoareTripleChecker+Invalid, 9256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:49:49,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46291 Invalid, 9256 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 9256 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-02-07 22:49:49,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12346 states. [2025-02-07 22:49:50,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12346 to 12346. [2025-02-07 22:49:50,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12346 states, 12345 states have (on average 1.5002025111381125) internal successors, (18520), 12345 states have internal predecessors, (18520), 0 states have call successors, (0), 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:49:50,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12346 states to 12346 states and 18520 transitions. [2025-02-07 22:49:50,037 INFO L78 Accepts]: Start accepts. Automaton has 12346 states and 18520 transitions. Word has length 117 [2025-02-07 22:49:50,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:49:50,037 INFO L471 AbstractCegarLoop]: Abstraction has 12346 states and 18520 transitions. [2025-02-07 22:49:50,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 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:49:50,037 INFO L276 IsEmpty]: Start isEmpty. Operand 12346 states and 18520 transitions. [2025-02-07 22:49:50,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-07 22:49:50,039 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:49:50,039 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:50,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 22:49:50,039 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:49:50,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:49:50,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1179771853, now seen corresponding path program 1 times [2025-02-07 22:49:50,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:49:50,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499498751] [2025-02-07 22:49:50,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:49:50,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:49:50,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-07 22:49:50,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-07 22:49:50,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:49:50,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:49:50,796 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:49:50,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:49:50,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499498751] [2025-02-07 22:49:50,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499498751] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:49:50,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:49:50,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:49:50,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136210916] [2025-02-07 22:49:50,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:49:50,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:49:50,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:49:50,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:49:50,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:49:50,799 INFO L87 Difference]: Start difference. First operand 12346 states and 18520 transitions. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 5 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:49:56,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:49:56,345 INFO L93 Difference]: Finished difference Result 24644 states and 36964 transitions. [2025-02-07 22:49:56,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:49:56,346 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 5 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) Word has length 118 [2025-02-07 22:49:56,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:49:56,369 INFO L225 Difference]: With dead ends: 24644 [2025-02-07 22:49:56,370 INFO L226 Difference]: Without dead ends: 12439 [2025-02-07 22:49:56,382 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:49:56,383 INFO L435 NwaCegarLoop]: 15370 mSDtfsCounter, 18683 mSDsluCounter, 46110 mSDsCounter, 0 mSdLazyCounter, 12583 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18683 SdHoareTripleChecker+Valid, 61480 SdHoareTripleChecker+Invalid, 12583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:49:56,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18683 Valid, 61480 Invalid, 12583 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 12583 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2025-02-07 22:49:56,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12439 states. [2025-02-07 22:49:56,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12439 to 12420. [2025-02-07 22:49:56,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12420 states, 12419 states have (on average 1.5001207826717127) internal successors, (18630), 12419 states have internal predecessors, (18630), 0 states have call successors, (0), 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:49:56,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12420 states to 12420 states and 18630 transitions. [2025-02-07 22:49:56,537 INFO L78 Accepts]: Start accepts. Automaton has 12420 states and 18630 transitions. Word has length 118 [2025-02-07 22:49:56,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:49:56,538 INFO L471 AbstractCegarLoop]: Abstraction has 12420 states and 18630 transitions. [2025-02-07 22:49:56,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 5 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:49:56,538 INFO L276 IsEmpty]: Start isEmpty. Operand 12420 states and 18630 transitions. [2025-02-07 22:49:56,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-07 22:49:56,541 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:49:56,542 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:56,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 22:49:56,542 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:49:56,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:49:56,543 INFO L85 PathProgramCache]: Analyzing trace with hash -324805373, now seen corresponding path program 1 times [2025-02-07 22:49:56,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:49:56,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028248944] [2025-02-07 22:49:56,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:49:56,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:49:56,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-07 22:49:56,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-07 22:49:56,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:49:56,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:49:57,030 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:49:57,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:49:57,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028248944] [2025-02-07 22:49:57,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028248944] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:49:57,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:49:57,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 22:49:57,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806377157] [2025-02-07 22:49:57,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:49:57,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 22:49:57,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:49:57,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 22:49:57,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-07 22:49:57,033 INFO L87 Difference]: Start difference. First operand 12420 states and 18630 transitions. Second operand has 8 states, 8 states have (on average 14.875) internal successors, (119), 7 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)