./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-56.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-56.i -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 6d1b006d272058898ce4b6d9ba4b6ecf31d1f20c483932c07245be2ad6eb978b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:05:14,251 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:05:14,327 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:05:14,336 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:05:14,336 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:05:14,370 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:05:14,371 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:05:14,371 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:05:14,372 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:05:14,373 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:05:14,375 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:05:14,375 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:05:14,376 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:05:14,376 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:05:14,376 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:05:14,377 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:05:14,377 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:05:14,377 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:05:14,377 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:05:14,378 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:05:14,378 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:05:14,383 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:05:14,384 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:05:14,384 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:05:14,384 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:05:14,385 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:05:14,385 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:05:14,385 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:05:14,385 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:05:14,386 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:05:14,386 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:05:14,387 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:05:14,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:05:14,388 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:05:14,388 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:05:14,389 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:05:14,389 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:05:14,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:05:14,389 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:05:14,389 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:05:14,390 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:05:14,390 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:05:14,390 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 -> 6d1b006d272058898ce4b6d9ba4b6ecf31d1f20c483932c07245be2ad6eb978b [2024-11-19 00:05:14,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:05:14,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:05:14,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:05:14,704 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:05:14,704 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:05:14,705 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-56.i [2024-11-19 00:05:16,170 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:05:16,439 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:05:16,440 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-56.i [2024-11-19 00:05:16,458 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc8497883/aa89e77d63b04765bd9152df118636ad/FLAG3e514f7ce [2024-11-19 00:05:16,742 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc8497883/aa89e77d63b04765bd9152df118636ad [2024-11-19 00:05:16,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:05:16,746 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:05:16,748 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:05:16,748 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:05:16,753 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:05:16,754 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:05:16" (1/1) ... [2024-11-19 00:05:16,755 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@575f8060 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:16, skipping insertion in model container [2024-11-19 00:05:16,755 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:05:16" (1/1) ... [2024-11-19 00:05:16,822 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:05:17,030 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-56.i[916,929] [2024-11-19 00:05:17,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:05:17,301 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:05:17,315 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-56.i[916,929] [2024-11-19 00:05:17,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:05:17,504 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:05:17,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:17 WrapperNode [2024-11-19 00:05:17,505 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:05:17,506 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:05:17,506 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:05:17,506 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:05:17,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:17" (1/1) ... [2024-11-19 00:05:17,571 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:17" (1/1) ... [2024-11-19 00:05:17,666 INFO L138 Inliner]: procedures = 26, calls = 70, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 645 [2024-11-19 00:05:17,667 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:05:17,668 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:05:17,668 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:05:17,669 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:05:17,684 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:17" (1/1) ... [2024-11-19 00:05:17,684 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:17" (1/1) ... [2024-11-19 00:05:17,701 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:17" (1/1) ... [2024-11-19 00:05:17,747 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 00:05:17,747 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:17" (1/1) ... [2024-11-19 00:05:17,749 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:17" (1/1) ... [2024-11-19 00:05:17,778 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:17" (1/1) ... [2024-11-19 00:05:17,789 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:17" (1/1) ... [2024-11-19 00:05:17,806 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:17" (1/1) ... [2024-11-19 00:05:17,821 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:17" (1/1) ... [2024-11-19 00:05:17,840 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:05:17,841 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:05:17,841 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:05:17,841 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:05:17,842 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:17" (1/1) ... [2024-11-19 00:05:17,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:05:17,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:05:17,881 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 00:05:17,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 00:05:17,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:05:17,932 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:05:17,932 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:05:17,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:05:17,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:05:17,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:05:18,076 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:05:18,078 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:05:19,267 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2024-11-19 00:05:19,267 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:05:19,293 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:05:19,294 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:05:19,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:05:19 BoogieIcfgContainer [2024-11-19 00:05:19,294 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:05:19,298 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:05:19,299 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:05:19,302 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:05:19,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:05:16" (1/3) ... [2024-11-19 00:05:19,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1bd380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:05:19, skipping insertion in model container [2024-11-19 00:05:19,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:17" (2/3) ... [2024-11-19 00:05:19,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1bd380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:05:19, skipping insertion in model container [2024-11-19 00:05:19,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:05:19" (3/3) ... [2024-11-19 00:05:19,306 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-56.i [2024-11-19 00:05:19,324 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:05:19,325 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:05:19,406 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:05:19,413 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;@6b1a284b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:05:19,413 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:05:19,421 INFO L276 IsEmpty]: Start isEmpty. Operand has 245 states, 185 states have (on average 1.5783783783783785) internal successors, (292), 186 states have internal predecessors, (292), 57 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-19 00:05:19,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2024-11-19 00:05:19,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:19,447 INFO L215 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:05:19,448 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:19,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:19,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1210247522, now seen corresponding path program 1 times [2024-11-19 00:05:19,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:19,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774401930] [2024-11-19 00:05:19,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:19,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:20,215 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 6272 trivial. 0 not checked. [2024-11-19 00:05:20,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:20,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774401930] [2024-11-19 00:05:20,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774401930] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:05:20,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198858345] [2024-11-19 00:05:20,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:20,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:05:20,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:05:20,220 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:05:20,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 00:05:20,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:20,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 1093 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:05:20,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:05:20,717 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 6272 trivial. 0 not checked. [2024-11-19 00:05:20,718 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:05:20,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198858345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:20,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:05:20,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:05:20,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709823802] [2024-11-19 00:05:20,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:20,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:05:20,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:20,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:05:20,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:05:20,761 INFO L87 Difference]: Start difference. First operand has 245 states, 185 states have (on average 1.5783783783783785) internal successors, (292), 186 states have internal predecessors, (292), 57 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) Second operand has 2 states, 2 states have (on average 63.0) internal successors, (126), 2 states have internal predecessors, (126), 2 states have call successors, (57), 2 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 2 states have call successors, (57) [2024-11-19 00:05:20,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:20,835 INFO L93 Difference]: Finished difference Result 483 states and 863 transitions. [2024-11-19 00:05:20,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:05:20,839 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 63.0) internal successors, (126), 2 states have internal predecessors, (126), 2 states have call successors, (57), 2 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 2 states have call successors, (57) Word has length 406 [2024-11-19 00:05:20,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:20,849 INFO L225 Difference]: With dead ends: 483 [2024-11-19 00:05:20,849 INFO L226 Difference]: Without dead ends: 241 [2024-11-19 00:05:20,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:05:20,858 INFO L432 NwaCegarLoop]: 397 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:20,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:05:20,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-19 00:05:20,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2024-11-19 00:05:20,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 182 states have (on average 1.554945054945055) internal successors, (283), 182 states have internal predecessors, (283), 57 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-19 00:05:20,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 397 transitions. [2024-11-19 00:05:20,944 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 397 transitions. Word has length 406 [2024-11-19 00:05:20,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:20,944 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 397 transitions. [2024-11-19 00:05:20,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 63.0) internal successors, (126), 2 states have internal predecessors, (126), 2 states have call successors, (57), 2 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 2 states have call successors, (57) [2024-11-19 00:05:20,945 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 397 transitions. [2024-11-19 00:05:20,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2024-11-19 00:05:20,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:20,955 INFO L215 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:05:20,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 00:05:21,155 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,SelfDestructingSolverStorable0 [2024-11-19 00:05:21,156 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:21,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:21,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1880299072, now seen corresponding path program 1 times [2024-11-19 00:05:21,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:21,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528063160] [2024-11-19 00:05:21,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:21,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:21,676 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2024-11-19 00:05:21,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:21,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528063160] [2024-11-19 00:05:21,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528063160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:21,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:21,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:05:21,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513776951] [2024-11-19 00:05:21,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:21,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:05:21,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:21,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:05:21,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:05:21,683 INFO L87 Difference]: Start difference. First operand 241 states and 397 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:21,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:21,777 INFO L93 Difference]: Finished difference Result 616 states and 1025 transitions. [2024-11-19 00:05:21,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:05:21,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 406 [2024-11-19 00:05:21,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:21,785 INFO L225 Difference]: With dead ends: 616 [2024-11-19 00:05:21,786 INFO L226 Difference]: Without dead ends: 378 [2024-11-19 00:05:21,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:05:21,789 INFO L432 NwaCegarLoop]: 394 mSDtfsCounter, 212 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:21,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 782 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:05:21,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-11-19 00:05:21,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 267. [2024-11-19 00:05:21,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 208 states have (on average 1.5721153846153846) internal successors, (327), 208 states have internal predecessors, (327), 57 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-19 00:05:21,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 441 transitions. [2024-11-19 00:05:21,830 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 441 transitions. Word has length 406 [2024-11-19 00:05:21,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:21,834 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 441 transitions. [2024-11-19 00:05:21,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:21,835 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 441 transitions. [2024-11-19 00:05:21,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2024-11-19 00:05:21,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:21,838 INFO L215 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:05:21,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:05:21,839 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:21,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:21,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1980939138, now seen corresponding path program 1 times [2024-11-19 00:05:21,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:21,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422562824] [2024-11-19 00:05:21,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:21,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:22,186 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2024-11-19 00:05:22,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:22,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422562824] [2024-11-19 00:05:22,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422562824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:22,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:22,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:05:22,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403731071] [2024-11-19 00:05:22,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:22,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:05:22,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:22,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:05:22,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:05:22,192 INFO L87 Difference]: Start difference. First operand 267 states and 441 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:22,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:22,331 INFO L93 Difference]: Finished difference Result 790 states and 1307 transitions. [2024-11-19 00:05:22,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:05:22,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 406 [2024-11-19 00:05:22,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:22,339 INFO L225 Difference]: With dead ends: 790 [2024-11-19 00:05:22,339 INFO L226 Difference]: Without dead ends: 526 [2024-11-19 00:05:22,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:05:22,343 INFO L432 NwaCegarLoop]: 618 mSDtfsCounter, 369 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:22,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 984 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:05:22,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-11-19 00:05:22,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 524. [2024-11-19 00:05:22,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 407 states have (on average 1.5454545454545454) internal successors, (629), 407 states have internal predecessors, (629), 114 states have call successors, (114), 2 states have call predecessors, (114), 2 states have return successors, (114), 114 states have call predecessors, (114), 114 states have call successors, (114) [2024-11-19 00:05:22,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 857 transitions. [2024-11-19 00:05:22,410 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 857 transitions. Word has length 406 [2024-11-19 00:05:22,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:22,412 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 857 transitions. [2024-11-19 00:05:22,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:22,413 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 857 transitions. [2024-11-19 00:05:22,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2024-11-19 00:05:22,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:22,416 INFO L215 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:05:22,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 00:05:22,417 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:22,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:22,418 INFO L85 PathProgramCache]: Analyzing trace with hash -104119106, now seen corresponding path program 1 times [2024-11-19 00:05:22,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:22,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492834548] [2024-11-19 00:05:22,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:22,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:22,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:22,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2024-11-19 00:05:22,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:22,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492834548] [2024-11-19 00:05:22,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492834548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:22,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:22,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:05:22,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029305090] [2024-11-19 00:05:22,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:22,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:05:22,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:22,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:05:22,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:05:22,808 INFO L87 Difference]: Start difference. First operand 524 states and 857 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:22,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:22,910 INFO L93 Difference]: Finished difference Result 1312 states and 2145 transitions. [2024-11-19 00:05:22,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:05:22,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 406 [2024-11-19 00:05:22,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:22,918 INFO L225 Difference]: With dead ends: 1312 [2024-11-19 00:05:22,918 INFO L226 Difference]: Without dead ends: 791 [2024-11-19 00:05:22,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:05:22,921 INFO L432 NwaCegarLoop]: 502 mSDtfsCounter, 219 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:22,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 875 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:05:22,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2024-11-19 00:05:22,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 787. [2024-11-19 00:05:22,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 638 states have (on average 1.5579937304075235) internal successors, (994), 640 states have internal predecessors, (994), 144 states have call successors, (144), 4 states have call predecessors, (144), 4 states have return successors, (144), 142 states have call predecessors, (144), 144 states have call successors, (144) [2024-11-19 00:05:22,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1282 transitions. [2024-11-19 00:05:22,981 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1282 transitions. Word has length 406 [2024-11-19 00:05:22,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:22,982 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1282 transitions. [2024-11-19 00:05:22,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:22,983 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1282 transitions. [2024-11-19 00:05:22,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2024-11-19 00:05:22,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:22,986 INFO L215 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:05:22,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 00:05:22,986 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:22,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:22,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1726566978, now seen corresponding path program 1 times [2024-11-19 00:05:22,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:22,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70049118] [2024-11-19 00:05:22,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:22,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:23,282 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2024-11-19 00:05:23,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:23,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70049118] [2024-11-19 00:05:23,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70049118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:23,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:23,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:05:23,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226375634] [2024-11-19 00:05:23,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:23,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:05:23,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:23,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:05:23,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:05:23,286 INFO L87 Difference]: Start difference. First operand 787 states and 1282 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:23,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:23,425 INFO L93 Difference]: Finished difference Result 2339 states and 3808 transitions. [2024-11-19 00:05:23,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:05:23,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 406 [2024-11-19 00:05:23,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:23,439 INFO L225 Difference]: With dead ends: 2339 [2024-11-19 00:05:23,439 INFO L226 Difference]: Without dead ends: 1555 [2024-11-19 00:05:23,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:05:23,443 INFO L432 NwaCegarLoop]: 385 mSDtfsCounter, 361 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:23,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 754 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:05:23,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2024-11-19 00:05:23,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1553. [2024-11-19 00:05:23,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1553 states, 1256 states have (on average 1.535031847133758) internal successors, (1928), 1260 states have internal predecessors, (1928), 288 states have call successors, (288), 8 states have call predecessors, (288), 8 states have return successors, (288), 284 states have call predecessors, (288), 288 states have call successors, (288) [2024-11-19 00:05:23,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 2504 transitions. [2024-11-19 00:05:23,563 INFO L78 Accepts]: Start accepts. Automaton has 1553 states and 2504 transitions. Word has length 406 [2024-11-19 00:05:23,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:23,567 INFO L471 AbstractCegarLoop]: Abstraction has 1553 states and 2504 transitions. [2024-11-19 00:05:23,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:23,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 2504 transitions. [2024-11-19 00:05:23,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2024-11-19 00:05:23,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:23,572 INFO L215 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:05:23,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 00:05:23,573 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:23,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:23,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1878463414, now seen corresponding path program 1 times [2024-11-19 00:05:23,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:23,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226762013] [2024-11-19 00:05:23,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:23,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:23,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:24,295 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2024-11-19 00:05:24,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:24,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226762013] [2024-11-19 00:05:24,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226762013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:24,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:24,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:05:24,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794438605] [2024-11-19 00:05:24,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:24,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:05:24,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:24,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:05:24,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:05:24,301 INFO L87 Difference]: Start difference. First operand 1553 states and 2504 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) [2024-11-19 00:05:24,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:24,809 INFO L93 Difference]: Finished difference Result 4911 states and 7891 transitions. [2024-11-19 00:05:24,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:05:24,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) Word has length 406 [2024-11-19 00:05:24,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:24,834 INFO L225 Difference]: With dead ends: 4911 [2024-11-19 00:05:24,834 INFO L226 Difference]: Without dead ends: 3361 [2024-11-19 00:05:24,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:05:24,842 INFO L432 NwaCegarLoop]: 437 mSDtfsCounter, 546 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 1572 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:24,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 1572 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 00:05:24,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3361 states. [2024-11-19 00:05:25,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3361 to 3101. [2024-11-19 00:05:25,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3101 states, 2508 states have (on average 1.5342902711323765) internal successors, (3848), 2516 states have internal predecessors, (3848), 576 states have call successors, (576), 16 states have call predecessors, (576), 16 states have return successors, (576), 568 states have call predecessors, (576), 576 states have call successors, (576) [2024-11-19 00:05:25,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3101 states to 3101 states and 5000 transitions. [2024-11-19 00:05:25,186 INFO L78 Accepts]: Start accepts. Automaton has 3101 states and 5000 transitions. Word has length 406 [2024-11-19 00:05:25,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:25,188 INFO L471 AbstractCegarLoop]: Abstraction has 3101 states and 5000 transitions. [2024-11-19 00:05:25,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) [2024-11-19 00:05:25,189 INFO L276 IsEmpty]: Start isEmpty. Operand 3101 states and 5000 transitions. [2024-11-19 00:05:25,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2024-11-19 00:05:25,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:25,197 INFO L215 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:05:25,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 00:05:25,197 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:25,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:25,198 INFO L85 PathProgramCache]: Analyzing trace with hash 308592780, now seen corresponding path program 1 times [2024-11-19 00:05:25,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:25,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401192001] [2024-11-19 00:05:25,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:25,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:26,045 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2024-11-19 00:05:26,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:26,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401192001] [2024-11-19 00:05:26,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401192001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:26,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:26,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:05:26,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445335405] [2024-11-19 00:05:26,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:26,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:05:26,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:26,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:05:26,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:05:26,049 INFO L87 Difference]: Start difference. First operand 3101 states and 5000 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:26,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:26,594 INFO L93 Difference]: Finished difference Result 9331 states and 15077 transitions. [2024-11-19 00:05:26,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:05:26,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 407 [2024-11-19 00:05:26,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:26,630 INFO L225 Difference]: With dead ends: 9331 [2024-11-19 00:05:26,630 INFO L226 Difference]: Without dead ends: 6233 [2024-11-19 00:05:26,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:05:26,641 INFO L432 NwaCegarLoop]: 565 mSDtfsCounter, 503 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:26,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 1322 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:05:26,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6233 states. [2024-11-19 00:05:27,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6233 to 4589. [2024-11-19 00:05:27,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4589 states, 3700 states have (on average 1.5248648648648648) internal successors, (5642), 3712 states have internal predecessors, (5642), 864 states have call successors, (864), 24 states have call predecessors, (864), 24 states have return successors, (864), 852 states have call predecessors, (864), 864 states have call successors, (864) [2024-11-19 00:05:27,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4589 states to 4589 states and 7370 transitions. [2024-11-19 00:05:27,087 INFO L78 Accepts]: Start accepts. Automaton has 4589 states and 7370 transitions. Word has length 407 [2024-11-19 00:05:27,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:27,088 INFO L471 AbstractCegarLoop]: Abstraction has 4589 states and 7370 transitions. [2024-11-19 00:05:27,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:27,088 INFO L276 IsEmpty]: Start isEmpty. Operand 4589 states and 7370 transitions. [2024-11-19 00:05:27,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2024-11-19 00:05:27,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:27,095 INFO L215 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:05:27,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 00:05:27,096 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:27,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:27,097 INFO L85 PathProgramCache]: Analyzing trace with hash -81160487, now seen corresponding path program 1 times [2024-11-19 00:05:27,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:27,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371734295] [2024-11-19 00:05:27,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:27,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:27,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:28,942 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2024-11-19 00:05:28,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:28,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371734295] [2024-11-19 00:05:28,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371734295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:28,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:28,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:05:28,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128832877] [2024-11-19 00:05:28,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:28,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:05:28,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:28,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:05:28,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:05:28,945 INFO L87 Difference]: Start difference. First operand 4589 states and 7370 transitions. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:30,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:30,036 INFO L93 Difference]: Finished difference Result 16527 states and 26409 transitions. [2024-11-19 00:05:30,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:05:30,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 408 [2024-11-19 00:05:30,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:30,110 INFO L225 Difference]: With dead ends: 16527 [2024-11-19 00:05:30,111 INFO L226 Difference]: Without dead ends: 11941 [2024-11-19 00:05:30,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:05:30,131 INFO L432 NwaCegarLoop]: 520 mSDtfsCounter, 1344 mSDsluCounter, 1525 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1344 SdHoareTripleChecker+Valid, 2045 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:30,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1344 Valid, 2045 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 00:05:30,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11941 states. [2024-11-19 00:05:30,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11941 to 9973. [2024-11-19 00:05:30,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9973 states, 8616 states have (on average 1.5392293407613742) internal successors, (13262), 8664 states have internal predecessors, (13262), 1284 states have call successors, (1284), 72 states have call predecessors, (1284), 72 states have return successors, (1284), 1236 states have call predecessors, (1284), 1284 states have call successors, (1284) [2024-11-19 00:05:30,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9973 states to 9973 states and 15830 transitions. [2024-11-19 00:05:30,683 INFO L78 Accepts]: Start accepts. Automaton has 9973 states and 15830 transitions. Word has length 408 [2024-11-19 00:05:30,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:30,684 INFO L471 AbstractCegarLoop]: Abstraction has 9973 states and 15830 transitions. [2024-11-19 00:05:30,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:30,688 INFO L276 IsEmpty]: Start isEmpty. Operand 9973 states and 15830 transitions. [2024-11-19 00:05:30,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2024-11-19 00:05:30,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:30,701 INFO L215 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:05:30,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 00:05:30,702 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:30,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:30,702 INFO L85 PathProgramCache]: Analyzing trace with hash 267507617, now seen corresponding path program 1 times [2024-11-19 00:05:30,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:30,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442412090] [2024-11-19 00:05:30,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:30,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:30,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:31,034 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2024-11-19 00:05:31,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:31,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442412090] [2024-11-19 00:05:31,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442412090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:31,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:31,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:05:31,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735724834] [2024-11-19 00:05:31,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:31,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:05:31,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:31,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:05:31,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:05:31,042 INFO L87 Difference]: Start difference. First operand 9973 states and 15830 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:32,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:32,209 INFO L93 Difference]: Finished difference Result 29933 states and 47518 transitions. [2024-11-19 00:05:32,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:05:32,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 408 [2024-11-19 00:05:32,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:32,295 INFO L225 Difference]: With dead ends: 29933 [2024-11-19 00:05:32,295 INFO L226 Difference]: Without dead ends: 19963 [2024-11-19 00:05:32,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:05:32,331 INFO L432 NwaCegarLoop]: 748 mSDtfsCounter, 999 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 999 SdHoareTripleChecker+Valid, 1604 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:32,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [999 Valid, 1604 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:05:32,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19963 states. [2024-11-19 00:05:33,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19963 to 19333. [2024-11-19 00:05:33,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19333 states, 16620 states have (on average 1.5157641395908543) internal successors, (25192), 16716 states have internal predecessors, (25192), 2568 states have call successors, (2568), 144 states have call predecessors, (2568), 144 states have return successors, (2568), 2472 states have call predecessors, (2568), 2568 states have call successors, (2568) [2024-11-19 00:05:33,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19333 states to 19333 states and 30328 transitions. [2024-11-19 00:05:33,573 INFO L78 Accepts]: Start accepts. Automaton has 19333 states and 30328 transitions. Word has length 408 [2024-11-19 00:05:33,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:33,574 INFO L471 AbstractCegarLoop]: Abstraction has 19333 states and 30328 transitions. [2024-11-19 00:05:33,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:33,575 INFO L276 IsEmpty]: Start isEmpty. Operand 19333 states and 30328 transitions. [2024-11-19 00:05:33,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2024-11-19 00:05:33,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:33,594 INFO L215 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:05:33,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 00:05:33,594 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:33,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:33,595 INFO L85 PathProgramCache]: Analyzing trace with hash -4259689, now seen corresponding path program 1 times [2024-11-19 00:05:33,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:33,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485164565] [2024-11-19 00:05:33,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:33,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:33,808 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2024-11-19 00:05:33,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:33,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485164565] [2024-11-19 00:05:33,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485164565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:33,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:33,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:05:33,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142170812] [2024-11-19 00:05:33,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:33,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:05:33,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:33,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:05:33,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:05:33,811 INFO L87 Difference]: Start difference. First operand 19333 states and 30328 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:34,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:34,623 INFO L93 Difference]: Finished difference Result 38905 states and 60846 transitions. [2024-11-19 00:05:34,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:05:34,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 408 [2024-11-19 00:05:34,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:34,706 INFO L225 Difference]: With dead ends: 38905 [2024-11-19 00:05:34,706 INFO L226 Difference]: Without dead ends: 19575 [2024-11-19 00:05:34,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:05:34,763 INFO L432 NwaCegarLoop]: 534 mSDtfsCounter, 228 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:34,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 908 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:05:34,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19575 states. [2024-11-19 00:05:35,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19575 to 16409. [2024-11-19 00:05:35,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16409 states, 14224 states have (on average 1.5210911136107987) internal successors, (21636), 14272 states have internal predecessors, (21636), 2040 states have call successors, (2040), 144 states have call predecessors, (2040), 144 states have return successors, (2040), 1992 states have call predecessors, (2040), 2040 states have call successors, (2040) [2024-11-19 00:05:35,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16409 states to 16409 states and 25716 transitions. [2024-11-19 00:05:35,783 INFO L78 Accepts]: Start accepts. Automaton has 16409 states and 25716 transitions. Word has length 408 [2024-11-19 00:05:35,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:35,784 INFO L471 AbstractCegarLoop]: Abstraction has 16409 states and 25716 transitions. [2024-11-19 00:05:35,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:35,784 INFO L276 IsEmpty]: Start isEmpty. Operand 16409 states and 25716 transitions. [2024-11-19 00:05:35,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2024-11-19 00:05:35,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:35,799 INFO L215 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:05:35,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 00:05:35,800 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:35,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:35,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1024607251, now seen corresponding path program 1 times [2024-11-19 00:05:35,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:35,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099637962] [2024-11-19 00:05:35,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:35,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:36,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:38,498 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2024-11-19 00:05:38,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:38,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099637962] [2024-11-19 00:05:38,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099637962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:38,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:38,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 00:05:38,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002964172] [2024-11-19 00:05:38,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:38,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:05:38,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:38,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:05:38,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:05:38,501 INFO L87 Difference]: Start difference. First operand 16409 states and 25716 transitions. Second operand has 11 states, 11 states have (on average 11.454545454545455) internal successors, (126), 11 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:41,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:41,545 INFO L93 Difference]: Finished difference Result 47703 states and 75218 transitions. [2024-11-19 00:05:41,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 00:05:41,546 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.454545454545455) internal successors, (126), 11 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 408 [2024-11-19 00:05:41,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:41,646 INFO L225 Difference]: With dead ends: 47703 [2024-11-19 00:05:41,646 INFO L226 Difference]: Without dead ends: 31297 [2024-11-19 00:05:41,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2024-11-19 00:05:41,694 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 2051 mSDsluCounter, 2737 mSDsCounter, 0 mSdLazyCounter, 1494 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2051 SdHoareTripleChecker+Valid, 3181 SdHoareTripleChecker+Invalid, 1698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 1494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:41,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2051 Valid, 3181 Invalid, 1698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 1494 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-19 00:05:41,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31297 states. [2024-11-19 00:05:42,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31297 to 21079. [2024-11-19 00:05:42,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21079 states, 18833 states have (on average 1.5370360537354644) internal successors, (28947), 18881 states have internal predecessors, (28947), 2097 states have call successors, (2097), 148 states have call predecessors, (2097), 148 states have return successors, (2097), 2049 states have call predecessors, (2097), 2097 states have call successors, (2097) [2024-11-19 00:05:42,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21079 states to 21079 states and 33141 transitions. [2024-11-19 00:05:42,991 INFO L78 Accepts]: Start accepts. Automaton has 21079 states and 33141 transitions. Word has length 408 [2024-11-19 00:05:42,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:42,992 INFO L471 AbstractCegarLoop]: Abstraction has 21079 states and 33141 transitions. [2024-11-19 00:05:42,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.454545454545455) internal successors, (126), 11 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:42,992 INFO L276 IsEmpty]: Start isEmpty. Operand 21079 states and 33141 transitions. [2024-11-19 00:05:43,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2024-11-19 00:05:43,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:43,015 INFO L215 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:05:43,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 00:05:43,016 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:43,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:43,016 INFO L85 PathProgramCache]: Analyzing trace with hash 578349847, now seen corresponding path program 1 times [2024-11-19 00:05:43,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:43,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524220518] [2024-11-19 00:05:43,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:43,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:44,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2024-11-19 00:05:44,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:44,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524220518] [2024-11-19 00:05:44,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524220518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:44,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:44,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:05:44,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549230731] [2024-11-19 00:05:44,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:44,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:05:44,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:44,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:05:44,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:05:44,817 INFO L87 Difference]: Start difference. First operand 21079 states and 33141 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:46,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:46,047 INFO L93 Difference]: Finished difference Result 38968 states and 60815 transitions. [2024-11-19 00:05:46,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:05:46,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 408 [2024-11-19 00:05:46,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:46,139 INFO L225 Difference]: With dead ends: 38968 [2024-11-19 00:05:46,140 INFO L226 Difference]: Without dead ends: 27263 [2024-11-19 00:05:46,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:05:46,170 INFO L432 NwaCegarLoop]: 749 mSDtfsCounter, 487 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 1643 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:46,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 1643 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:05:46,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27263 states. [2024-11-19 00:05:47,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27263 to 21091. [2024-11-19 00:05:47,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21091 states, 18845 states have (on average 1.536694083311223) internal successors, (28959), 18893 states have internal predecessors, (28959), 2097 states have call successors, (2097), 148 states have call predecessors, (2097), 148 states have return successors, (2097), 2049 states have call predecessors, (2097), 2097 states have call successors, (2097) [2024-11-19 00:05:47,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21091 states to 21091 states and 33153 transitions. [2024-11-19 00:05:47,477 INFO L78 Accepts]: Start accepts. Automaton has 21091 states and 33153 transitions. Word has length 408 [2024-11-19 00:05:47,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:47,478 INFO L471 AbstractCegarLoop]: Abstraction has 21091 states and 33153 transitions. [2024-11-19 00:05:47,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:47,478 INFO L276 IsEmpty]: Start isEmpty. Operand 21091 states and 33153 transitions. [2024-11-19 00:05:47,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-11-19 00:05:47,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:47,500 INFO L215 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:05:47,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 00:05:47,501 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:47,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:47,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1459029342, now seen corresponding path program 1 times [2024-11-19 00:05:47,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:47,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596044094] [2024-11-19 00:05:47,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:47,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:48,274 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2024-11-19 00:05:48,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:48,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596044094] [2024-11-19 00:05:48,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596044094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:48,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:48,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:05:48,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944464566] [2024-11-19 00:05:48,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:48,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:05:48,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:48,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:05:48,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:05:48,278 INFO L87 Difference]: Start difference. First operand 21091 states and 33153 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:49,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:49,050 INFO L93 Difference]: Finished difference Result 52106 states and 82137 transitions. [2024-11-19 00:05:49,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:05:49,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 409 [2024-11-19 00:05:49,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:49,156 INFO L225 Difference]: With dead ends: 52106 [2024-11-19 00:05:49,156 INFO L226 Difference]: Without dead ends: 33711 [2024-11-19 00:05:49,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:05:49,197 INFO L432 NwaCegarLoop]: 572 mSDtfsCounter, 415 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:49,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 1313 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:05:49,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33711 states. [2024-11-19 00:05:50,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33711 to 20863. [2024-11-19 00:05:50,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20863 states, 18617 states have (on average 1.5357468979964548) internal successors, (28591), 18665 states have internal predecessors, (28591), 2097 states have call successors, (2097), 148 states have call predecessors, (2097), 148 states have return successors, (2097), 2049 states have call predecessors, (2097), 2097 states have call successors, (2097) [2024-11-19 00:05:50,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20863 states to 20863 states and 32785 transitions. [2024-11-19 00:05:50,512 INFO L78 Accepts]: Start accepts. Automaton has 20863 states and 32785 transitions. Word has length 409 [2024-11-19 00:05:50,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:50,513 INFO L471 AbstractCegarLoop]: Abstraction has 20863 states and 32785 transitions. [2024-11-19 00:05:50,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:50,514 INFO L276 IsEmpty]: Start isEmpty. Operand 20863 states and 32785 transitions. [2024-11-19 00:05:50,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-11-19 00:05:50,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:50,538 INFO L215 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:05:50,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 00:05:50,538 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:50,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:50,539 INFO L85 PathProgramCache]: Analyzing trace with hash -505089184, now seen corresponding path program 1 times [2024-11-19 00:05:50,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:50,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970535277] [2024-11-19 00:05:50,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:50,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:51,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:52,819 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2024-11-19 00:05:52,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:52,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970535277] [2024-11-19 00:05:52,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970535277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:52,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:52,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:05:52,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256697585] [2024-11-19 00:05:52,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:52,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:05:52,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:52,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:05:52,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:05:52,823 INFO L87 Difference]: Start difference. First operand 20863 states and 32785 transitions. Second operand has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:54,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:54,998 INFO L93 Difference]: Finished difference Result 89916 states and 141311 transitions. [2024-11-19 00:05:55,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:05:55,001 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 409 [2024-11-19 00:05:55,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:55,200 INFO L225 Difference]: With dead ends: 89916 [2024-11-19 00:05:55,200 INFO L226 Difference]: Without dead ends: 78251 [2024-11-19 00:05:55,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:05:55,253 INFO L432 NwaCegarLoop]: 813 mSDtfsCounter, 1289 mSDsluCounter, 2766 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1289 SdHoareTripleChecker+Valid, 3579 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:55,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1289 Valid, 3579 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 00:05:55,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78251 states. [2024-11-19 00:05:57,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78251 to 53379. [2024-11-19 00:05:57,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53379 states, 48589 states have (on average 1.5474901726728272) internal successors, (75191), 48709 states have internal predecessors, (75191), 4449 states have call successors, (4449), 340 states have call predecessors, (4449), 340 states have return successors, (4449), 4329 states have call predecessors, (4449), 4449 states have call successors, (4449) [2024-11-19 00:05:57,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53379 states to 53379 states and 84089 transitions. [2024-11-19 00:05:57,903 INFO L78 Accepts]: Start accepts. Automaton has 53379 states and 84089 transitions. Word has length 409 [2024-11-19 00:05:57,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:57,904 INFO L471 AbstractCegarLoop]: Abstraction has 53379 states and 84089 transitions. [2024-11-19 00:05:57,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:05:57,905 INFO L276 IsEmpty]: Start isEmpty. Operand 53379 states and 84089 transitions. [2024-11-19 00:05:57,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-11-19 00:05:57,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:57,955 INFO L215 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:05:57,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 00:05:57,956 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:57,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:57,956 INFO L85 PathProgramCache]: Analyzing trace with hash -472272669, now seen corresponding path program 1 times [2024-11-19 00:05:57,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:57,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190322452] [2024-11-19 00:05:57,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:57,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:58,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:59,411 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2024-11-19 00:05:59,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:59,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190322452] [2024-11-19 00:05:59,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190322452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:59,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:59,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:05:59,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943394939] [2024-11-19 00:05:59,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:59,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:05:59,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:59,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:05:59,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:05:59,416 INFO L87 Difference]: Start difference. First operand 53379 states and 84089 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:06:01,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:06:01,106 INFO L93 Difference]: Finished difference Result 89307 states and 140500 transitions. [2024-11-19 00:06:01,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:06:01,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 409 [2024-11-19 00:06:01,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:06:01,264 INFO L225 Difference]: With dead ends: 89307 [2024-11-19 00:06:01,264 INFO L226 Difference]: Without dead ends: 59046 [2024-11-19 00:06:01,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-11-19 00:06:01,325 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 609 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:06:01,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 980 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:06:01,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59046 states. [2024-11-19 00:06:03,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59046 to 53072. [2024-11-19 00:06:03,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53072 states, 48718 states have (on average 1.5520341557535202) internal successors, (75612), 48810 states have internal predecessors, (75612), 4053 states have call successors, (4053), 300 states have call predecessors, (4053), 300 states have return successors, (4053), 3961 states have call predecessors, (4053), 4053 states have call successors, (4053) [2024-11-19 00:06:03,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53072 states to 53072 states and 83718 transitions. [2024-11-19 00:06:03,915 INFO L78 Accepts]: Start accepts. Automaton has 53072 states and 83718 transitions. Word has length 409 [2024-11-19 00:06:03,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:06:03,916 INFO L471 AbstractCegarLoop]: Abstraction has 53072 states and 83718 transitions. [2024-11-19 00:06:03,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2024-11-19 00:06:03,917 INFO L276 IsEmpty]: Start isEmpty. Operand 53072 states and 83718 transitions. [2024-11-19 00:06:03,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-11-19 00:06:03,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:06:03,943 INFO L215 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:06:03,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 00:06:03,944 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:06:03,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:06:03,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1645083621, now seen corresponding path program 1 times [2024-11-19 00:06:03,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:06:03,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911253033] [2024-11-19 00:06:03,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:06:03,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:06:06,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:06:07,538 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 21 proven. 147 refuted. 0 times theorem prover too weak. 6216 trivial. 0 not checked. [2024-11-19 00:06:07,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:06:07,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911253033] [2024-11-19 00:06:07,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911253033] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:06:07,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974481044] [2024-11-19 00:06:07,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:06:07,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:06:07,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:06:07,541 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:06:07,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 00:06:07,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:06:07,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 1086 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 00:06:07,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:06:08,478 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 2648 proven. 120 refuted. 0 times theorem prover too weak. 3616 trivial. 0 not checked. [2024-11-19 00:06:08,478 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:06:08,993 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 48 proven. 120 refuted. 0 times theorem prover too weak. 6216 trivial. 0 not checked. [2024-11-19 00:06:08,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974481044] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:06:08,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 00:06:08,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 11 [2024-11-19 00:06:08,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277280806] [2024-11-19 00:06:08,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 00:06:08,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:06:08,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:06:08,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:06:08,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:06:08,997 INFO L87 Difference]: Start difference. First operand 53072 states and 83718 transitions. Second operand has 11 states, 11 states have (on average 18.636363636363637) internal successors, (205), 11 states have internal predecessors, (205), 4 states have call successors, (154), 2 states have call predecessors, (154), 4 states have return successors, (155), 4 states have call predecessors, (155), 4 states have call successors, (155) [2024-11-19 00:06:11,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:06:11,361 INFO L93 Difference]: Finished difference Result 87418 states and 136906 transitions. [2024-11-19 00:06:11,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 00:06:11,362 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 18.636363636363637) internal successors, (205), 11 states have internal predecessors, (205), 4 states have call successors, (154), 2 states have call predecessors, (154), 4 states have return successors, (155), 4 states have call predecessors, (155), 4 states have call successors, (155) Word has length 409 [2024-11-19 00:06:11,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:06:11,451 INFO L225 Difference]: With dead ends: 87418 [2024-11-19 00:06:11,452 INFO L226 Difference]: Without dead ends: 34064 [2024-11-19 00:06:11,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 844 GetRequests, 817 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=204, Invalid=552, Unknown=0, NotChecked=0, Total=756 [2024-11-19 00:06:11,512 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 1461 mSDsluCounter, 1561 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 1847 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:06:11,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 1847 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 00:06:11,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34064 states. [2024-11-19 00:06:12,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34064 to 26170. [2024-11-19 00:06:12,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26170 states, 22638 states have (on average 1.4963335983744146) internal successors, (33874), 22674 states have internal predecessors, (33874), 3261 states have call successors, (3261), 270 states have call predecessors, (3261), 270 states have return successors, (3261), 3225 states have call predecessors, (3261), 3261 states have call successors, (3261) [2024-11-19 00:06:12,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26170 states to 26170 states and 40396 transitions. [2024-11-19 00:06:12,924 INFO L78 Accepts]: Start accepts. Automaton has 26170 states and 40396 transitions. Word has length 409 [2024-11-19 00:06:12,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:06:12,925 INFO L471 AbstractCegarLoop]: Abstraction has 26170 states and 40396 transitions. [2024-11-19 00:06:12,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.636363636363637) internal successors, (205), 11 states have internal predecessors, (205), 4 states have call successors, (154), 2 states have call predecessors, (154), 4 states have return successors, (155), 4 states have call predecessors, (155), 4 states have call successors, (155) [2024-11-19 00:06:12,925 INFO L276 IsEmpty]: Start isEmpty. Operand 26170 states and 40396 transitions. [2024-11-19 00:06:12,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-11-19 00:06:12,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:06:12,938 INFO L215 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:06:12,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 00:06:13,138 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,SelfDestructingSolverStorable15 [2024-11-19 00:06:13,139 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:06:13,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:06:13,140 INFO L85 PathProgramCache]: Analyzing trace with hash 886942491, now seen corresponding path program 1 times [2024-11-19 00:06:13,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:06:13,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802100594] [2024-11-19 00:06:13,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:06:13,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:06:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:06:13,715 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2024-11-19 00:06:13,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:06:13,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802100594] [2024-11-19 00:06:13,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802100594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:06:13,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:06:13,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:06:13,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839963425] [2024-11-19 00:06:13,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:06:13,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:06:13,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:06:13,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:06:13,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:06:13,720 INFO L87 Difference]: Start difference. First operand 26170 states and 40396 transitions. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57)