./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_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 9ab20fd2c170582703dc94cfdcd8e10a79137aac9ab76b1936884b512261ae10 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 16:26:23,389 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 16:26:23,481 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 16:26:23,487 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 16:26:23,490 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 16:26:23,524 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 16:26:23,524 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 16:26:23,525 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 16:26:23,526 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 16:26:23,526 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 16:26:23,527 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 16:26:23,527 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 16:26:23,528 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 16:26:23,528 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 16:26:23,530 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 16:26:23,530 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 16:26:23,530 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 16:26:23,531 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 16:26:23,531 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 16:26:23,531 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 16:26:23,532 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 16:26:23,532 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 16:26:23,532 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 16:26:23,533 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 16:26:23,533 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 16:26:23,533 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 16:26:23,534 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 16:26:23,534 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 16:26:23,534 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 16:26:23,534 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 16:26:23,535 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 16:26:23,535 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 16:26:23,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:26:23,536 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 16:26:23,536 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 16:26:23,536 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 16:26:23,536 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 16:26:23,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 16:26:23,537 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 16:26:23,537 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 16:26:23,537 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 16:26:23,538 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 16:26:23,538 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 -> 9ab20fd2c170582703dc94cfdcd8e10a79137aac9ab76b1936884b512261ae10 [2024-10-12 16:26:23,792 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 16:26:23,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 16:26:23,822 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 16:26:23,823 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 16:26:23,824 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 16:26:23,825 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label05.c [2024-10-12 16:26:25,352 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 16:26:25,787 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 16:26:25,789 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label05.c [2024-10-12 16:26:25,817 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ca1822ca/721ad80dfece4700863c81779fda5058/FLAG4906afe78 [2024-10-12 16:26:25,923 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ca1822ca/721ad80dfece4700863c81779fda5058 [2024-10-12 16:26:25,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 16:26:25,926 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 16:26:25,927 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 16:26:25,927 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 16:26:25,933 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 16:26:25,934 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:26:25" (1/1) ... [2024-10-12 16:26:25,934 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f143469 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:25, skipping insertion in model container [2024-10-12 16:26:25,934 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:26:25" (1/1) ... [2024-10-12 16:26:26,011 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 16:26:26,363 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label05.c[9078,9091] [2024-10-12 16:26:26,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:26:26,923 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 16:26:26,983 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label05.c[9078,9091] [2024-10-12 16:26:27,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:26:27,269 INFO L204 MainTranslator]: Completed translation [2024-10-12 16:26:27,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:27 WrapperNode [2024-10-12 16:26:27,269 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 16:26:27,271 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 16:26:27,271 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 16:26:27,271 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 16:26:27,279 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:27" (1/1) ... [2024-10-12 16:26:27,336 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:27" (1/1) ... [2024-10-12 16:26:27,575 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2613 [2024-10-12 16:26:27,576 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 16:26:27,577 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 16:26:27,577 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 16:26:27,577 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 16:26:27,589 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:27" (1/1) ... [2024-10-12 16:26:27,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:27" (1/1) ... [2024-10-12 16:26:27,707 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:27" (1/1) ... [2024-10-12 16:26:27,828 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-10-12 16:26:27,829 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:27" (1/1) ... [2024-10-12 16:26:27,830 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:27" (1/1) ... [2024-10-12 16:26:27,929 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:27" (1/1) ... [2024-10-12 16:26:27,957 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:27" (1/1) ... [2024-10-12 16:26:28,004 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:27" (1/1) ... [2024-10-12 16:26:28,021 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:27" (1/1) ... [2024-10-12 16:26:28,082 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 16:26:28,085 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 16:26:28,085 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 16:26:28,085 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 16:26:28,086 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:27" (1/1) ... [2024-10-12 16:26:28,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:26:28,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:26:28,123 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-10-12 16:26:28,126 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-10-12 16:26:28,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 16:26:28,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 16:26:28,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 16:26:28,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 16:26:28,251 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 16:26:28,253 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 16:26:31,467 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2024-10-12 16:26:31,468 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 16:26:31,536 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 16:26:31,540 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 16:26:31,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:26:31 BoogieIcfgContainer [2024-10-12 16:26:31,541 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 16:26:31,543 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 16:26:31,543 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 16:26:31,547 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 16:26:31,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 04:26:25" (1/3) ... [2024-10-12 16:26:31,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55dbbe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:26:31, skipping insertion in model container [2024-10-12 16:26:31,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:26:27" (2/3) ... [2024-10-12 16:26:31,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55dbbe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:26:31, skipping insertion in model container [2024-10-12 16:26:31,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:26:31" (3/3) ... [2024-10-12 16:26:31,552 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label05.c [2024-10-12 16:26:31,569 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 16:26:31,570 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 16:26:31,655 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 16:26:31,664 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;@1a18770f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 16:26:31,664 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 16:26:31,671 INFO L276 IsEmpty]: Start isEmpty. Operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 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-10-12 16:26:31,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 16:26:31,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:26:31,683 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] [2024-10-12 16:26:31,684 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:26:31,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:26:31,690 INFO L85 PathProgramCache]: Analyzing trace with hash -2112828373, now seen corresponding path program 1 times [2024-10-12 16:26:31,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:26:31,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648101456] [2024-10-12 16:26:31,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:31,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:26:31,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:31,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:26:31,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:26:31,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648101456] [2024-10-12 16:26:31,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648101456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:26:31,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:26:31,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:26:31,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683593397] [2024-10-12 16:26:31,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:26:31,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 16:26:31,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:26:31,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 16:26:31,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 16:26:31,976 INFO L87 Difference]: Start difference. First operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 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 30.0) internal successors, (60), 2 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-10-12 16:26:32,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:26:32,078 INFO L93 Difference]: Finished difference Result 1055 states and 1999 transitions. [2024-10-12 16:26:32,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 16:26:32,085 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 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-10-12 16:26:32,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:26:32,107 INFO L225 Difference]: With dead ends: 1055 [2024-10-12 16:26:32,108 INFO L226 Difference]: Without dead ends: 526 [2024-10-12 16:26:32,113 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-10-12 16:26:32,119 INFO L432 NwaCegarLoop]: 935 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:26:32,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 935 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 16:26:32,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-10-12 16:26:32,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2024-10-12 16:26:32,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.7809523809523808) internal successors, (935), 525 states have internal predecessors, (935), 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-10-12 16:26:32,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 935 transitions. [2024-10-12 16:26:32,214 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 935 transitions. Word has length 60 [2024-10-12 16:26:32,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:26:32,215 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 935 transitions. [2024-10-12 16:26:32,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 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-10-12 16:26:32,216 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 935 transitions. [2024-10-12 16:26:32,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 16:26:32,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:26:32,218 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] [2024-10-12 16:26:32,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 16:26:32,219 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:26:32,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:26:32,220 INFO L85 PathProgramCache]: Analyzing trace with hash 907783361, now seen corresponding path program 1 times [2024-10-12 16:26:32,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:26:32,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387947639] [2024-10-12 16:26:32,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:32,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:26:32,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:32,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:26:32,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:26:32,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387947639] [2024-10-12 16:26:32,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387947639] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:26:32,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:26:32,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:26:32,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406337368] [2024-10-12 16:26:32,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:26:32,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:26:32,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:26:32,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:26:32,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:26:32,494 INFO L87 Difference]: Start difference. First operand 526 states and 935 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 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-10-12 16:26:34,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:26:34,788 INFO L93 Difference]: Finished difference Result 1499 states and 2693 transitions. [2024-10-12 16:26:34,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:26:34,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 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-10-12 16:26:34,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:26:34,795 INFO L225 Difference]: With dead ends: 1499 [2024-10-12 16:26:34,795 INFO L226 Difference]: Without dead ends: 974 [2024-10-12 16:26:34,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-12 16:26:34,798 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 413 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:26:34,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 495 Invalid, 1666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-12 16:26:34,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2024-10-12 16:26:34,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 971. [2024-10-12 16:26:34,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.5082474226804123) internal successors, (1463), 970 states have internal predecessors, (1463), 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-10-12 16:26:34,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1463 transitions. [2024-10-12 16:26:34,836 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1463 transitions. Word has length 60 [2024-10-12 16:26:34,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:26:34,837 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1463 transitions. [2024-10-12 16:26:34,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 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-10-12 16:26:34,838 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1463 transitions. [2024-10-12 16:26:34,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-12 16:26:34,843 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:26:34,843 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:26:34,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 16:26:34,843 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:26:34,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:26:34,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1335601236, now seen corresponding path program 1 times [2024-10-12 16:26:34,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:26:34,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961321178] [2024-10-12 16:26:34,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:34,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:26:34,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:35,197 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:26:35,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:26:35,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961321178] [2024-10-12 16:26:35,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961321178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:26:35,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:26:35,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:26:35,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929618556] [2024-10-12 16:26:35,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:26:35,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:26:35,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:26:35,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:26:35,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:26:35,202 INFO L87 Difference]: Start difference. First operand 971 states and 1463 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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-10-12 16:26:37,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:26:37,517 INFO L93 Difference]: Finished difference Result 2813 states and 4241 transitions. [2024-10-12 16:26:37,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:26:37,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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 130 [2024-10-12 16:26:37,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:26:37,525 INFO L225 Difference]: With dead ends: 2813 [2024-10-12 16:26:37,525 INFO L226 Difference]: Without dead ends: 1843 [2024-10-12 16:26:37,527 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-10-12 16:26:37,528 INFO L432 NwaCegarLoop]: 851 mSDtfsCounter, 430 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 1698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:26:37,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 918 Invalid, 1698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-12 16:26:37,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2024-10-12 16:26:37,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1841. [2024-10-12 16:26:37,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1840 states have (on average 1.3603260869565217) internal successors, (2503), 1840 states have internal predecessors, (2503), 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-10-12 16:26:37,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2503 transitions. [2024-10-12 16:26:37,570 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2503 transitions. Word has length 130 [2024-10-12 16:26:37,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:26:37,572 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2503 transitions. [2024-10-12 16:26:37,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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-10-12 16:26:37,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2503 transitions. [2024-10-12 16:26:37,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-12 16:26:37,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:26:37,585 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-12 16:26:37,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 16:26:37,586 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:26:37,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:26:37,587 INFO L85 PathProgramCache]: Analyzing trace with hash -140049903, now seen corresponding path program 1 times [2024-10-12 16:26:37,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:26:37,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969253275] [2024-10-12 16:26:37,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:37,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:26:37,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:37,763 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:26:37,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:26:37,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969253275] [2024-10-12 16:26:37,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969253275] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:26:37,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:26:37,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:26:37,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183262347] [2024-10-12 16:26:37,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:26:37,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:26:37,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:26:37,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:26:37,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:26:37,767 INFO L87 Difference]: Start difference. First operand 1841 states and 2503 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 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-10-12 16:26:39,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:26:39,746 INFO L93 Difference]: Finished difference Result 5394 states and 7325 transitions. [2024-10-12 16:26:39,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:26:39,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 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 152 [2024-10-12 16:26:39,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:26:39,757 INFO L225 Difference]: With dead ends: 5394 [2024-10-12 16:26:39,758 INFO L226 Difference]: Without dead ends: 2700 [2024-10-12 16:26:39,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-12 16:26:39,763 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 368 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-12 16:26:39,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 589 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-12 16:26:39,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states. [2024-10-12 16:26:39,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 2700. [2024-10-12 16:26:39,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2700 states, 2699 states have (on average 1.1919229344201556) internal successors, (3217), 2699 states have internal predecessors, (3217), 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-10-12 16:26:39,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2700 states to 2700 states and 3217 transitions. [2024-10-12 16:26:39,814 INFO L78 Accepts]: Start accepts. Automaton has 2700 states and 3217 transitions. Word has length 152 [2024-10-12 16:26:39,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:26:39,816 INFO L471 AbstractCegarLoop]: Abstraction has 2700 states and 3217 transitions. [2024-10-12 16:26:39,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 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-10-12 16:26:39,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2700 states and 3217 transitions. [2024-10-12 16:26:39,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-10-12 16:26:39,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:26:39,820 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 16:26:39,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 16:26:39,820 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:26:39,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:26:39,821 INFO L85 PathProgramCache]: Analyzing trace with hash 930822622, now seen corresponding path program 1 times [2024-10-12 16:26:39,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:26:39,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366585119] [2024-10-12 16:26:39,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:39,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:26:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:40,093 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:26:40,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:26:40,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366585119] [2024-10-12 16:26:40,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366585119] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:26:40,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:26:40,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:26:40,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029176295] [2024-10-12 16:26:40,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:26:40,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:26:40,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:26:40,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:26:40,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:26:40,099 INFO L87 Difference]: Start difference. First operand 2700 states and 3217 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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-10-12 16:26:41,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:26:41,697 INFO L93 Difference]: Finished difference Result 7107 states and 8597 transitions. [2024-10-12 16:26:41,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:26:41,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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 212 [2024-10-12 16:26:41,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:26:41,713 INFO L225 Difference]: With dead ends: 7107 [2024-10-12 16:26:41,714 INFO L226 Difference]: Without dead ends: 4408 [2024-10-12 16:26:41,718 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-10-12 16:26:41,719 INFO L432 NwaCegarLoop]: 724 mSDtfsCounter, 496 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 1443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:26:41,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 781 Invalid, 1443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 16:26:41,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4408 states. [2024-10-12 16:26:41,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4408 to 4408. [2024-10-12 16:26:41,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4408 states, 4407 states have (on average 1.1706376219650556) internal successors, (5159), 4407 states have internal predecessors, (5159), 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-10-12 16:26:41,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4408 states to 4408 states and 5159 transitions. [2024-10-12 16:26:41,794 INFO L78 Accepts]: Start accepts. Automaton has 4408 states and 5159 transitions. Word has length 212 [2024-10-12 16:26:41,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:26:41,795 INFO L471 AbstractCegarLoop]: Abstraction has 4408 states and 5159 transitions. [2024-10-12 16:26:41,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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-10-12 16:26:41,796 INFO L276 IsEmpty]: Start isEmpty. Operand 4408 states and 5159 transitions. [2024-10-12 16:26:41,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-12 16:26:41,801 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:26:41,801 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2024-10-12 16:26:41,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 16:26:41,801 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:26:41,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:26:41,802 INFO L85 PathProgramCache]: Analyzing trace with hash 190720835, now seen corresponding path program 1 times [2024-10-12 16:26:41,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:26:41,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350069075] [2024-10-12 16:26:41,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:41,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:26:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:42,017 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-12 16:26:42,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:26:42,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350069075] [2024-10-12 16:26:42,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350069075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:26:42,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:26:42,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:26:42,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917200964] [2024-10-12 16:26:42,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:26:42,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:26:42,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:26:42,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:26:42,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:26:42,021 INFO L87 Difference]: Start difference. First operand 4408 states and 5159 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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-10-12 16:26:43,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:26:43,742 INFO L93 Difference]: Finished difference Result 10935 states and 12969 transitions. [2024-10-12 16:26:43,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:26:43,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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 214 [2024-10-12 16:26:43,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:26:43,767 INFO L225 Difference]: With dead ends: 10935 [2024-10-12 16:26:43,767 INFO L226 Difference]: Without dead ends: 6527 [2024-10-12 16:26:43,774 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-10-12 16:26:43,775 INFO L432 NwaCegarLoop]: 380 mSDtfsCounter, 389 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 1490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:26:43,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 442 Invalid, 1490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1216 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 16:26:43,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6527 states. [2024-10-12 16:26:43,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6527 to 4381. [2024-10-12 16:26:43,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4381 states, 4380 states have (on average 1.1684931506849314) internal successors, (5118), 4380 states have internal predecessors, (5118), 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-10-12 16:26:43,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4381 states to 4381 states and 5118 transitions. [2024-10-12 16:26:43,886 INFO L78 Accepts]: Start accepts. Automaton has 4381 states and 5118 transitions. Word has length 214 [2024-10-12 16:26:43,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:26:43,888 INFO L471 AbstractCegarLoop]: Abstraction has 4381 states and 5118 transitions. [2024-10-12 16:26:43,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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-10-12 16:26:43,889 INFO L276 IsEmpty]: Start isEmpty. Operand 4381 states and 5118 transitions. [2024-10-12 16:26:43,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-10-12 16:26:43,893 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:26:43,894 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:26:43,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 16:26:43,894 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:26:43,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:26:43,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1214414397, now seen corresponding path program 1 times [2024-10-12 16:26:43,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:26:43,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309098493] [2024-10-12 16:26:43,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:43,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:26:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:44,179 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-12 16:26:44,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:26:44,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309098493] [2024-10-12 16:26:44,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309098493] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:26:44,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:26:44,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:26:44,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983919279] [2024-10-12 16:26:44,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:26:44,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:26:44,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:26:44,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:26:44,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:26:44,182 INFO L87 Difference]: Start difference. First operand 4381 states and 5118 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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-10-12 16:26:45,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:26:45,822 INFO L93 Difference]: Finished difference Result 10044 states and 11705 transitions. [2024-10-12 16:26:45,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:26:45,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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 280 [2024-10-12 16:26:45,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:26:45,837 INFO L225 Difference]: With dead ends: 10044 [2024-10-12 16:26:45,838 INFO L226 Difference]: Without dead ends: 5664 [2024-10-12 16:26:45,844 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-10-12 16:26:45,845 INFO L432 NwaCegarLoop]: 831 mSDtfsCounter, 375 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 1410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:26:45,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 891 Invalid, 1410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 16:26:45,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5664 states. [2024-10-12 16:26:45,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5664 to 5233. [2024-10-12 16:26:45,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5233 states, 5232 states have (on average 1.1588302752293578) internal successors, (6063), 5232 states have internal predecessors, (6063), 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-10-12 16:26:45,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5233 states to 5233 states and 6063 transitions. [2024-10-12 16:26:45,982 INFO L78 Accepts]: Start accepts. Automaton has 5233 states and 6063 transitions. Word has length 280 [2024-10-12 16:26:45,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:26:45,983 INFO L471 AbstractCegarLoop]: Abstraction has 5233 states and 6063 transitions. [2024-10-12 16:26:45,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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-10-12 16:26:45,983 INFO L276 IsEmpty]: Start isEmpty. Operand 5233 states and 6063 transitions. [2024-10-12 16:26:45,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-10-12 16:26:45,988 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:26:45,988 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:26:45,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 16:26:45,988 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:26:45,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:26:45,989 INFO L85 PathProgramCache]: Analyzing trace with hash 415956001, now seen corresponding path program 1 times [2024-10-12 16:26:45,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:26:45,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113366785] [2024-10-12 16:26:45,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:45,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:26:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:46,265 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 309 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-12 16:26:46,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:26:46,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113366785] [2024-10-12 16:26:46,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113366785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:26:46,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:26:46,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:26:46,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475576637] [2024-10-12 16:26:46,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:26:46,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:26:46,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:26:46,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:26:46,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:26:46,269 INFO L87 Difference]: Start difference. First operand 5233 states and 6063 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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-10-12 16:26:48,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:26:48,079 INFO L93 Difference]: Finished difference Result 13048 states and 15221 transitions. [2024-10-12 16:26:48,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:26:48,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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 292 [2024-10-12 16:26:48,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:26:48,100 INFO L225 Difference]: With dead ends: 13048 [2024-10-12 16:26:48,101 INFO L226 Difference]: Without dead ends: 7388 [2024-10-12 16:26:48,107 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-10-12 16:26:48,108 INFO L432 NwaCegarLoop]: 583 mSDtfsCounter, 495 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 1589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:26:48,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 625 Invalid, 1589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 16:26:48,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7388 states. [2024-10-12 16:26:48,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7388 to 6958. [2024-10-12 16:26:48,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6958 states, 6957 states have (on average 1.1637199942503953) internal successors, (8096), 6957 states have internal predecessors, (8096), 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-10-12 16:26:48,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6958 states to 6958 states and 8096 transitions. [2024-10-12 16:26:48,231 INFO L78 Accepts]: Start accepts. Automaton has 6958 states and 8096 transitions. Word has length 292 [2024-10-12 16:26:48,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:26:48,231 INFO L471 AbstractCegarLoop]: Abstraction has 6958 states and 8096 transitions. [2024-10-12 16:26:48,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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-10-12 16:26:48,232 INFO L276 IsEmpty]: Start isEmpty. Operand 6958 states and 8096 transitions. [2024-10-12 16:26:48,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2024-10-12 16:26:48,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:26:48,240 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:26:48,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 16:26:48,240 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:26:48,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:26:48,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1710105074, now seen corresponding path program 1 times [2024-10-12 16:26:48,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:26:48,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109000304] [2024-10-12 16:26:48,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:48,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:26:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:48,467 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-12 16:26:48,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:26:48,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109000304] [2024-10-12 16:26:48,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109000304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:26:48,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:26:48,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:26:48,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408920131] [2024-10-12 16:26:48,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:26:48,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:26:48,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:26:48,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:26:48,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:26:48,470 INFO L87 Difference]: Start difference. First operand 6958 states and 8096 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:49,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:26:49,990 INFO L93 Difference]: Finished difference Result 17315 states and 20392 transitions. [2024-10-12 16:26:49,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:26:49,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 297 [2024-10-12 16:26:49,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:26:50,010 INFO L225 Difference]: With dead ends: 17315 [2024-10-12 16:26:50,011 INFO L226 Difference]: Without dead ends: 10358 [2024-10-12 16:26:50,018 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-10-12 16:26:50,018 INFO L432 NwaCegarLoop]: 772 mSDtfsCounter, 379 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:26:50,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 838 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 16:26:50,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10358 states. [2024-10-12 16:26:50,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10358 to 9508. [2024-10-12 16:26:50,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9508 states, 9507 states have (on average 1.1414747028505312) internal successors, (10852), 9507 states have internal predecessors, (10852), 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-10-12 16:26:50,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9508 states to 9508 states and 10852 transitions. [2024-10-12 16:26:50,170 INFO L78 Accepts]: Start accepts. Automaton has 9508 states and 10852 transitions. Word has length 297 [2024-10-12 16:26:50,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:26:50,171 INFO L471 AbstractCegarLoop]: Abstraction has 9508 states and 10852 transitions. [2024-10-12 16:26:50,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:26:50,172 INFO L276 IsEmpty]: Start isEmpty. Operand 9508 states and 10852 transitions. [2024-10-12 16:26:50,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2024-10-12 16:26:50,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:26:50,178 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2024-10-12 16:26:50,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 16:26:50,178 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:26:50,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:26:50,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1881496932, now seen corresponding path program 1 times [2024-10-12 16:26:50,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:26:50,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911509342] [2024-10-12 16:26:50,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:50,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:26:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:50,442 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 309 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-12 16:26:50,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:26:50,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911509342] [2024-10-12 16:26:50,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911509342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:26:50,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:26:50,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:26:50,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661187297] [2024-10-12 16:26:50,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:26:50,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:26:50,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:26:50,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:26:50,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:26:50,444 INFO L87 Difference]: Start difference. First operand 9508 states and 10852 transitions. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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-10-12 16:26:52,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:26:52,084 INFO L93 Difference]: Finished difference Result 22431 states and 25677 transitions. [2024-10-12 16:26:52,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:26:52,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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 315 [2024-10-12 16:26:52,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:26:52,108 INFO L225 Difference]: With dead ends: 22431 [2024-10-12 16:26:52,108 INFO L226 Difference]: Without dead ends: 12492 [2024-10-12 16:26:52,119 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-10-12 16:26:52,120 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 443 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:26:52,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 292 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 16:26:52,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12492 states. [2024-10-12 16:26:52,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12492 to 11636. [2024-10-12 16:26:52,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11636 states, 11635 states have (on average 1.147314138375591) internal successors, (13349), 11635 states have internal predecessors, (13349), 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-10-12 16:26:52,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11636 states to 11636 states and 13349 transitions. [2024-10-12 16:26:52,284 INFO L78 Accepts]: Start accepts. Automaton has 11636 states and 13349 transitions. Word has length 315 [2024-10-12 16:26:52,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:26:52,284 INFO L471 AbstractCegarLoop]: Abstraction has 11636 states and 13349 transitions. [2024-10-12 16:26:52,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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-10-12 16:26:52,285 INFO L276 IsEmpty]: Start isEmpty. Operand 11636 states and 13349 transitions. [2024-10-12 16:26:52,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2024-10-12 16:26:52,291 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:26:52,291 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 16:26:52,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 16:26:52,291 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:26:52,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:26:52,292 INFO L85 PathProgramCache]: Analyzing trace with hash 379211863, now seen corresponding path program 1 times [2024-10-12 16:26:52,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:26:52,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424773485] [2024-10-12 16:26:52,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:52,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:26:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:52,711 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-12 16:26:52,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:26:52,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424773485] [2024-10-12 16:26:52,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424773485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:26:52,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:26:52,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 16:26:52,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914847171] [2024-10-12 16:26:52,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:26:52,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:26:52,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:26:52,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:26:52,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:26:52,714 INFO L87 Difference]: Start difference. First operand 11636 states and 13349 transitions. Second operand has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 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-10-12 16:26:55,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:26:55,642 INFO L93 Difference]: Finished difference Result 41233 states and 47494 transitions. [2024-10-12 16:26:55,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:26:55,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 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 320 [2024-10-12 16:26:55,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:26:55,696 INFO L225 Difference]: With dead ends: 41233 [2024-10-12 16:26:55,696 INFO L226 Difference]: Without dead ends: 28317 [2024-10-12 16:26:55,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:26:55,715 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 855 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 2795 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 3239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 2795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:26:55,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [855 Valid, 333 Invalid, 3239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 2795 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-12 16:26:55,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28317 states. [2024-10-12 16:26:56,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28317 to 27840. [2024-10-12 16:26:56,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27840 states, 27839 states have (on average 1.1353137684543266) internal successors, (31606), 27839 states have internal predecessors, (31606), 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-10-12 16:26:56,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27840 states to 27840 states and 31606 transitions. [2024-10-12 16:26:56,076 INFO L78 Accepts]: Start accepts. Automaton has 27840 states and 31606 transitions. Word has length 320 [2024-10-12 16:26:56,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:26:56,076 INFO L471 AbstractCegarLoop]: Abstraction has 27840 states and 31606 transitions. [2024-10-12 16:26:56,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 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-10-12 16:26:56,077 INFO L276 IsEmpty]: Start isEmpty. Operand 27840 states and 31606 transitions. [2024-10-12 16:26:56,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2024-10-12 16:26:56,084 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:26:56,085 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 16:26:56,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 16:26:56,086 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:26:56,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:26:56,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1394076424, now seen corresponding path program 1 times [2024-10-12 16:26:56,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:26:56,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774260042] [2024-10-12 16:26:56,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:56,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:26:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:56,493 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-12 16:26:56,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:26:56,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774260042] [2024-10-12 16:26:56,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774260042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:26:56,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:26:56,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:26:56,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307872297] [2024-10-12 16:26:56,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:26:56,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:26:56,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:26:56,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:26:56,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:26:56,497 INFO L87 Difference]: Start difference. First operand 27840 states and 31606 transitions. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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-10-12 16:26:58,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:26:58,168 INFO L93 Difference]: Finished difference Result 68899 states and 78509 transitions. [2024-10-12 16:26:58,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:26:58,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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 349 [2024-10-12 16:26:58,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:26:58,228 INFO L225 Difference]: With dead ends: 68899 [2024-10-12 16:26:58,228 INFO L226 Difference]: Without dead ends: 40631 [2024-10-12 16:26:58,256 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-10-12 16:26:58,257 INFO L432 NwaCegarLoop]: 362 mSDtfsCounter, 422 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1299 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 1299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:26:58,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 424 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 1299 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 16:26:58,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40631 states. [2024-10-12 16:26:58,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40631 to 38900. [2024-10-12 16:26:58,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38900 states, 38899 states have (on average 1.1130106172395178) internal successors, (43295), 38899 states have internal predecessors, (43295), 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-10-12 16:26:58,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38900 states to 38900 states and 43295 transitions. [2024-10-12 16:26:58,918 INFO L78 Accepts]: Start accepts. Automaton has 38900 states and 43295 transitions. Word has length 349 [2024-10-12 16:26:58,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:26:58,919 INFO L471 AbstractCegarLoop]: Abstraction has 38900 states and 43295 transitions. [2024-10-12 16:26:58,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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-10-12 16:26:58,919 INFO L276 IsEmpty]: Start isEmpty. Operand 38900 states and 43295 transitions. [2024-10-12 16:26:58,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2024-10-12 16:26:58,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:26:58,928 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:26:58,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 16:26:58,929 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:26:58,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:26:58,929 INFO L85 PathProgramCache]: Analyzing trace with hash -390231129, now seen corresponding path program 1 times [2024-10-12 16:26:58,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:26:58,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699387276] [2024-10-12 16:26:58,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:58,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:26:58,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:59,743 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 340 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:26:59,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:26:59,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699387276] [2024-10-12 16:26:59,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699387276] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:26:59,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647974539] [2024-10-12 16:26:59,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:26:59,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:26:59,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:26:59,747 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-10-12 16:26:59,748 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-10-12 16:26:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:26:59,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 16:26:59,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:27:00,594 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 304 proven. 82 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-10-12 16:27:00,594 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 16:27:01,879 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 304 proven. 82 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-10-12 16:27:01,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647974539] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 16:27:01,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 16:27:01,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2024-10-12 16:27:01,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249826386] [2024-10-12 16:27:01,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 16:27:01,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 16:27:01,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:27:01,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 16:27:01,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-12 16:27:01,884 INFO L87 Difference]: Start difference. First operand 38900 states and 43295 transitions. Second operand has 9 states, 9 states have (on average 93.22222222222223) internal successors, (839), 9 states have internal predecessors, (839), 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-10-12 16:27:13,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:27:13,453 INFO L93 Difference]: Finished difference Result 152361 states and 169505 transitions. [2024-10-12 16:27:13,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-12 16:27:13,454 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 93.22222222222223) internal successors, (839), 9 states have internal predecessors, (839), 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 355 [2024-10-12 16:27:13,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:27:13,619 INFO L225 Difference]: With dead ends: 152361 [2024-10-12 16:27:13,619 INFO L226 Difference]: Without dead ends: 109201 [2024-10-12 16:27:13,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 741 GetRequests, 720 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=353, Unknown=0, NotChecked=0, Total=506 [2024-10-12 16:27:13,648 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 10079 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 12777 mSolverCounterSat, 2189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10079 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 14966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2189 IncrementalHoareTripleChecker+Valid, 12777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:27:13,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10079 Valid, 583 Invalid, 14966 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2189 Valid, 12777 Invalid, 0 Unknown, 0 Unchecked, 10.5s Time] [2024-10-12 16:27:13,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109201 states. [2024-10-12 16:27:14,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109201 to 84883. [2024-10-12 16:27:14,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84883 states, 84882 states have (on average 1.1077967060154097) internal successors, (94032), 84882 states have internal predecessors, (94032), 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-10-12 16:27:14,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84883 states to 84883 states and 94032 transitions. [2024-10-12 16:27:14,688 INFO L78 Accepts]: Start accepts. Automaton has 84883 states and 94032 transitions. Word has length 355 [2024-10-12 16:27:14,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:27:14,688 INFO L471 AbstractCegarLoop]: Abstraction has 84883 states and 94032 transitions. [2024-10-12 16:27:14,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 93.22222222222223) internal successors, (839), 9 states have internal predecessors, (839), 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-10-12 16:27:14,689 INFO L276 IsEmpty]: Start isEmpty. Operand 84883 states and 94032 transitions. [2024-10-12 16:27:14,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2024-10-12 16:27:14,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:27:14,696 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-12 16:27:14,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 16:27:14,900 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,SelfDestructingSolverStorable12 [2024-10-12 16:27:14,901 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:27:14,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:27:14,902 INFO L85 PathProgramCache]: Analyzing trace with hash -771600700, now seen corresponding path program 1 times [2024-10-12 16:27:14,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:27:14,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871036156] [2024-10-12 16:27:14,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:27:14,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:27:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:27:15,948 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-10-12 16:27:15,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:27:15,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871036156] [2024-10-12 16:27:15,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871036156] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:27:15,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:27:15,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:27:15,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114011589] [2024-10-12 16:27:15,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:27:15,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:27:15,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:27:15,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:27:15,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:27:15,951 INFO L87 Difference]: Start difference. First operand 84883 states and 94032 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 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-10-12 16:27:18,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:27:18,306 INFO L93 Difference]: Finished difference Result 184277 states and 204050 transitions. [2024-10-12 16:27:18,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:27:18,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 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 407 [2024-10-12 16:27:18,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:27:18,431 INFO L225 Difference]: With dead ends: 184277 [2024-10-12 16:27:18,431 INFO L226 Difference]: Without dead ends: 99395 [2024-10-12 16:27:18,476 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-10-12 16:27:18,477 INFO L432 NwaCegarLoop]: 778 mSDtfsCounter, 404 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1434 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 1521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-12 16:27:18,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 832 Invalid, 1521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1434 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-12 16:27:18,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99395 states. [2024-10-12 16:27:19,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99395 to 94670. [2024-10-12 16:27:19,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94670 states, 94669 states have (on average 1.1042368674011556) internal successors, (104537), 94669 states have internal predecessors, (104537), 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-10-12 16:27:20,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94670 states to 94670 states and 104537 transitions. [2024-10-12 16:27:20,138 INFO L78 Accepts]: Start accepts. Automaton has 94670 states and 104537 transitions. Word has length 407 [2024-10-12 16:27:20,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:27:20,139 INFO L471 AbstractCegarLoop]: Abstraction has 94670 states and 104537 transitions. [2024-10-12 16:27:20,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 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-10-12 16:27:20,139 INFO L276 IsEmpty]: Start isEmpty. Operand 94670 states and 104537 transitions. [2024-10-12 16:27:20,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2024-10-12 16:27:20,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:27:20,151 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 16:27:20,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 16:27:20,151 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:27:20,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:27:20,152 INFO L85 PathProgramCache]: Analyzing trace with hash 659812379, now seen corresponding path program 1 times [2024-10-12 16:27:20,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:27:20,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519107616] [2024-10-12 16:27:20,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:27:20,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:27:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:27:20,686 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-10-12 16:27:20,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:27:20,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519107616] [2024-10-12 16:27:20,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519107616] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:27:20,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:27:20,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:27:20,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361547618] [2024-10-12 16:27:20,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:27:20,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:27:20,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:27:20,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:27:20,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:27:20,691 INFO L87 Difference]: Start difference. First operand 94670 states and 104537 transitions. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 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-10-12 16:27:22,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:27:22,668 INFO L93 Difference]: Finished difference Result 185499 states and 204811 transitions. [2024-10-12 16:27:22,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:27:22,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 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 429 [2024-10-12 16:27:22,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:27:22,772 INFO L225 Difference]: With dead ends: 185499 [2024-10-12 16:27:22,773 INFO L226 Difference]: Without dead ends: 91254 [2024-10-12 16:27:22,803 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-10-12 16:27:22,803 INFO L432 NwaCegarLoop]: 655 mSDtfsCounter, 440 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 1321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:27:22,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 717 Invalid, 1321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 16:27:22,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91254 states. [2024-10-12 16:27:23,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91254 to 89123. [2024-10-12 16:27:23,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89123 states, 89122 states have (on average 1.0789591795516258) internal successors, (96159), 89122 states have internal predecessors, (96159), 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-10-12 16:27:24,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89123 states to 89123 states and 96159 transitions. [2024-10-12 16:27:24,279 INFO L78 Accepts]: Start accepts. Automaton has 89123 states and 96159 transitions. Word has length 429 [2024-10-12 16:27:24,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:27:24,279 INFO L471 AbstractCegarLoop]: Abstraction has 89123 states and 96159 transitions. [2024-10-12 16:27:24,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 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-10-12 16:27:24,280 INFO L276 IsEmpty]: Start isEmpty. Operand 89123 states and 96159 transitions. [2024-10-12 16:27:24,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2024-10-12 16:27:24,312 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:27:24,312 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:27:24,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 16:27:24,312 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:27:24,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:27:24,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1297935631, now seen corresponding path program 1 times [2024-10-12 16:27:24,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:27:24,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346992300] [2024-10-12 16:27:24,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:27:24,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:27:24,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:27:24,612 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-12 16:27:24,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:27:24,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346992300] [2024-10-12 16:27:24,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346992300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:27:24,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:27:24,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:27:24,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235623816] [2024-10-12 16:27:24,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:27:24,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:27:24,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:27:24,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:27:24,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:27:24,615 INFO L87 Difference]: Start difference. First operand 89123 states and 96159 transitions. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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-10-12 16:27:26,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:27:26,487 INFO L93 Difference]: Finished difference Result 187607 states and 202574 transitions. [2024-10-12 16:27:26,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:27:26,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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 485 [2024-10-12 16:27:26,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:27:26,629 INFO L225 Difference]: With dead ends: 187607 [2024-10-12 16:27:26,630 INFO L226 Difference]: Without dead ends: 98482 [2024-10-12 16:27:26,683 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-10-12 16:27:26,684 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 423 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 1430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:27:26,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 317 Invalid, 1430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 1183 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 16:27:26,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98482 states. [2024-10-12 16:27:27,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98482 to 82300. [2024-10-12 16:27:27,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82300 states, 82299 states have (on average 1.075918297913705) internal successors, (88547), 82299 states have internal predecessors, (88547), 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-10-12 16:27:28,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82300 states to 82300 states and 88547 transitions. [2024-10-12 16:27:28,034 INFO L78 Accepts]: Start accepts. Automaton has 82300 states and 88547 transitions. Word has length 485 [2024-10-12 16:27:28,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:27:28,035 INFO L471 AbstractCegarLoop]: Abstraction has 82300 states and 88547 transitions. [2024-10-12 16:27:28,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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-10-12 16:27:28,035 INFO L276 IsEmpty]: Start isEmpty. Operand 82300 states and 88547 transitions. [2024-10-12 16:27:28,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2024-10-12 16:27:28,056 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:27:28,056 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 16:27:28,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 16:27:28,057 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:27:28,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:27:28,057 INFO L85 PathProgramCache]: Analyzing trace with hash 940347843, now seen corresponding path program 1 times [2024-10-12 16:27:28,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:27:28,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116427356] [2024-10-12 16:27:28,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:27:28,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:27:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:27:28,946 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-12 16:27:28,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:27:28,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116427356] [2024-10-12 16:27:28,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116427356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:27:28,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:27:28,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:27:28,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314169296] [2024-10-12 16:27:28,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:27:28,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:27:28,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:27:28,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:27:28,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:27:28,950 INFO L87 Difference]: Start difference. First operand 82300 states and 88547 transitions. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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-10-12 16:27:30,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:27:30,943 INFO L93 Difference]: Finished difference Result 175697 states and 188768 transitions. [2024-10-12 16:27:30,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:27:30,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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 594 [2024-10-12 16:27:30,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:27:31,040 INFO L225 Difference]: With dead ends: 175697 [2024-10-12 16:27:31,040 INFO L226 Difference]: Without dead ends: 93398 [2024-10-12 16:27:31,083 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-10-12 16:27:31,083 INFO L432 NwaCegarLoop]: 765 mSDtfsCounter, 403 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1399 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 1478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:27:31,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 819 Invalid, 1478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1399 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 16:27:31,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93398 states. [2024-10-12 16:27:31,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93398 to 82725. [2024-10-12 16:27:32,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82725 states, 82724 states have (on average 1.0747183405057783) internal successors, (88905), 82724 states have internal predecessors, (88905), 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-10-12 16:27:32,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82725 states to 82725 states and 88905 transitions. [2024-10-12 16:27:32,080 INFO L78 Accepts]: Start accepts. Automaton has 82725 states and 88905 transitions. Word has length 594 [2024-10-12 16:27:32,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:27:32,081 INFO L471 AbstractCegarLoop]: Abstraction has 82725 states and 88905 transitions. [2024-10-12 16:27:32,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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-10-12 16:27:32,081 INFO L276 IsEmpty]: Start isEmpty. Operand 82725 states and 88905 transitions. [2024-10-12 16:27:32,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2024-10-12 16:27:32,098 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:27:32,099 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 16:27:32,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 16:27:32,099 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:27:32,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:27:32,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1947438286, now seen corresponding path program 1 times [2024-10-12 16:27:32,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:27:32,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393919235] [2024-10-12 16:27:32,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:27:32,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:27:32,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:27:33,286 INFO L134 CoverageAnalysis]: Checked inductivity of 695 backedges. 542 proven. 72 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-12 16:27:33,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:27:33,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393919235] [2024-10-12 16:27:33,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393919235] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:27:33,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555407699] [2024-10-12 16:27:33,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:27:33,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:27:33,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:27:33,290 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-10-12 16:27:33,291 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-10-12 16:27:33,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:27:33,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 16:27:33,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:27:33,990 INFO L134 CoverageAnalysis]: Checked inductivity of 695 backedges. 391 proven. 59 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-10-12 16:27:33,990 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 16:27:34,176 INFO L134 CoverageAnalysis]: Checked inductivity of 695 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-10-12 16:27:34,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555407699] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-12 16:27:34,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-12 16:27:34,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 8 [2024-10-12 16:27:34,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414300345] [2024-10-12 16:27:34,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:27:34,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:27:34,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:27:34,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:27:34,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-12 16:27:34,180 INFO L87 Difference]: Start difference. First operand 82725 states and 88905 transitions. Second operand has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 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-10-12 16:27:37,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:27:37,131 INFO L93 Difference]: Finished difference Result 181214 states and 194687 transitions. [2024-10-12 16:27:37,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:27:37,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 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 627 [2024-10-12 16:27:37,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:27:37,231 INFO L225 Difference]: With dead ends: 181214 [2024-10-12 16:27:37,231 INFO L226 Difference]: Without dead ends: 98062 [2024-10-12 16:27:37,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1257 GetRequests, 1250 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-12 16:27:37,247 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 935 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 2278 mSolverCounterSat, 545 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 2823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 545 IncrementalHoareTripleChecker+Valid, 2278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 16:27:37,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [935 Valid, 182 Invalid, 2823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [545 Valid, 2278 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 16:27:37,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98062 states. [2024-10-12 16:27:38,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98062 to 92510. [2024-10-12 16:27:38,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92510 states, 92509 states have (on average 1.0758520792571533) internal successors, (99526), 92509 states have internal predecessors, (99526), 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-10-12 16:27:38,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92510 states to 92510 states and 99526 transitions. [2024-10-12 16:27:38,326 INFO L78 Accepts]: Start accepts. Automaton has 92510 states and 99526 transitions. Word has length 627 [2024-10-12 16:27:38,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:27:38,327 INFO L471 AbstractCegarLoop]: Abstraction has 92510 states and 99526 transitions. [2024-10-12 16:27:38,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 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-10-12 16:27:38,327 INFO L276 IsEmpty]: Start isEmpty. Operand 92510 states and 99526 transitions. [2024-10-12 16:27:38,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 647 [2024-10-12 16:27:38,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:27:38,345 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 16:27:38,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 16:27:38,545 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-10-12 16:27:38,545 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:27:38,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:27:38,546 INFO L85 PathProgramCache]: Analyzing trace with hash -799209738, now seen corresponding path program 1 times [2024-10-12 16:27:38,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:27:38,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748794352] [2024-10-12 16:27:38,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:27:38,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:27:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:27:38,794 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 486 proven. 0 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2024-10-12 16:27:38,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:27:38,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748794352] [2024-10-12 16:27:38,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748794352] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:27:38,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:27:38,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:27:38,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631469489] [2024-10-12 16:27:38,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:27:38,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:27:38,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:27:38,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:27:38,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:27:38,797 INFO L87 Difference]: Start difference. First operand 92510 states and 99526 transitions. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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)