./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal52.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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.cal52.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 44bf48758489a3c41de6b432a4aba7f5826a63fec5c3fe3ce4a4d0bdc50f3078 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 23:41:11,010 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 23:41:11,053 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-11 23:41:11,057 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 23:41:11,057 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 23:41:11,071 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 23:41:11,072 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 23:41:11,072 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 23:41:11,073 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 23:41:11,073 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 23:41:11,073 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 23:41:11,073 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 23:41:11,074 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 23:41:11,074 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 23:41:11,074 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 23:41:11,075 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 23:41:11,075 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 23:41:11,075 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 23:41:11,076 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 23:41:11,076 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 23:41:11,076 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 23:41:11,077 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 23:41:11,078 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 23:41:11,078 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 23:41:11,078 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 23:41:11,079 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 23:41:11,079 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 23:41:11,079 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 23:41:11,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 23:41:11,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 23:41:11,080 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 23:41:11,080 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 23:41:11,080 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 23:41:11,081 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 23:41:11,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 23:41:11,081 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 23:41:11,081 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 23:41:11,082 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 23:41:11,082 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 23:41:11,082 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 44bf48758489a3c41de6b432a4aba7f5826a63fec5c3fe3ce4a4d0bdc50f3078 [2024-11-11 23:41:11,362 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 23:41:11,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 23:41:11,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 23:41:11,389 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 23:41:11,389 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 23:41:11,390 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal52.c [2024-11-11 23:41:12,716 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 23:41:13,251 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 23:41:13,252 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal52.c [2024-11-11 23:41:13,311 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7bcd96fa/d165240238e843f5be676819171d3b57/FLAGc0db05917 [2024-11-11 23:41:13,336 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7bcd96fa/d165240238e843f5be676819171d3b57 [2024-11-11 23:41:13,338 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 23:41:13,339 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 23:41:13,340 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 23:41:13,340 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 23:41:13,352 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 23:41:13,357 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 11:41:13" (1/1) ... [2024-11-11 23:41:13,357 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a9d3140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:41:13, skipping insertion in model container [2024-11-11 23:41:13,358 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 11:41:13" (1/1) ... [2024-11-11 23:41:13,504 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 23:41:13,785 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.cal52.c[1245,1258] [2024-11-11 23:41:14,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 23:41:14,745 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 23:41:14,753 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.cal52.c[1245,1258] [2024-11-11 23:41:15,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 23:41:15,582 INFO L204 MainTranslator]: Completed translation [2024-11-11 23:41:15,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:41:15 WrapperNode [2024-11-11 23:41:15,582 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 23:41:15,584 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 23:41:15,584 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 23:41:15,584 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 23:41:15,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:41:15" (1/1) ... [2024-11-11 23:41:15,758 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:41:15" (1/1) ... [2024-11-11 23:41:18,910 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 36277 [2024-11-11 23:41:18,911 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 23:41:18,912 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 23:41:18,912 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 23:41:18,913 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 23:41:18,921 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:41:15" (1/1) ... [2024-11-11 23:41:18,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:41:15" (1/1) ... [2024-11-11 23:41:19,992 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:41:15" (1/1) ... [2024-11-11 23:41:20,486 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]. [2024-11-11 23:41:20,487 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:41:15" (1/1) ... [2024-11-11 23:41:20,487 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:41:15" (1/1) ... [2024-11-11 23:41:21,436 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:41:15" (1/1) ... [2024-11-11 23:41:21,570 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:41:15" (1/1) ... [2024-11-11 23:41:21,737 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:41:15" (1/1) ... [2024-11-11 23:41:21,952 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:41:15" (1/1) ... [2024-11-11 23:41:22,508 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 23:41:22,509 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 23:41:22,510 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 23:41:22,510 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 23:41:22,510 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:41:15" (1/1) ... [2024-11-11 23:41:22,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 23:41:22,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 23:41:22,545 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) [2024-11-11 23:41:22,547 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 [2024-11-11 23:41:22,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 23:41:22,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 23:41:22,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 23:41:22,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 23:41:22,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 23:41:23,792 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 23:41:23,794 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 23:42:19,951 INFO L? ?]: Removed 20061 outVars from TransFormulas that were not future-live. [2024-11-11 23:42:19,952 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 23:42:20,050 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 23:42:20,050 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 23:42:20,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 11:42:20 BoogieIcfgContainer [2024-11-11 23:42:20,052 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 23:42:20,054 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 23:42:20,054 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 23:42:20,057 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 23:42:20,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 11:41:13" (1/3) ... [2024-11-11 23:42:20,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bc4d00e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 11:42:20, skipping insertion in model container [2024-11-11 23:42:20,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:41:15" (2/3) ... [2024-11-11 23:42:20,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bc4d00e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 11:42:20, skipping insertion in model container [2024-11-11 23:42:20,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 11:42:20" (3/3) ... [2024-11-11 23:42:20,060 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal52.c [2024-11-11 23:42:20,073 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 23:42:20,073 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 23:42:20,267 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 23:42:20,272 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;@4553f356, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 23:42:20,273 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 23:42:20,301 INFO L276 IsEmpty]: Start isEmpty. Operand has 12434 states, 12432 states have (on average 1.5004021879021878) internal successors, (18653), 12433 states have internal predecessors, (18653), 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) [2024-11-11 23:42:20,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-11 23:42:20,318 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:42:20,319 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:42:20,320 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:42:20,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:42:20,325 INFO L85 PathProgramCache]: Analyzing trace with hash -115074440, now seen corresponding path program 1 times [2024-11-11 23:42:20,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:42:20,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190032025] [2024-11-11 23:42:20,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:42:20,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:42:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:42:22,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:42:22,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:42:22,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190032025] [2024-11-11 23:42:22,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190032025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:42:22,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:42:22,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 23:42:22,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803275388] [2024-11-11 23:42:22,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:42:22,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 23:42:22,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:42:22,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 23:42:22,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:42:22,252 INFO L87 Difference]: Start difference. First operand has 12434 states, 12432 states have (on average 1.5004021879021878) internal successors, (18653), 12433 states have internal predecessors, (18653), 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 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 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) [2024-11-11 23:42:23,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:42:23,239 INFO L93 Difference]: Finished difference Result 24888 states and 37339 transitions. [2024-11-11 23:42:23,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 23:42:23,242 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 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 163 [2024-11-11 23:42:23,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:42:23,302 INFO L225 Difference]: With dead ends: 24888 [2024-11-11 23:42:23,303 INFO L226 Difference]: Without dead ends: 12604 [2024-11-11 23:42:23,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-11 23:42:23,328 INFO L435 NwaCegarLoop]: 18582 mSDtfsCounter, 19147 mSDsluCounter, 55748 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19147 SdHoareTripleChecker+Valid, 74330 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 23:42:23,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19147 Valid, 74330 Invalid, 266 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 23:42:23,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12604 states. [2024-11-11 23:42:23,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12604 to 12589. [2024-11-11 23:42:23,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12589 states, 12588 states have (on average 1.5002383222116302) internal successors, (18885), 12588 states have internal predecessors, (18885), 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) [2024-11-11 23:42:23,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12589 states to 12589 states and 18885 transitions. [2024-11-11 23:42:23,671 INFO L78 Accepts]: Start accepts. Automaton has 12589 states and 18885 transitions. Word has length 163 [2024-11-11 23:42:23,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:42:23,673 INFO L471 AbstractCegarLoop]: Abstraction has 12589 states and 18885 transitions. [2024-11-11 23:42:23,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 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) [2024-11-11 23:42:23,674 INFO L276 IsEmpty]: Start isEmpty. Operand 12589 states and 18885 transitions. [2024-11-11 23:42:23,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-11 23:42:23,682 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:42:23,682 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:42:23,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 23:42:23,683 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:42:23,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:42:23,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1668271990, now seen corresponding path program 1 times [2024-11-11 23:42:23,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:42:23,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703228986] [2024-11-11 23:42:23,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:42:23,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:42:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:42:24,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:42:24,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:42:24,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703228986] [2024-11-11 23:42:24,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703228986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:42:24,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:42:24,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 23:42:24,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103279070] [2024-11-11 23:42:24,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:42:24,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 23:42:24,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:42:24,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 23:42:24,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 23:42:24,263 INFO L87 Difference]: Start difference. First operand 12589 states and 18885 transitions. Second operand has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 23:42:24,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:42:24,427 INFO L93 Difference]: Finished difference Result 12593 states and 18889 transitions. [2024-11-11 23:42:24,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:42:24,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 164 [2024-11-11 23:42:24,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:42:24,463 INFO L225 Difference]: With dead ends: 12593 [2024-11-11 23:42:24,464 INFO L226 Difference]: Without dead ends: 12591 [2024-11-11 23:42:24,473 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 [2024-11-11 23:42:24,474 INFO L435 NwaCegarLoop]: 18647 mSDtfsCounter, 0 mSDsluCounter, 37288 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55935 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 23:42:24,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55935 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 23:42:24,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12591 states. [2024-11-11 23:42:24,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12591 to 12591. [2024-11-11 23:42:24,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12591 states, 12590 states have (on average 1.5001588562351071) internal successors, (18887), 12590 states have internal predecessors, (18887), 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) [2024-11-11 23:42:24,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12591 states to 12591 states and 18887 transitions. [2024-11-11 23:42:24,680 INFO L78 Accepts]: Start accepts. Automaton has 12591 states and 18887 transitions. Word has length 164 [2024-11-11 23:42:24,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:42:24,681 INFO L471 AbstractCegarLoop]: Abstraction has 12591 states and 18887 transitions. [2024-11-11 23:42:24,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 23:42:24,681 INFO L276 IsEmpty]: Start isEmpty. Operand 12591 states and 18887 transitions. [2024-11-11 23:42:24,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-11 23:42:24,683 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:42:24,683 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:42:24,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 23:42:24,683 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:42:24,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:42:24,684 INFO L85 PathProgramCache]: Analyzing trace with hash -175127958, now seen corresponding path program 1 times [2024-11-11 23:42:24,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:42:24,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460511993] [2024-11-11 23:42:24,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:42:24,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:42:24,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:42:25,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:42:25,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:42:25,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460511993] [2024-11-11 23:42:25,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460511993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:42:25,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:42:25,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 23:42:25,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062036460] [2024-11-11 23:42:25,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:42:25,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 23:42:25,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:42:25,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 23:42:25,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 23:42:25,066 INFO L87 Difference]: Start difference. First operand 12591 states and 18887 transitions. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 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) [2024-11-11 23:42:25,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:42:25,255 INFO L93 Difference]: Finished difference Result 24876 states and 37317 transitions. [2024-11-11 23:42:25,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:42:25,255 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 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 165 [2024-11-11 23:42:25,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:42:25,285 INFO L225 Difference]: With dead ends: 24876 [2024-11-11 23:42:25,286 INFO L226 Difference]: Without dead ends: 12593 [2024-11-11 23:42:25,300 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 [2024-11-11 23:42:25,302 INFO L435 NwaCegarLoop]: 18647 mSDtfsCounter, 0 mSDsluCounter, 37284 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55931 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 23:42:25,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55931 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 23:42:25,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12593 states. [2024-11-11 23:42:25,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12593 to 12593. [2024-11-11 23:42:25,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12593 states, 12592 states have (on average 1.500079415501906) internal successors, (18889), 12592 states have internal predecessors, (18889), 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) [2024-11-11 23:42:25,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12593 states to 12593 states and 18889 transitions. [2024-11-11 23:42:25,501 INFO L78 Accepts]: Start accepts. Automaton has 12593 states and 18889 transitions. Word has length 165 [2024-11-11 23:42:25,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:42:25,502 INFO L471 AbstractCegarLoop]: Abstraction has 12593 states and 18889 transitions. [2024-11-11 23:42:25,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 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) [2024-11-11 23:42:25,503 INFO L276 IsEmpty]: Start isEmpty. Operand 12593 states and 18889 transitions. [2024-11-11 23:42:25,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-11 23:42:25,504 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:42:25,505 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:42:25,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 23:42:25,505 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:42:25,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:42:25,506 INFO L85 PathProgramCache]: Analyzing trace with hash 2063002979, now seen corresponding path program 1 times [2024-11-11 23:42:25,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:42:25,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189977974] [2024-11-11 23:42:25,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:42:25,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:42:25,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:42:26,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:42:26,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:42:26,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189977974] [2024-11-11 23:42:26,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189977974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:42:26,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:42:26,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 23:42:26,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148396505] [2024-11-11 23:42:26,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:42:26,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 23:42:26,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:42:26,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 23:42:26,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:42:26,157 INFO L87 Difference]: Start difference. First operand 12593 states and 18889 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 23:42:27,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:42:27,623 INFO L93 Difference]: Finished difference Result 36999 states and 55501 transitions. [2024-11-11 23:42:27,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 23:42:27,623 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 166 [2024-11-11 23:42:27,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:42:27,644 INFO L225 Difference]: With dead ends: 36999 [2024-11-11 23:42:27,645 INFO L226 Difference]: Without dead ends: 12601 [2024-11-11 23:42:27,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-11 23:42:27,670 INFO L435 NwaCegarLoop]: 18645 mSDtfsCounter, 54273 mSDsluCounter, 55279 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54273 SdHoareTripleChecker+Valid, 73924 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 23:42:27,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54273 Valid, 73924 Invalid, 1196 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [117 Valid, 1079 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 23:42:27,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12601 states. [2024-11-11 23:42:27,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12601 to 12597. [2024-11-11 23:42:27,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12597 states, 12596 states have (on average 1.4999206097173705) internal successors, (18893), 12596 states have internal predecessors, (18893), 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) [2024-11-11 23:42:27,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12597 states to 12597 states and 18893 transitions. [2024-11-11 23:42:27,874 INFO L78 Accepts]: Start accepts. Automaton has 12597 states and 18893 transitions. Word has length 166 [2024-11-11 23:42:27,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:42:27,874 INFO L471 AbstractCegarLoop]: Abstraction has 12597 states and 18893 transitions. [2024-11-11 23:42:27,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 23:42:27,875 INFO L276 IsEmpty]: Start isEmpty. Operand 12597 states and 18893 transitions. [2024-11-11 23:42:27,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-11 23:42:27,876 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:42:27,876 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:42:27,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 23:42:27,877 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:42:27,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:42:27,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1755183669, now seen corresponding path program 1 times [2024-11-11 23:42:27,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:42:27,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999388374] [2024-11-11 23:42:27,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:42:27,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:42:28,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:42:28,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:42:28,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:42:28,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999388374] [2024-11-11 23:42:28,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999388374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:42:28,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:42:28,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 23:42:28,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905196684] [2024-11-11 23:42:28,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:42:28,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 23:42:28,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:42:28,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 23:42:28,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 23:42:28,433 INFO L87 Difference]: Start difference. First operand 12597 states and 18893 transitions. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 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) [2024-11-11 23:42:28,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:42:28,633 INFO L93 Difference]: Finished difference Result 24968 states and 37448 transitions. [2024-11-11 23:42:28,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 23:42:28,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 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 167 [2024-11-11 23:42:28,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:42:28,648 INFO L225 Difference]: With dead ends: 24968 [2024-11-11 23:42:28,649 INFO L226 Difference]: Without dead ends: 12597 [2024-11-11 23:42:28,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:42:28,665 INFO L435 NwaCegarLoop]: 18643 mSDtfsCounter, 77 mSDsluCounter, 37208 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 55851 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 23:42:28,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 55851 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 23:42:28,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12597 states. [2024-11-11 23:42:28,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12597 to 12597. [2024-11-11 23:42:28,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12597 states, 12596 states have (on average 1.4997618291521118) internal successors, (18891), 12596 states have internal predecessors, (18891), 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) [2024-11-11 23:42:28,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12597 states to 12597 states and 18891 transitions. [2024-11-11 23:42:28,823 INFO L78 Accepts]: Start accepts. Automaton has 12597 states and 18891 transitions. Word has length 167 [2024-11-11 23:42:28,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:42:28,824 INFO L471 AbstractCegarLoop]: Abstraction has 12597 states and 18891 transitions. [2024-11-11 23:42:28,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 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) [2024-11-11 23:42:28,825 INFO L276 IsEmpty]: Start isEmpty. Operand 12597 states and 18891 transitions. [2024-11-11 23:42:28,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-11 23:42:28,826 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:42:28,826 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:42:28,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 23:42:28,827 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:42:28,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:42:28,827 INFO L85 PathProgramCache]: Analyzing trace with hash 871426288, now seen corresponding path program 1 times [2024-11-11 23:42:28,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:42:28,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916714592] [2024-11-11 23:42:28,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:42:28,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:42:28,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:42:29,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:42:29,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:42:29,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916714592] [2024-11-11 23:42:29,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916714592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:42:29,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:42:29,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 23:42:29,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340399732] [2024-11-11 23:42:29,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:42:29,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 23:42:29,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:42:29,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 23:42:29,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 23:42:29,392 INFO L87 Difference]: Start difference. First operand 12597 states and 18891 transitions. Second operand has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 23:42:30,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:42:30,510 INFO L93 Difference]: Finished difference Result 24905 states and 37348 transitions. [2024-11-11 23:42:30,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 23:42:30,514 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 168 [2024-11-11 23:42:30,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:42:30,541 INFO L225 Difference]: With dead ends: 24905 [2024-11-11 23:42:30,545 INFO L226 Difference]: Without dead ends: 12618 [2024-11-11 23:42:30,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-11 23:42:30,562 INFO L435 NwaCegarLoop]: 18580 mSDtfsCounter, 19144 mSDsluCounter, 92896 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19144 SdHoareTripleChecker+Valid, 111476 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 23:42:30,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19144 Valid, 111476 Invalid, 412 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 23:42:30,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12618 states. [2024-11-11 23:42:30,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12618 to 12600. [2024-11-11 23:42:30,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12600 states, 12599 states have (on average 1.499722200174617) internal successors, (18895), 12599 states have internal predecessors, (18895), 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) [2024-11-11 23:42:30,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12600 states to 12600 states and 18895 transitions. [2024-11-11 23:42:30,789 INFO L78 Accepts]: Start accepts. Automaton has 12600 states and 18895 transitions. Word has length 168 [2024-11-11 23:42:30,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:42:30,791 INFO L471 AbstractCegarLoop]: Abstraction has 12600 states and 18895 transitions. [2024-11-11 23:42:30,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.0) internal successors, (168), 8 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 23:42:30,793 INFO L276 IsEmpty]: Start isEmpty. Operand 12600 states and 18895 transitions. [2024-11-11 23:42:30,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-11 23:42:30,794 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:42:30,794 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:42:30,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 23:42:30,794 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:42:30,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:42:30,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1563758465, now seen corresponding path program 1 times [2024-11-11 23:42:30,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:42:30,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817511794] [2024-11-11 23:42:30,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:42:30,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:42:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:42:31,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:42:31,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:42:31,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817511794] [2024-11-11 23:42:31,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817511794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:42:31,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:42:31,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 23:42:31,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143435338] [2024-11-11 23:42:31,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:42:31,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 23:42:31,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:42:31,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 23:42:31,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 23:42:31,230 INFO L87 Difference]: Start difference. First operand 12600 states and 18895 transitions. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 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) [2024-11-11 23:42:32,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:42:32,285 INFO L93 Difference]: Finished difference Result 37098 states and 55637 transitions. [2024-11-11 23:42:32,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 23:42:32,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 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 169 [2024-11-11 23:42:32,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:42:32,306 INFO L225 Difference]: With dead ends: 37098 [2024-11-11 23:42:32,306 INFO L226 Difference]: Without dead ends: 12600 [2024-11-11 23:42:32,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:42:32,326 INFO L435 NwaCegarLoop]: 18598 mSDtfsCounter, 17931 mSDsluCounter, 36606 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17931 SdHoareTripleChecker+Valid, 55204 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 23:42:32,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17931 Valid, 55204 Invalid, 995 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [116 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 23:42:32,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12600 states. [2024-11-11 23:42:32,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12600 to 12600. [2024-11-11 23:42:32,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12600 states, 12599 states have (on average 1.4995634574172554) internal successors, (18893), 12599 states have internal predecessors, (18893), 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) [2024-11-11 23:42:32,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12600 states to 12600 states and 18893 transitions. [2024-11-11 23:42:32,468 INFO L78 Accepts]: Start accepts. Automaton has 12600 states and 18893 transitions. Word has length 169 [2024-11-11 23:42:32,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:42:32,468 INFO L471 AbstractCegarLoop]: Abstraction has 12600 states and 18893 transitions. [2024-11-11 23:42:32,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 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) [2024-11-11 23:42:32,468 INFO L276 IsEmpty]: Start isEmpty. Operand 12600 states and 18893 transitions. [2024-11-11 23:42:32,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-11 23:42:32,469 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:42:32,469 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:42:32,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 23:42:32,470 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:42:32,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:42:32,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1334962195, now seen corresponding path program 1 times [2024-11-11 23:42:32,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:42:32,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832857356] [2024-11-11 23:42:32,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:42:32,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:42:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:42:33,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:42:33,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:42:33,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832857356] [2024-11-11 23:42:33,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832857356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:42:33,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:42:33,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 23:42:33,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156932988] [2024-11-11 23:42:33,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:42:33,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 23:42:33,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:42:33,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 23:42:33,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:42:33,087 INFO L87 Difference]: Start difference. First operand 12600 states and 18893 transitions. Second operand has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 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) [2024-11-11 23:42:34,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 23:42:34,426 INFO L93 Difference]: Finished difference Result 24982 states and 37460 transitions. [2024-11-11 23:42:34,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 23:42:34,427 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 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 170 [2024-11-11 23:42:34,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 23:42:34,443 INFO L225 Difference]: With dead ends: 24982 [2024-11-11 23:42:34,444 INFO L226 Difference]: Without dead ends: 12608 [2024-11-11 23:42:34,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 23:42:34,456 INFO L435 NwaCegarLoop]: 18009 mSDtfsCounter, 18646 mSDsluCounter, 36013 mSDsCounter, 0 mSdLazyCounter, 1917 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18646 SdHoareTripleChecker+Valid, 54022 SdHoareTripleChecker+Invalid, 1918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 23:42:34,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18646 Valid, 54022 Invalid, 1918 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 1917 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 23:42:34,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12608 states. [2024-11-11 23:42:34,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12608 to 12606. [2024-11-11 23:42:34,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12606 states, 12605 states have (on average 1.4993256644188815) internal successors, (18899), 12605 states have internal predecessors, (18899), 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) [2024-11-11 23:42:34,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12606 states to 12606 states and 18899 transitions. [2024-11-11 23:42:34,579 INFO L78 Accepts]: Start accepts. Automaton has 12606 states and 18899 transitions. Word has length 170 [2024-11-11 23:42:34,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 23:42:34,579 INFO L471 AbstractCegarLoop]: Abstraction has 12606 states and 18899 transitions. [2024-11-11 23:42:34,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 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) [2024-11-11 23:42:34,580 INFO L276 IsEmpty]: Start isEmpty. Operand 12606 states and 18899 transitions. [2024-11-11 23:42:34,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-11 23:42:34,581 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 23:42:34,581 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 23:42:34,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 23:42:34,581 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 23:42:34,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 23:42:34,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1585659331, now seen corresponding path program 1 times [2024-11-11 23:42:34,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 23:42:34,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342736353] [2024-11-11 23:42:34,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 23:42:34,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 23:42:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 23:42:35,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 23:42:35,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 23:42:35,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342736353] [2024-11-11 23:42:35,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342736353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 23:42:35,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 23:42:35,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 23:42:35,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103527792] [2024-11-11 23:42:35,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 23:42:35,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 23:42:35,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 23:42:35,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 23:42:35,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 23:42:35,312 INFO L87 Difference]: Start difference. First operand 12606 states and 18899 transitions. Second operand has 6 states, 6 states have (on average 28.5) internal successors, (171), 6 states have internal predecessors, (171), 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)