./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 64562d20261a98c4fff8930ffc2f21f6ad2db9602778187addddf7335f143802 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 09:35:44,156 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 09:35:44,236 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 09:35:44,244 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 09:35:44,245 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 09:35:44,272 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 09:35:44,273 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 09:35:44,273 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 09:35:44,274 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 09:35:44,274 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 09:35:44,275 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 09:35:44,275 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 09:35:44,276 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 09:35:44,276 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 09:35:44,276 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 09:35:44,277 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 09:35:44,277 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 09:35:44,277 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 09:35:44,278 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 09:35:44,278 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 09:35:44,278 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 09:35:44,280 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 09:35:44,281 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 09:35:44,281 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 09:35:44,281 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 09:35:44,281 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 09:35:44,282 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 09:35:44,282 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 09:35:44,282 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 09:35:44,282 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 09:35:44,283 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 09:35:44,283 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 09:35:44,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 09:35:44,284 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 09:35:44,284 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 09:35:44,284 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 09:35:44,285 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 09:35:44,285 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 09:35:44,285 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 09:35:44,285 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 09:35:44,285 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 09:35:44,286 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 09:35:44,286 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 64562d20261a98c4fff8930ffc2f21f6ad2db9602778187addddf7335f143802 [2024-11-16 09:35:44,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 09:35:44,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 09:35:44,581 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 09:35:44,582 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 09:35:44,583 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 09:35:44,584 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c [2024-11-16 09:35:45,992 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 09:35:46,452 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 09:35:46,453 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c [2024-11-16 09:35:46,487 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fc786493/dd4a971bce8c4a1891c33fbd9a8a1f86/FLAG0128f971a [2024-11-16 09:35:46,503 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fc786493/dd4a971bce8c4a1891c33fbd9a8a1f86 [2024-11-16 09:35:46,508 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 09:35:46,510 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 09:35:46,512 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 09:35:46,513 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 09:35:46,519 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 09:35:46,520 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:35:46" (1/1) ... [2024-11-16 09:35:46,521 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@608fd5d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:35:46, skipping insertion in model container [2024-11-16 09:35:46,521 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:35:46" (1/1) ... [2024-11-16 09:35:46,627 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 09:35:46,950 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/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[6524,6537] [2024-11-16 09:35:47,029 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/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[13460,13473] [2024-11-16 09:35:47,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 09:35:47,649 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 09:35:47,687 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/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[6524,6537] [2024-11-16 09:35:47,699 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/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[13460,13473] [2024-11-16 09:35:48,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 09:35:48,107 INFO L204 MainTranslator]: Completed translation [2024-11-16 09:35:48,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:35:48 WrapperNode [2024-11-16 09:35:48,108 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 09:35:48,109 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 09:35:48,109 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 09:35:48,109 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 09:35:48,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:35:48" (1/1) ... [2024-11-16 09:35:48,167 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:35:48" (1/1) ... [2024-11-16 09:35:48,528 INFO L138 Inliner]: procedures = 35, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 4979 [2024-11-16 09:35:48,528 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 09:35:48,529 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 09:35:48,529 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 09:35:48,529 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 09:35:48,542 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:35:48" (1/1) ... [2024-11-16 09:35:48,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:35:48" (1/1) ... [2024-11-16 09:35:48,575 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:35:48" (1/1) ... [2024-11-16 09:35:48,760 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 09:35:48,763 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:35:48" (1/1) ... [2024-11-16 09:35:48,764 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:35:48" (1/1) ... [2024-11-16 09:35:48,914 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:35:48" (1/1) ... [2024-11-16 09:35:48,927 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:35:48" (1/1) ... [2024-11-16 09:35:48,948 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:35:48" (1/1) ... [2024-11-16 09:35:48,967 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:35:48" (1/1) ... [2024-11-16 09:35:49,030 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 09:35:49,032 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 09:35:49,032 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 09:35:49,032 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 09:35:49,033 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:35:48" (1/1) ... [2024-11-16 09:35:49,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 09:35:49,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:35:49,063 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-16 09:35:49,065 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-16 09:35:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 09:35:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 09:35:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 09:35:49,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 09:35:49,198 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 09:35:49,200 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 09:35:53,353 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1986: havoc calculate_output_#t~ret29#1; [2024-11-16 09:35:53,353 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L3465: havoc calculate_output2_#t~ret30#1; [2024-11-16 09:35:53,353 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L4955: havoc calculate_output3_#t~ret31#1; [2024-11-16 09:35:53,487 INFO L? ?]: Removed 734 outVars from TransFormulas that were not future-live. [2024-11-16 09:35:53,488 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 09:35:53,527 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 09:35:53,527 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 09:35:53,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 09:35:53 BoogieIcfgContainer [2024-11-16 09:35:53,528 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 09:35:53,530 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 09:35:53,530 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 09:35:53,533 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 09:35:53,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 09:35:46" (1/3) ... [2024-11-16 09:35:53,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e70a6e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:35:53, skipping insertion in model container [2024-11-16 09:35:53,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:35:48" (2/3) ... [2024-11-16 09:35:53,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e70a6e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:35:53, skipping insertion in model container [2024-11-16 09:35:53,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 09:35:53" (3/3) ... [2024-11-16 09:35:53,536 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c [2024-11-16 09:35:53,555 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 09:35:53,555 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-16 09:35:53,644 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 09:35:53,653 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;@698ba7f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 09:35:53,653 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-16 09:35:53,662 INFO L276 IsEmpty]: Start isEmpty. Operand has 879 states, 876 states have (on average 1.8995433789954337) internal successors, (1664), 878 states have internal predecessors, (1664), 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-16 09:35:53,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-16 09:35:53,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:35:53,672 INFO L215 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] [2024-11-16 09:35:53,673 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:35:53,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:35:53,678 INFO L85 PathProgramCache]: Analyzing trace with hash 159669486, now seen corresponding path program 1 times [2024-11-16 09:35:53,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:35:53,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230813064] [2024-11-16 09:35:53,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:35:53,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:35:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:35:53,928 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-16 09:35:53,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:35:53,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230813064] [2024-11-16 09:35:53,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230813064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:35:53,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:35:53,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 09:35:53,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542208071] [2024-11-16 09:35:53,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:35:53,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 09:35:53,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:35:53,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 09:35:53,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 09:35:53,965 INFO L87 Difference]: Start difference. First operand has 879 states, 876 states have (on average 1.8995433789954337) internal successors, (1664), 878 states have internal predecessors, (1664), 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 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-16 09:35:54,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:35:54,059 INFO L93 Difference]: Finished difference Result 1732 states and 3284 transitions. [2024-11-16 09:35:54,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 09:35:54,061 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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 22 [2024-11-16 09:35:54,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:35:54,078 INFO L225 Difference]: With dead ends: 1732 [2024-11-16 09:35:54,078 INFO L226 Difference]: Without dead ends: 811 [2024-11-16 09:35:54,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 09:35:54,087 INFO L432 NwaCegarLoop]: 1593 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1593 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:35:54,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1593 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:35:54,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2024-11-16 09:35:54,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 811. [2024-11-16 09:35:54,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 809 states have (on average 1.8899876390605685) internal successors, (1529), 810 states have internal predecessors, (1529), 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-16 09:35:54,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1529 transitions. [2024-11-16 09:35:54,187 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1529 transitions. Word has length 22 [2024-11-16 09:35:54,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:35:54,188 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 1529 transitions. [2024-11-16 09:35:54,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-16 09:35:54,188 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1529 transitions. [2024-11-16 09:35:54,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-16 09:35:54,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:35:54,190 INFO L215 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] [2024-11-16 09:35:54,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 09:35:54,190 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:35:54,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:35:54,191 INFO L85 PathProgramCache]: Analyzing trace with hash -350864691, now seen corresponding path program 1 times [2024-11-16 09:35:54,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:35:54,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344045037] [2024-11-16 09:35:54,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:35:54,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:35:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:35:54,434 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-16 09:35:54,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:35:54,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344045037] [2024-11-16 09:35:54,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344045037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:35:54,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:35:54,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 09:35:54,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355776681] [2024-11-16 09:35:54,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:35:54,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 09:35:54,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:35:54,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 09:35:54,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 09:35:54,440 INFO L87 Difference]: Start difference. First operand 811 states and 1529 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-16 09:35:54,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:35:54,538 INFO L93 Difference]: Finished difference Result 848 states and 1583 transitions. [2024-11-16 09:35:54,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 09:35:54,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2024-11-16 09:35:54,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:35:54,544 INFO L225 Difference]: With dead ends: 848 [2024-11-16 09:35:54,544 INFO L226 Difference]: Without dead ends: 811 [2024-11-16 09:35:54,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 09:35:54,545 INFO L432 NwaCegarLoop]: 1527 mSDtfsCounter, 0 mSDsluCounter, 4560 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6087 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:35:54,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6087 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:35:54,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2024-11-16 09:35:54,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 811. [2024-11-16 09:35:54,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 809 states have (on average 1.8702101359703338) internal successors, (1513), 810 states have internal predecessors, (1513), 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-16 09:35:54,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1513 transitions. [2024-11-16 09:35:54,606 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1513 transitions. Word has length 22 [2024-11-16 09:35:54,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:35:54,606 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 1513 transitions. [2024-11-16 09:35:54,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-16 09:35:54,607 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1513 transitions. [2024-11-16 09:35:54,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-16 09:35:54,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:35:54,608 INFO L215 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] [2024-11-16 09:35:54,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 09:35:54,609 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:35:54,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:35:54,610 INFO L85 PathProgramCache]: Analyzing trace with hash 644860677, now seen corresponding path program 1 times [2024-11-16 09:35:54,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:35:54,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824732133] [2024-11-16 09:35:54,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:35:54,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:35:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:35:54,732 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-16 09:35:54,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:35:54,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824732133] [2024-11-16 09:35:54,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824732133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:35:54,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:35:54,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 09:35:54,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120639334] [2024-11-16 09:35:54,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:35:54,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 09:35:54,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:35:54,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 09:35:54,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 09:35:54,734 INFO L87 Difference]: Start difference. First operand 811 states and 1513 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:35:54,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:35:54,860 INFO L93 Difference]: Finished difference Result 1009 states and 1813 transitions. [2024-11-16 09:35:54,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 09:35:54,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-16 09:35:54,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:35:54,866 INFO L225 Difference]: With dead ends: 1009 [2024-11-16 09:35:54,867 INFO L226 Difference]: Without dead ends: 976 [2024-11-16 09:35:54,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-16 09:35:54,868 INFO L432 NwaCegarLoop]: 1509 mSDtfsCounter, 4611 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4611 SdHoareTripleChecker+Valid, 1897 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 09:35:54,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4611 Valid, 1897 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 09:35:54,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-11-16 09:35:54,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 841. [2024-11-16 09:35:54,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 839 states have (on average 1.8581644815256257) internal successors, (1559), 840 states have internal predecessors, (1559), 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-16 09:35:54,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1559 transitions. [2024-11-16 09:35:54,888 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1559 transitions. Word has length 37 [2024-11-16 09:35:54,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:35:54,889 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 1559 transitions. [2024-11-16 09:35:54,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:35:54,889 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1559 transitions. [2024-11-16 09:35:54,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-16 09:35:54,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:35:54,890 INFO L215 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] [2024-11-16 09:35:54,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 09:35:54,891 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:35:54,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:35:54,891 INFO L85 PathProgramCache]: Analyzing trace with hash -769786777, now seen corresponding path program 1 times [2024-11-16 09:35:54,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:35:54,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403083381] [2024-11-16 09:35:54,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:35:54,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:35:54,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:35:55,116 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-16 09:35:55,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:35:55,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403083381] [2024-11-16 09:35:55,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403083381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:35:55,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:35:55,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 09:35:55,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813453928] [2024-11-16 09:35:55,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:35:55,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 09:35:55,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:35:55,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 09:35:55,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 09:35:55,120 INFO L87 Difference]: Start difference. First operand 841 states and 1559 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:35:55,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:35:55,208 INFO L93 Difference]: Finished difference Result 907 states and 1657 transitions. [2024-11-16 09:35:55,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 09:35:55,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-16 09:35:55,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:35:55,212 INFO L225 Difference]: With dead ends: 907 [2024-11-16 09:35:55,212 INFO L226 Difference]: Without dead ends: 844 [2024-11-16 09:35:55,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-16 09:35:55,214 INFO L432 NwaCegarLoop]: 1508 mSDtfsCounter, 4429 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4429 SdHoareTripleChecker+Valid, 1600 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:35:55,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4429 Valid, 1600 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:35:55,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2024-11-16 09:35:55,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 841. [2024-11-16 09:35:55,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 839 states have (on average 1.8569725864123956) internal successors, (1558), 840 states have internal predecessors, (1558), 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-16 09:35:55,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1558 transitions. [2024-11-16 09:35:55,239 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1558 transitions. Word has length 39 [2024-11-16 09:35:55,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:35:55,239 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 1558 transitions. [2024-11-16 09:35:55,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:35:55,240 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1558 transitions. [2024-11-16 09:35:55,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-16 09:35:55,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:35:55,244 INFO L215 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] [2024-11-16 09:35:55,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 09:35:55,244 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:35:55,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:35:55,245 INFO L85 PathProgramCache]: Analyzing trace with hash -664734402, now seen corresponding path program 1 times [2024-11-16 09:35:55,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:35:55,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744967307] [2024-11-16 09:35:55,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:35:55,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:35:55,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:35:55,323 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-16 09:35:55,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:35:55,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744967307] [2024-11-16 09:35:55,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744967307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:35:55,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:35:55,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:35:55,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989711670] [2024-11-16 09:35:55,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:35:55,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:35:55,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:35:55,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:35:55,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:35:55,328 INFO L87 Difference]: Start difference. First operand 841 states and 1558 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:35:55,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:35:55,360 INFO L93 Difference]: Finished difference Result 955 states and 1728 transitions. [2024-11-16 09:35:55,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:35:55,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-16 09:35:55,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:35:55,365 INFO L225 Difference]: With dead ends: 955 [2024-11-16 09:35:55,365 INFO L226 Difference]: Without dead ends: 892 [2024-11-16 09:35:55,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:35:55,368 INFO L432 NwaCegarLoop]: 1519 mSDtfsCounter, 1470 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 1564 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:35:55,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1470 Valid, 1564 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:35:55,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2024-11-16 09:35:55,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 889. [2024-11-16 09:35:55,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 887 states have (on average 1.8354002254791433) internal successors, (1628), 888 states have internal predecessors, (1628), 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-16 09:35:55,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1628 transitions. [2024-11-16 09:35:55,391 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1628 transitions. Word has length 40 [2024-11-16 09:35:55,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:35:55,392 INFO L471 AbstractCegarLoop]: Abstraction has 889 states and 1628 transitions. [2024-11-16 09:35:55,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:35:55,393 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1628 transitions. [2024-11-16 09:35:55,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-16 09:35:55,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:35:55,394 INFO L215 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] [2024-11-16 09:35:55,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 09:35:55,394 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:35:55,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:35:55,396 INFO L85 PathProgramCache]: Analyzing trace with hash 307573737, now seen corresponding path program 1 times [2024-11-16 09:35:55,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:35:55,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698044968] [2024-11-16 09:35:55,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:35:55,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:35:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:35:55,447 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-16 09:35:55,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:35:55,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698044968] [2024-11-16 09:35:55,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698044968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:35:55,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:35:55,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:35:55,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491074624] [2024-11-16 09:35:55,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:35:55,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:35:55,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:35:55,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:35:55,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:35:55,450 INFO L87 Difference]: Start difference. First operand 889 states and 1628 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:35:55,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:35:55,481 INFO L93 Difference]: Finished difference Result 1010 states and 1808 transitions. [2024-11-16 09:35:55,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:35:55,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-16 09:35:55,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:35:55,486 INFO L225 Difference]: With dead ends: 1010 [2024-11-16 09:35:55,486 INFO L226 Difference]: Without dead ends: 947 [2024-11-16 09:35:55,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:35:55,487 INFO L432 NwaCegarLoop]: 1547 mSDtfsCounter, 1480 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:35:55,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 1598 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:35:55,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2024-11-16 09:35:55,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 944. [2024-11-16 09:35:55,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 942 states have (on average 1.813163481953291) internal successors, (1708), 943 states have internal predecessors, (1708), 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-16 09:35:55,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1708 transitions. [2024-11-16 09:35:55,507 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1708 transitions. Word has length 41 [2024-11-16 09:35:55,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:35:55,507 INFO L471 AbstractCegarLoop]: Abstraction has 944 states and 1708 transitions. [2024-11-16 09:35:55,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:35:55,508 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1708 transitions. [2024-11-16 09:35:55,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-16 09:35:55,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:35:55,509 INFO L215 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] [2024-11-16 09:35:55,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 09:35:55,509 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:35:55,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:35:55,509 INFO L85 PathProgramCache]: Analyzing trace with hash 293123881, now seen corresponding path program 1 times [2024-11-16 09:35:55,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:35:55,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323952378] [2024-11-16 09:35:55,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:35:55,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:35:55,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:35:55,555 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-16 09:35:55,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:35:55,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323952378] [2024-11-16 09:35:55,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323952378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:35:55,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:35:55,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:35:55,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770296877] [2024-11-16 09:35:55,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:35:55,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:35:55,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:35:55,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:35:55,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:35:55,557 INFO L87 Difference]: Start difference. First operand 944 states and 1708 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:35:55,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:35:55,585 INFO L93 Difference]: Finished difference Result 1246 states and 2150 transitions. [2024-11-16 09:35:55,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:35:55,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-16 09:35:55,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:35:55,590 INFO L225 Difference]: With dead ends: 1246 [2024-11-16 09:35:55,590 INFO L226 Difference]: Without dead ends: 1083 [2024-11-16 09:35:55,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:35:55,592 INFO L432 NwaCegarLoop]: 1549 mSDtfsCounter, 1478 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1478 SdHoareTripleChecker+Valid, 1604 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:35:55,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1478 Valid, 1604 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:35:55,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2024-11-16 09:35:55,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1080. [2024-11-16 09:35:55,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 1078 states have (on average 1.7625231910946197) internal successors, (1900), 1079 states have internal predecessors, (1900), 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-16 09:35:55,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1900 transitions. [2024-11-16 09:35:55,619 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1900 transitions. Word has length 41 [2024-11-16 09:35:55,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:35:55,619 INFO L471 AbstractCegarLoop]: Abstraction has 1080 states and 1900 transitions. [2024-11-16 09:35:55,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:35:55,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1900 transitions. [2024-11-16 09:35:55,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-16 09:35:55,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:35:55,621 INFO L215 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] [2024-11-16 09:35:55,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 09:35:55,621 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:35:55,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:35:55,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1910240663, now seen corresponding path program 1 times [2024-11-16 09:35:55,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:35:55,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220894626] [2024-11-16 09:35:55,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:35:55,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:35:55,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:35:55,679 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-16 09:35:55,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:35:55,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220894626] [2024-11-16 09:35:55,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220894626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:35:55,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:35:55,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:35:55,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273397435] [2024-11-16 09:35:55,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:35:55,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:35:55,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:35:55,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:35:55,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:35:55,683 INFO L87 Difference]: Start difference. First operand 1080 states and 1900 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:35:55,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:35:55,718 INFO L93 Difference]: Finished difference Result 1630 states and 2684 transitions. [2024-11-16 09:35:55,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:35:55,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-16 09:35:55,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:35:55,725 INFO L225 Difference]: With dead ends: 1630 [2024-11-16 09:35:55,725 INFO L226 Difference]: Without dead ends: 1331 [2024-11-16 09:35:55,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:35:55,727 INFO L432 NwaCegarLoop]: 1547 mSDtfsCounter, 1476 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 1606 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:35:55,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 1606 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:35:55,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2024-11-16 09:35:55,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1328. [2024-11-16 09:35:55,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1326 states have (on average 1.6862745098039216) internal successors, (2236), 1327 states have internal predecessors, (2236), 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-16 09:35:55,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 2236 transitions. [2024-11-16 09:35:55,760 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 2236 transitions. Word has length 41 [2024-11-16 09:35:55,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:35:55,760 INFO L471 AbstractCegarLoop]: Abstraction has 1328 states and 2236 transitions. [2024-11-16 09:35:55,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:35:55,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 2236 transitions. [2024-11-16 09:35:55,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-16 09:35:55,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:35:55,761 INFO L215 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] [2024-11-16 09:35:55,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 09:35:55,761 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:35:55,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:35:55,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1860449578, now seen corresponding path program 1 times [2024-11-16 09:35:55,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:35:55,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346727843] [2024-11-16 09:35:55,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:35:55,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:35:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:35:55,964 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-16 09:35:55,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:35:55,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346727843] [2024-11-16 09:35:55,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346727843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:35:55,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:35:55,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 09:35:55,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262433389] [2024-11-16 09:35:55,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:35:55,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 09:35:55,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:35:55,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 09:35:55,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 09:35:55,966 INFO L87 Difference]: Start difference. First operand 1328 states and 2236 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:35:56,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:35:56,027 INFO L93 Difference]: Finished difference Result 1379 states and 2302 transitions. [2024-11-16 09:35:56,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 09:35:56,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-16 09:35:56,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:35:56,033 INFO L225 Difference]: With dead ends: 1379 [2024-11-16 09:35:56,034 INFO L226 Difference]: Without dead ends: 1376 [2024-11-16 09:35:56,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 09:35:56,035 INFO L432 NwaCegarLoop]: 1510 mSDtfsCounter, 0 mSDsluCounter, 4521 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6031 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:35:56,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6031 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:35:56,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2024-11-16 09:35:56,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1376. [2024-11-16 09:35:56,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1376 states, 1374 states have (on average 1.6593886462882097) internal successors, (2280), 1375 states have internal predecessors, (2280), 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-16 09:35:56,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 2280 transitions. [2024-11-16 09:35:56,071 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 2280 transitions. Word has length 41 [2024-11-16 09:35:56,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:35:56,072 INFO L471 AbstractCegarLoop]: Abstraction has 1376 states and 2280 transitions. [2024-11-16 09:35:56,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:35:56,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 2280 transitions. [2024-11-16 09:35:56,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-16 09:35:56,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:35:56,074 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 09:35:56,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 09:35:56,074 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:35:56,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:35:56,075 INFO L85 PathProgramCache]: Analyzing trace with hash -636110161, now seen corresponding path program 1 times [2024-11-16 09:35:56,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:35:56,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954811520] [2024-11-16 09:35:56,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:35:56,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:35:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:35:56,211 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 09:35:56,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:35:56,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954811520] [2024-11-16 09:35:56,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954811520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:35:56,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:35:56,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 09:35:56,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767279417] [2024-11-16 09:35:56,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:35:56,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 09:35:56,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:35:56,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 09:35:56,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 09:35:56,215 INFO L87 Difference]: Start difference. First operand 1376 states and 2280 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-16 09:35:56,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:35:56,345 INFO L93 Difference]: Finished difference Result 3144 states and 4692 transitions. [2024-11-16 09:35:56,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 09:35:56,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 58 [2024-11-16 09:35:56,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:35:56,358 INFO L225 Difference]: With dead ends: 3144 [2024-11-16 09:35:56,358 INFO L226 Difference]: Without dead ends: 2709 [2024-11-16 09:35:56,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-16 09:35:56,360 INFO L432 NwaCegarLoop]: 1555 mSDtfsCounter, 3050 mSDsluCounter, 1640 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3050 SdHoareTripleChecker+Valid, 3195 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 09:35:56,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3050 Valid, 3195 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 09:35:56,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2709 states. [2024-11-16 09:35:56,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2709 to 1892. [2024-11-16 09:35:56,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1892 states, 1890 states have (on average 1.5746031746031746) internal successors, (2976), 1891 states have internal predecessors, (2976), 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-16 09:35:56,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 2976 transitions. [2024-11-16 09:35:56,426 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 2976 transitions. Word has length 58 [2024-11-16 09:35:56,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:35:56,427 INFO L471 AbstractCegarLoop]: Abstraction has 1892 states and 2976 transitions. [2024-11-16 09:35:56,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-16 09:35:56,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2976 transitions. [2024-11-16 09:35:56,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-16 09:35:56,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:35:56,429 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 09:35:56,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 09:35:56,430 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:35:56,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:35:56,431 INFO L85 PathProgramCache]: Analyzing trace with hash -650560017, now seen corresponding path program 1 times [2024-11-16 09:35:56,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:35:56,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79662461] [2024-11-16 09:35:56,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:35:56,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:35:56,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:35:56,569 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-16 09:35:56,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:35:56,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79662461] [2024-11-16 09:35:56,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79662461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:35:56,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:35:56,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 09:35:56,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678617726] [2024-11-16 09:35:56,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:35:56,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 09:35:56,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:35:56,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 09:35:56,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 09:35:56,572 INFO L87 Difference]: Start difference. First operand 1892 states and 2976 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-16 09:35:56,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:35:56,690 INFO L93 Difference]: Finished difference Result 3736 states and 5496 transitions. [2024-11-16 09:35:56,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 09:35:56,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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 58 [2024-11-16 09:35:56,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:35:56,700 INFO L225 Difference]: With dead ends: 3736 [2024-11-16 09:35:56,701 INFO L226 Difference]: Without dead ends: 3141 [2024-11-16 09:35:56,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-16 09:35:56,703 INFO L432 NwaCegarLoop]: 1556 mSDtfsCounter, 3054 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3054 SdHoareTripleChecker+Valid, 3168 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:35:56,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3054 Valid, 3168 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:35:56,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3141 states. [2024-11-16 09:35:56,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3141 to 2700. [2024-11-16 09:35:56,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2700 states, 2698 states have (on average 1.5063009636767977) internal successors, (4064), 2699 states have internal predecessors, (4064), 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-16 09:35:56,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2700 states to 2700 states and 4064 transitions. [2024-11-16 09:35:56,765 INFO L78 Accepts]: Start accepts. Automaton has 2700 states and 4064 transitions. Word has length 58 [2024-11-16 09:35:56,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:35:56,765 INFO L471 AbstractCegarLoop]: Abstraction has 2700 states and 4064 transitions. [2024-11-16 09:35:56,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-16 09:35:56,766 INFO L276 IsEmpty]: Start isEmpty. Operand 2700 states and 4064 transitions. [2024-11-16 09:35:56,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-16 09:35:56,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:35:56,767 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 09:35:56,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 09:35:56,767 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:35:56,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:35:56,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1441042735, now seen corresponding path program 1 times [2024-11-16 09:35:56,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:35:56,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979312803] [2024-11-16 09:35:56,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:35:56,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:35:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:35:56,854 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-16 09:35:56,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:35:56,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979312803] [2024-11-16 09:35:56,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979312803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:35:56,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:35:56,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 09:35:56,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91517901] [2024-11-16 09:35:56,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:35:56,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 09:35:56,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:35:56,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 09:35:56,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 09:35:56,857 INFO L87 Difference]: Start difference. First operand 2700 states and 4064 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:35:56,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:35:56,968 INFO L93 Difference]: Finished difference Result 4328 states and 6296 transitions. [2024-11-16 09:35:56,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 09:35:56,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-16 09:35:56,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:35:56,982 INFO L225 Difference]: With dead ends: 4328 [2024-11-16 09:35:56,982 INFO L226 Difference]: Without dead ends: 3733 [2024-11-16 09:35:56,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-16 09:35:56,985 INFO L432 NwaCegarLoop]: 1557 mSDtfsCounter, 3061 mSDsluCounter, 1621 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3061 SdHoareTripleChecker+Valid, 3178 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:35:56,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3061 Valid, 3178 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:35:56,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3733 states. [2024-11-16 09:35:57,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3733 to 3292. [2024-11-16 09:35:57,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3292 states, 3290 states have (on average 1.478419452887538) internal successors, (4864), 3291 states have internal predecessors, (4864), 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-16 09:35:57,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3292 states to 3292 states and 4864 transitions. [2024-11-16 09:35:57,066 INFO L78 Accepts]: Start accepts. Automaton has 3292 states and 4864 transitions. Word has length 58 [2024-11-16 09:35:57,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:35:57,066 INFO L471 AbstractCegarLoop]: Abstraction has 3292 states and 4864 transitions. [2024-11-16 09:35:57,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:35:57,067 INFO L276 IsEmpty]: Start isEmpty. Operand 3292 states and 4864 transitions. [2024-11-16 09:35:57,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-16 09:35:57,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:35:57,068 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 09:35:57,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 09:35:57,068 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:35:57,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:35:57,069 INFO L85 PathProgramCache]: Analyzing trace with hash 872851857, now seen corresponding path program 1 times [2024-11-16 09:35:57,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:35:57,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319034163] [2024-11-16 09:35:57,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:35:57,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:35:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:35:57,204 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:35:57,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:35:57,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319034163] [2024-11-16 09:35:57,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319034163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:35:57,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:35:57,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:35:57,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067685117] [2024-11-16 09:35:57,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:35:57,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:35:57,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:35:57,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:35:57,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:35:57,207 INFO L87 Difference]: Start difference. First operand 3292 states and 4864 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-16 09:35:57,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:35:57,261 INFO L93 Difference]: Finished difference Result 5806 states and 8264 transitions. [2024-11-16 09:35:57,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:35:57,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 60 [2024-11-16 09:35:57,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:35:57,272 INFO L225 Difference]: With dead ends: 5806 [2024-11-16 09:35:57,272 INFO L226 Difference]: Without dead ends: 3295 [2024-11-16 09:35:57,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:35:57,277 INFO L432 NwaCegarLoop]: 1533 mSDtfsCounter, 28 mSDsluCounter, 1501 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 3034 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:35:57,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 3034 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:35:57,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3295 states. [2024-11-16 09:35:57,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3295 to 3292. [2024-11-16 09:35:57,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3292 states, 3290 states have (on average 1.4632218844984803) internal successors, (4814), 3291 states have internal predecessors, (4814), 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-16 09:35:57,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3292 states to 3292 states and 4814 transitions. [2024-11-16 09:35:57,350 INFO L78 Accepts]: Start accepts. Automaton has 3292 states and 4814 transitions. Word has length 60 [2024-11-16 09:35:57,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:35:57,351 INFO L471 AbstractCegarLoop]: Abstraction has 3292 states and 4814 transitions. [2024-11-16 09:35:57,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-16 09:35:57,351 INFO L276 IsEmpty]: Start isEmpty. Operand 3292 states and 4814 transitions. [2024-11-16 09:35:57,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-16 09:35:57,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:35:57,352 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 09:35:57,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 09:35:57,352 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:35:57,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:35:57,353 INFO L85 PathProgramCache]: Analyzing trace with hash -128557871, now seen corresponding path program 1 times [2024-11-16 09:35:57,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:35:57,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561116131] [2024-11-16 09:35:57,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:35:57,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:35:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:35:57,429 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:35:57,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:35:57,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561116131] [2024-11-16 09:35:57,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561116131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:35:57,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:35:57,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:35:57,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204813753] [2024-11-16 09:35:57,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:35:57,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:35:57,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:35:57,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:35:57,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:35:57,431 INFO L87 Difference]: Start difference. First operand 3292 states and 4814 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-16 09:35:57,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:35:57,471 INFO L93 Difference]: Finished difference Result 4287 states and 6150 transitions. [2024-11-16 09:35:57,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:35:57,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 60 [2024-11-16 09:35:57,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:35:57,477 INFO L225 Difference]: With dead ends: 4287 [2024-11-16 09:35:57,478 INFO L226 Difference]: Without dead ends: 1776 [2024-11-16 09:35:57,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:35:57,481 INFO L432 NwaCegarLoop]: 1531 mSDtfsCounter, 24 mSDsluCounter, 1500 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 3031 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:35:57,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 3031 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:35:57,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2024-11-16 09:35:57,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1766. [2024-11-16 09:35:57,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1764 states have (on average 1.572562358276644) internal successors, (2774), 1765 states have internal predecessors, (2774), 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-16 09:35:57,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2774 transitions. [2024-11-16 09:35:57,522 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2774 transitions. Word has length 60 [2024-11-16 09:35:57,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:35:57,523 INFO L471 AbstractCegarLoop]: Abstraction has 1766 states and 2774 transitions. [2024-11-16 09:35:57,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-16 09:35:57,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2774 transitions. [2024-11-16 09:35:57,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-16 09:35:57,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:35:57,524 INFO L215 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] [2024-11-16 09:35:57,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 09:35:57,524 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:35:57,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:35:57,525 INFO L85 PathProgramCache]: Analyzing trace with hash 739804039, now seen corresponding path program 1 times [2024-11-16 09:35:57,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:35:57,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022361730] [2024-11-16 09:35:57,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:35:57,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:35:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:35:57,631 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-16 09:35:57,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:35:57,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022361730] [2024-11-16 09:35:57,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022361730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:35:57,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:35:57,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:35:57,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846315847] [2024-11-16 09:35:57,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:35:57,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 09:35:57,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:35:57,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 09:35:57,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 09:35:57,633 INFO L87 Difference]: Start difference. First operand 1766 states and 2774 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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-16 09:36:03,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:36:03,268 INFO L93 Difference]: Finished difference Result 4025 states and 7087 transitions. [2024-11-16 09:36:03,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 09:36:03,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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 62 [2024-11-16 09:36:03,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:36:03,279 INFO L225 Difference]: With dead ends: 4025 [2024-11-16 09:36:03,283 INFO L226 Difference]: Without dead ends: 3270 [2024-11-16 09:36:03,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 09:36:03,285 INFO L432 NwaCegarLoop]: 767 mSDtfsCounter, 2327 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 5518 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2327 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 6618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 5518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-11-16 09:36:03,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2327 Valid, 790 Invalid, 6618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 5518 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-11-16 09:36:03,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3270 states. [2024-11-16 09:36:03,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3270 to 3270. [2024-11-16 09:36:03,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3270 states, 3268 states have (on average 1.5) internal successors, (4902), 3269 states have internal predecessors, (4902), 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-16 09:36:03,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3270 states to 3270 states and 4902 transitions. [2024-11-16 09:36:03,353 INFO L78 Accepts]: Start accepts. Automaton has 3270 states and 4902 transitions. Word has length 62 [2024-11-16 09:36:03,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:36:03,354 INFO L471 AbstractCegarLoop]: Abstraction has 3270 states and 4902 transitions. [2024-11-16 09:36:03,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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-16 09:36:03,354 INFO L276 IsEmpty]: Start isEmpty. Operand 3270 states and 4902 transitions. [2024-11-16 09:36:03,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-16 09:36:03,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:36:03,355 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 09:36:03,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 09:36:03,355 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:36:03,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:36:03,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1679113773, now seen corresponding path program 1 times [2024-11-16 09:36:03,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:36:03,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380423852] [2024-11-16 09:36:03,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:36:03,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:36:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:36:03,469 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:36:03,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:36:03,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380423852] [2024-11-16 09:36:03,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380423852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:36:03,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:36:03,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:36:03,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191162773] [2024-11-16 09:36:03,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:36:03,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:36:03,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:36:03,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:36:03,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:36:03,474 INFO L87 Difference]: Start difference. First operand 3270 states and 4902 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-16 09:36:03,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:36:03,526 INFO L93 Difference]: Finished difference Result 3762 states and 5554 transitions. [2024-11-16 09:36:03,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:36:03,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 62 [2024-11-16 09:36:03,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:36:03,531 INFO L225 Difference]: With dead ends: 3762 [2024-11-16 09:36:03,532 INFO L226 Difference]: Without dead ends: 2787 [2024-11-16 09:36:03,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:36:03,534 INFO L432 NwaCegarLoop]: 1525 mSDtfsCounter, 22 mSDsluCounter, 1485 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 3010 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:36:03,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 3010 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:36:03,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2787 states. [2024-11-16 09:36:03,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2787 to 2784. [2024-11-16 09:36:03,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2784 states, 2782 states have (on average 1.52588066139468) internal successors, (4245), 2783 states have internal predecessors, (4245), 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-16 09:36:03,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2784 states to 2784 states and 4245 transitions. [2024-11-16 09:36:03,575 INFO L78 Accepts]: Start accepts. Automaton has 2784 states and 4245 transitions. Word has length 62 [2024-11-16 09:36:03,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:36:03,576 INFO L471 AbstractCegarLoop]: Abstraction has 2784 states and 4245 transitions. [2024-11-16 09:36:03,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-16 09:36:03,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 4245 transitions. [2024-11-16 09:36:03,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-16 09:36:03,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:36:03,577 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 09:36:03,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 09:36:03,577 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:36:03,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:36:03,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1606031738, now seen corresponding path program 1 times [2024-11-16 09:36:03,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:36:03,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766425789] [2024-11-16 09:36:03,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:36:03,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:36:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:36:03,957 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:36:03,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:36:03,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766425789] [2024-11-16 09:36:03,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766425789] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 09:36:03,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767456807] [2024-11-16 09:36:03,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:36:03,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:36:03,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:36:03,960 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 09:36:03,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 09:36:04,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:36:04,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-16 09:36:04,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 09:36:07,833 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:36:07,834 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 09:36:11,279 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:36:11,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767456807] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 09:36:11,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 09:36:11,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18, 20] total 42 [2024-11-16 09:36:11,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764710756] [2024-11-16 09:36:11,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 09:36:11,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-16 09:36:11,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:36:11,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-16 09:36:11,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=1425, Unknown=0, NotChecked=0, Total=1722 [2024-11-16 09:36:11,282 INFO L87 Difference]: Start difference. First operand 2784 states and 4245 transitions. Second operand has 42 states, 42 states have (on average 4.0476190476190474) internal successors, (170), 42 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-16 09:36:23,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:36:23,252 INFO L93 Difference]: Finished difference Result 7315 states and 10133 transitions. [2024-11-16 09:36:23,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-16 09:36:23,253 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 4.0476190476190474) internal successors, (170), 42 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 64 [2024-11-16 09:36:23,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:36:23,266 INFO L225 Difference]: With dead ends: 7315 [2024-11-16 09:36:23,266 INFO L226 Difference]: Without dead ends: 6826 [2024-11-16 09:36:23,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4365 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=3014, Invalid=10326, Unknown=0, NotChecked=0, Total=13340 [2024-11-16 09:36:23,273 INFO L432 NwaCegarLoop]: 1491 mSDtfsCounter, 18317 mSDsluCounter, 12430 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18317 SdHoareTripleChecker+Valid, 13921 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:36:23,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18317 Valid, 13921 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 09:36:23,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6826 states. [2024-11-16 09:36:23,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6826 to 4210. [2024-11-16 09:36:23,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4210 states, 4208 states have (on average 1.44462927756654) internal successors, (6079), 4209 states have internal predecessors, (6079), 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-16 09:36:23,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4210 states to 4210 states and 6079 transitions. [2024-11-16 09:36:23,393 INFO L78 Accepts]: Start accepts. Automaton has 4210 states and 6079 transitions. Word has length 64 [2024-11-16 09:36:23,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:36:23,394 INFO L471 AbstractCegarLoop]: Abstraction has 4210 states and 6079 transitions. [2024-11-16 09:36:23,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 4.0476190476190474) internal successors, (170), 42 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-16 09:36:23,394 INFO L276 IsEmpty]: Start isEmpty. Operand 4210 states and 6079 transitions. [2024-11-16 09:36:23,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-16 09:36:23,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:36:23,395 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 09:36:23,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 09:36:23,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-16 09:36:23,597 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:36:23,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:36:23,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1373592262, now seen corresponding path program 1 times [2024-11-16 09:36:23,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:36:23,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548908723] [2024-11-16 09:36:23,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:36:23,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:36:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:36:24,118 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:36:24,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:36:24,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548908723] [2024-11-16 09:36:24,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548908723] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 09:36:24,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965561876] [2024-11-16 09:36:24,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:36:24,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:36:24,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:36:24,121 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 09:36:24,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 09:36:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:36:24,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-16 09:36:24,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 09:36:27,172 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:36:27,172 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 09:36:29,025 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:36:29,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965561876] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 09:36:29,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 09:36:29,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18, 18] total 42 [2024-11-16 09:36:29,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131131224] [2024-11-16 09:36:29,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 09:36:29,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-16 09:36:29,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:36:29,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-16 09:36:29,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1528, Unknown=0, NotChecked=0, Total=1722 [2024-11-16 09:36:29,027 INFO L87 Difference]: Start difference. First operand 4210 states and 6079 transitions. Second operand has 42 states, 42 states have (on average 4.0) internal successors, (168), 42 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-16 09:36:52,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:36:52,725 INFO L93 Difference]: Finished difference Result 12188 states and 16478 transitions. [2024-11-16 09:36:52,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2024-11-16 09:36:52,726 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 4.0) internal successors, (168), 42 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 64 [2024-11-16 09:36:52,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:36:52,743 INFO L225 Difference]: With dead ends: 12188 [2024-11-16 09:36:52,743 INFO L226 Difference]: Without dead ends: 10273 [2024-11-16 09:36:52,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12297 ImplicationChecksByTransitivity, 22.6s TimeCoverageRelationStatistics Valid=5886, Invalid=26694, Unknown=0, NotChecked=0, Total=32580 [2024-11-16 09:36:52,755 INFO L432 NwaCegarLoop]: 1576 mSDtfsCounter, 23016 mSDsluCounter, 21778 mSDsCounter, 0 mSdLazyCounter, 2758 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23016 SdHoareTripleChecker+Valid, 23354 SdHoareTripleChecker+Invalid, 2880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 2758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:36:52,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23016 Valid, 23354 Invalid, 2880 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [122 Valid, 2758 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-16 09:36:52,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10273 states. [2024-11-16 09:36:53,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10273 to 7378. [2024-11-16 09:36:53,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7378 states, 7376 states have (on average 1.380558568329718) internal successors, (10183), 7377 states have internal predecessors, (10183), 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-16 09:36:53,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7378 states to 7378 states and 10183 transitions. [2024-11-16 09:36:53,111 INFO L78 Accepts]: Start accepts. Automaton has 7378 states and 10183 transitions. Word has length 64 [2024-11-16 09:36:53,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:36:53,111 INFO L471 AbstractCegarLoop]: Abstraction has 7378 states and 10183 transitions. [2024-11-16 09:36:53,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 4.0) internal successors, (168), 42 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-16 09:36:53,111 INFO L276 IsEmpty]: Start isEmpty. Operand 7378 states and 10183 transitions. [2024-11-16 09:36:53,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-16 09:36:53,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:36:53,112 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 09:36:53,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 09:36:53,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-16 09:36:53,317 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:36:53,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:36:53,317 INFO L85 PathProgramCache]: Analyzing trace with hash -2084636826, now seen corresponding path program 1 times [2024-11-16 09:36:53,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:36:53,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398614775] [2024-11-16 09:36:53,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:36:53,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:36:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:36:54,460 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:36:54,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:36:54,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398614775] [2024-11-16 09:36:54,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398614775] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 09:36:54,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186604883] [2024-11-16 09:36:54,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:36:54,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:36:54,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:36:54,463 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 09:36:54,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 09:36:54,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:36:54,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-16 09:36:54,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 09:36:54,786 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:36:54,786 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 09:36:54,986 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:36:54,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186604883] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 09:36:54,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 09:36:54,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 6] total 28 [2024-11-16 09:36:54,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362357563] [2024-11-16 09:36:54,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 09:36:54,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-16 09:36:54,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:36:54,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-16 09:36:54,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=674, Unknown=0, NotChecked=0, Total=756 [2024-11-16 09:36:54,988 INFO L87 Difference]: Start difference. First operand 7378 states and 10183 transitions. Second operand has 28 states, 28 states have (on average 6.607142857142857) internal successors, (185), 28 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)