./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal79.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal79.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ab7cb07dc4ad6d38eaa2a2ae31de55d905911715153dbe23552e7557ccf72ec8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 21:30:28,075 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 21:30:28,129 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 21:30:28,134 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 21:30:28,137 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 21:30:28,151 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 21:30:28,151 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 21:30:28,152 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 21:30:28,152 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 21:30:28,152 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 21:30:28,152 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 21:30:28,152 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 21:30:28,152 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 21:30:28,152 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 21:30:28,153 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 21:30:28,153 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 21:30:28,153 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 21:30:28,153 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 21:30:28,153 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 21:30:28,153 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 21:30:28,153 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 21:30:28,153 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 21:30:28,153 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 21:30:28,153 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 21:30:28,153 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 21:30:28,154 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 21:30:28,154 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 21:30:28,154 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 21:30:28,154 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 21:30:28,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:30:28,154 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 21:30:28,154 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 21:30:28,154 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 21:30:28,154 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 21:30:28,154 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 21:30:28,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 21:30:28,155 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 21:30:28,155 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 21:30:28,155 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 21:30:28,155 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 21:30:28,155 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ab7cb07dc4ad6d38eaa2a2ae31de55d905911715153dbe23552e7557ccf72ec8 [2025-03-16 21:30:28,369 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 21:30:28,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 21:30:28,378 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 21:30:28,379 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 21:30:28,379 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 21:30:28,380 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal79.c [2025-03-16 21:30:29,511 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37c2e4296/a5a2857501c8495ba3c68f481a88d070/FLAGc60458527 [2025-03-16 21:30:30,049 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 21:30:30,050 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal79.c [2025-03-16 21:30:30,085 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37c2e4296/a5a2857501c8495ba3c68f481a88d070/FLAGc60458527 [2025-03-16 21:30:30,584 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37c2e4296/a5a2857501c8495ba3c68f481a88d070 [2025-03-16 21:30:30,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 21:30:30,588 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 21:30:30,589 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 21:30:30,589 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 21:30:30,592 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 21:30:30,593 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:30:30" (1/1) ... [2025-03-16 21:30:30,595 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f322d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:30:30, skipping insertion in model container [2025-03-16 21:30:30,595 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:30:30" (1/1) ... [2025-03-16 21:30:30,693 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 21:30:30,929 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal79.c[1245,1258] [2025-03-16 21:30:31,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:30:31,805 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 21:30:31,813 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal79.c[1245,1258] [2025-03-16 21:30:32,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:30:32,349 INFO L204 MainTranslator]: Completed translation [2025-03-16 21:30:32,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:30:32 WrapperNode [2025-03-16 21:30:32,350 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 21:30:32,351 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 21:30:32,351 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 21:30:32,351 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 21:30:32,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:30:32" (1/1) ... [2025-03-16 21:30:32,487 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:30:32" (1/1) ... [2025-03-16 21:30:34,869 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 36171 [2025-03-16 21:30:34,870 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 21:30:34,871 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 21:30:34,871 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 21:30:34,871 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 21:30:34,879 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:30:32" (1/1) ... [2025-03-16 21:30:34,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:30:32" (1/1) ... [2025-03-16 21:30:36,063 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:30:32" (1/1) ... [2025-03-16 21:30:36,388 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-03-16 21:30:36,388 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:30:32" (1/1) ... [2025-03-16 21:30:36,388 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:30:32" (1/1) ... [2025-03-16 21:30:37,259 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:30:32" (1/1) ... [2025-03-16 21:30:37,369 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:30:32" (1/1) ... [2025-03-16 21:30:37,478 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:30:32" (1/1) ... [2025-03-16 21:30:37,569 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:30:32" (1/1) ... [2025-03-16 21:30:37,969 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 21:30:37,970 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 21:30:37,970 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 21:30:37,970 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 21:30:37,971 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:30:32" (1/1) ... [2025-03-16 21:30:37,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:30:37,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:30:37,996 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 21:30:37,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 21:30:38,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 21:30:38,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 21:30:38,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 21:30:38,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 21:30:38,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 21:30:39,306 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 21:30:39,307 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 21:31:37,875 INFO L? ?]: Removed 19980 outVars from TransFormulas that were not future-live. [2025-03-16 21:31:37,876 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 21:31:38,593 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 21:31:38,594 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 21:31:38,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:31:38 BoogieIcfgContainer [2025-03-16 21:31:38,594 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 21:31:38,596 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 21:31:38,596 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 21:31:38,599 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 21:31:38,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 09:30:30" (1/3) ... [2025-03-16 21:31:38,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d236adf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:31:38, skipping insertion in model container [2025-03-16 21:31:38,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:30:32" (2/3) ... [2025-03-16 21:31:38,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d236adf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:31:38, skipping insertion in model container [2025-03-16 21:31:38,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:31:38" (3/3) ... [2025-03-16 21:31:38,603 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal79.c [2025-03-16 21:31:38,615 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 21:31:38,617 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal79.c that has 1 procedures, 12376 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 21:31:38,812 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 21:31:38,823 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;@20a27da0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 21:31:38,823 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 21:31:38,852 INFO L276 IsEmpty]: Start isEmpty. Operand has 12376 states, 12374 states have (on average 1.5004848876676904) internal successors, (18567), 12375 states have internal predecessors, (18567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:31:38,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 21:31:38,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:31:38,862 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:31:38,863 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:31:38,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:31:38,868 INFO L85 PathProgramCache]: Analyzing trace with hash 499324508, now seen corresponding path program 1 times [2025-03-16 21:31:38,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:31:38,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173837144] [2025-03-16 21:31:38,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:31:38,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:31:39,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 21:31:39,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 21:31:39,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:31:39,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:31:39,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:31:39,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:31:39,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173837144] [2025-03-16 21:31:39,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173837144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:31:39,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:31:39,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:31:39,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039718781] [2025-03-16 21:31:39,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:31:39,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:31:39,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:31:39,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:31:39,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:31:39,906 INFO L87 Difference]: Start difference. First operand has 12376 states, 12374 states have (on average 1.5004848876676904) internal successors, (18567), 12375 states have internal predecessors, (18567), 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 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:31:44,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:31:44,140 INFO L93 Difference]: Finished difference Result 24595 states and 36901 transitions. [2025-03-16 21:31:44,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:31:44,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 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 132 [2025-03-16 21:31:44,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:31:44,191 INFO L225 Difference]: With dead ends: 24595 [2025-03-16 21:31:44,191 INFO L226 Difference]: Without dead ends: 12376 [2025-03-16 21:31:44,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:31:44,213 INFO L435 NwaCegarLoop]: 15473 mSDtfsCounter, 0 mSDsluCounter, 30941 mSDsCounter, 0 mSdLazyCounter, 9277 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46414 SdHoareTripleChecker+Invalid, 9277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-16 21:31:44,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46414 Invalid, 9277 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 9277 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-16 21:31:44,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12376 states. [2025-03-16 21:31:44,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12376 to 12376. [2025-03-16 21:31:44,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12376 states, 12375 states have (on average 1.5002828282828282) internal successors, (18566), 12375 states have internal predecessors, (18566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:31:44,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12376 states to 12376 states and 18566 transitions. [2025-03-16 21:31:44,502 INFO L78 Accepts]: Start accepts. Automaton has 12376 states and 18566 transitions. Word has length 132 [2025-03-16 21:31:44,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:31:44,504 INFO L471 AbstractCegarLoop]: Abstraction has 12376 states and 18566 transitions. [2025-03-16 21:31:44,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:31:44,507 INFO L276 IsEmpty]: Start isEmpty. Operand 12376 states and 18566 transitions. [2025-03-16 21:31:44,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-16 21:31:44,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:31:44,510 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:31:44,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 21:31:44,511 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:31:44,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:31:44,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1696109094, now seen corresponding path program 1 times [2025-03-16 21:31:44,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:31:44,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584969057] [2025-03-16 21:31:44,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:31:44,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:31:44,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-16 21:31:44,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-16 21:31:44,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:31:44,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:31:44,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:31:44,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:31:44,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584969057] [2025-03-16 21:31:44,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584969057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:31:44,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:31:44,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:31:44,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117378048] [2025-03-16 21:31:44,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:31:44,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:31:44,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:31:44,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:31:44,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:31:44,870 INFO L87 Difference]: Start difference. First operand 12376 states and 18566 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:31:48,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:31:48,905 INFO L93 Difference]: Finished difference Result 24597 states and 36900 transitions. [2025-03-16 21:31:48,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:31:48,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2025-03-16 21:31:48,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:31:48,938 INFO L225 Difference]: With dead ends: 24597 [2025-03-16 21:31:48,938 INFO L226 Difference]: Without dead ends: 12378 [2025-03-16 21:31:48,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:31:48,951 INFO L435 NwaCegarLoop]: 15473 mSDtfsCounter, 0 mSDsluCounter, 30938 mSDsCounter, 0 mSdLazyCounter, 9280 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46411 SdHoareTripleChecker+Invalid, 9280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-03-16 21:31:48,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46411 Invalid, 9280 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 9280 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-03-16 21:31:48,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12378 states. [2025-03-16 21:31:49,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12378 to 12378. [2025-03-16 21:31:49,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12378 states, 12377 states have (on average 1.5002019875575665) internal successors, (18568), 12377 states have internal predecessors, (18568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:31:49,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12378 states to 12378 states and 18568 transitions. [2025-03-16 21:31:49,130 INFO L78 Accepts]: Start accepts. Automaton has 12378 states and 18568 transitions. Word has length 133 [2025-03-16 21:31:49,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:31:49,131 INFO L471 AbstractCegarLoop]: Abstraction has 12378 states and 18568 transitions. [2025-03-16 21:31:49,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:31:49,131 INFO L276 IsEmpty]: Start isEmpty. Operand 12378 states and 18568 transitions. [2025-03-16 21:31:49,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-16 21:31:49,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:31:49,136 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:31:49,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 21:31:49,136 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:31:49,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:31:49,137 INFO L85 PathProgramCache]: Analyzing trace with hash 891756055, now seen corresponding path program 1 times [2025-03-16 21:31:49,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:31:49,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742042974] [2025-03-16 21:31:49,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:31:49,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:31:49,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-16 21:31:49,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-16 21:31:49,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:31:49,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:31:49,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:31:49,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:31:49,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742042974] [2025-03-16 21:31:49,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742042974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:31:49,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:31:49,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:31:49,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986946056] [2025-03-16 21:31:49,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:31:49,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:31:49,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:31:49,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:31:49,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:31:49,917 INFO L87 Difference]: Start difference. First operand 12378 states and 18568 transitions. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:31:55,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:31:55,181 INFO L93 Difference]: Finished difference Result 24708 states and 37060 transitions. [2025-03-16 21:31:55,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:31:55,181 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 5 states have internal predecessors, (134), 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 134 [2025-03-16 21:31:55,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:31:55,198 INFO L225 Difference]: With dead ends: 24708 [2025-03-16 21:31:55,198 INFO L226 Difference]: Without dead ends: 12487 [2025-03-16 21:31:55,207 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-03-16 21:31:55,208 INFO L435 NwaCegarLoop]: 15409 mSDtfsCounter, 18787 mSDsluCounter, 46227 mSDsCounter, 0 mSdLazyCounter, 12619 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18787 SdHoareTripleChecker+Valid, 61636 SdHoareTripleChecker+Invalid, 12619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-03-16 21:31:55,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18787 Valid, 61636 Invalid, 12619 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 12619 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-03-16 21:31:55,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12487 states. [2025-03-16 21:31:55,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12487 to 12468. [2025-03-16 21:31:55,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12468 states, 12467 states have (on average 1.5001203176385658) internal successors, (18702), 12467 states have internal predecessors, (18702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:31:55,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12468 states to 12468 states and 18702 transitions. [2025-03-16 21:31:55,362 INFO L78 Accepts]: Start accepts. Automaton has 12468 states and 18702 transitions. Word has length 134 [2025-03-16 21:31:55,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:31:55,363 INFO L471 AbstractCegarLoop]: Abstraction has 12468 states and 18702 transitions. [2025-03-16 21:31:55,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:31:55,363 INFO L276 IsEmpty]: Start isEmpty. Operand 12468 states and 18702 transitions. [2025-03-16 21:31:55,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-16 21:31:55,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:31:55,366 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:31:55,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 21:31:55,367 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:31:55,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:31:55,367 INFO L85 PathProgramCache]: Analyzing trace with hash -531949665, now seen corresponding path program 1 times [2025-03-16 21:31:55,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:31:55,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424969515] [2025-03-16 21:31:55,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:31:55,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:31:55,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-16 21:31:55,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-16 21:31:55,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:31:55,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:31:55,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:31:55,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:31:55,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424969515] [2025-03-16 21:31:55,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424969515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:31:55,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:31:55,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:31:55,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127590178] [2025-03-16 21:31:55,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:31:55,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 21:31:55,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:31:55,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 21:31:55,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:31:55,927 INFO L87 Difference]: Start difference. First operand 12468 states and 18702 transitions. Second operand has 8 states, 8 states have (on average 16.875) internal successors, (135), 7 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)