./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-96.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-96.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 bbe82d9db46cc4877e8712955f17e418608577d83df9685a386a7b3e39c5f9b9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:08:47,013 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:08:47,065 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:08:47,072 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:08:47,072 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:08:47,095 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:08:47,096 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:08:47,098 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:08:47,099 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:08:47,102 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:08:47,102 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:08:47,102 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:08:47,103 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:08:47,103 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:08:47,103 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:08:47,103 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:08:47,103 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:08:47,104 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:08:47,104 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:08:47,104 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:08:47,105 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:08:47,106 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:08:47,106 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:08:47,106 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:08:47,106 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:08:47,107 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:08:47,107 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:08:47,107 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:08:47,108 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:08:47,108 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:08:47,108 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:08:47,109 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:08:47,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:08:47,109 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:08:47,109 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:08:47,110 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:08:47,110 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:08:47,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:08:47,110 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:08:47,110 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:08:47,110 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:08:47,111 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:08:47,111 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 -> bbe82d9db46cc4877e8712955f17e418608577d83df9685a386a7b3e39c5f9b9 [2024-11-19 00:08:47,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:08:47,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:08:47,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:08:47,366 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:08:47,367 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:08:47,368 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-96.i [2024-11-19 00:08:48,621 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:08:48,830 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:08:48,830 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-96.i [2024-11-19 00:08:48,846 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68d40dd3e/7861a08a48e745dd9dc1932f858f1042/FLAG5fe33caa7 [2024-11-19 00:08:49,176 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68d40dd3e/7861a08a48e745dd9dc1932f858f1042 [2024-11-19 00:08:49,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:08:49,180 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:08:49,182 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:08:49,182 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:08:49,186 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:08:49,187 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:08:49" (1/1) ... [2024-11-19 00:08:49,188 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5402d528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:08:49, skipping insertion in model container [2024-11-19 00:08:49,188 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:08:49" (1/1) ... [2024-11-19 00:08:49,241 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:08:49,390 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-96.i[916,929] [2024-11-19 00:08:49,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:08:49,616 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:08:49,628 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-96.i[916,929] [2024-11-19 00:08:49,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:08:49,733 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:08:49,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:08:49 WrapperNode [2024-11-19 00:08:49,734 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:08:49,735 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:08:49,735 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:08:49,735 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:08:49,741 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:08:49" (1/1) ... [2024-11-19 00:08:49,763 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:08:49" (1/1) ... [2024-11-19 00:08:49,901 INFO L138 Inliner]: procedures = 26, calls = 78, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 735 [2024-11-19 00:08:49,902 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:08:49,903 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:08:49,903 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:08:49,903 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:08:49,912 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:08:49" (1/1) ... [2024-11-19 00:08:49,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:08:49" (1/1) ... [2024-11-19 00:08:49,938 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:08:49" (1/1) ... [2024-11-19 00:08:49,990 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:08:49,990 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:08:49" (1/1) ... [2024-11-19 00:08:49,990 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:08:49" (1/1) ... [2024-11-19 00:08:50,021 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:08:49" (1/1) ... [2024-11-19 00:08:50,031 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:08:49" (1/1) ... [2024-11-19 00:08:50,049 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:08:49" (1/1) ... [2024-11-19 00:08:50,056 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:08:49" (1/1) ... [2024-11-19 00:08:50,074 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:08:50,075 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:08:50,076 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:08:50,076 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:08:50,076 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:08:49" (1/1) ... [2024-11-19 00:08:50,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:08:50,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:08:50,107 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:08:50,111 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:08:50,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:08:50,155 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:08:50,155 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:08:50,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:08:50,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:08:50,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:08:50,296 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:08:50,298 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:08:51,398 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2024-11-19 00:08:51,399 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:08:51,416 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:08:51,417 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:08:51,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:08:51 BoogieIcfgContainer [2024-11-19 00:08:51,417 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:08:51,419 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:08:51,419 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:08:51,422 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:08:51,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:08:49" (1/3) ... [2024-11-19 00:08:51,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@221846e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:08:51, skipping insertion in model container [2024-11-19 00:08:51,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:08:49" (2/3) ... [2024-11-19 00:08:51,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@221846e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:08:51, skipping insertion in model container [2024-11-19 00:08:51,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:08:51" (3/3) ... [2024-11-19 00:08:51,424 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-96.i [2024-11-19 00:08:51,439 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:08:51,440 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:08:51,509 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:08:51,514 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;@666eee64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:08:51,515 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:08:51,521 INFO L276 IsEmpty]: Start isEmpty. Operand has 292 states, 224 states have (on average 1.5535714285714286) internal successors, (348), 225 states have internal predecessors, (348), 65 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-19 00:08:51,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2024-11-19 00:08:51,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:08:51,545 INFO L215 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:51,546 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:08:51,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:08:51,551 INFO L85 PathProgramCache]: Analyzing trace with hash 422084321, now seen corresponding path program 1 times [2024-11-19 00:08:51,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:08:51,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869700082] [2024-11-19 00:08:51,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:08:51,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:08:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:08:52,136 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 8192 trivial. 0 not checked. [2024-11-19 00:08:52,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:08:52,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869700082] [2024-11-19 00:08:52,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869700082] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:08:52,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001209450] [2024-11-19 00:08:52,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:08:52,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:08:52,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:08:52,146 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:08:52,147 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:08:52,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:08:52,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 1145 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:08:52,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:08:52,556 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 8192 trivial. 0 not checked. [2024-11-19 00:08:52,556 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:08:52,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001209450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:08:52,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:08:52,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:08:52,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456031007] [2024-11-19 00:08:52,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:08:52,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:08:52,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:08:52,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:08:52,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:08:52,600 INFO L87 Difference]: Start difference. First operand has 292 states, 224 states have (on average 1.5535714285714286) internal successors, (348), 225 states have internal predecessors, (348), 65 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) Second operand has 2 states, 2 states have (on average 67.5) internal successors, (135), 2 states have internal predecessors, (135), 2 states have call successors, (65), 2 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 2 states have call successors, (65) [2024-11-19 00:08:52,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:08:52,658 INFO L93 Difference]: Finished difference Result 574 states and 1009 transitions. [2024-11-19 00:08:52,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:08:52,661 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 67.5) internal successors, (135), 2 states have internal predecessors, (135), 2 states have call successors, (65), 2 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 2 states have call successors, (65) Word has length 455 [2024-11-19 00:08:52,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:08:52,673 INFO L225 Difference]: With dead ends: 574 [2024-11-19 00:08:52,674 INFO L226 Difference]: Without dead ends: 285 [2024-11-19 00:08:52,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 456 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:08:52,681 INFO L432 NwaCegarLoop]: 461 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, 461 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:08:52,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:08:52,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-19 00:08:52,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2024-11-19 00:08:52,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 218 states have (on average 1.518348623853211) internal successors, (331), 218 states have internal predecessors, (331), 65 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-19 00:08:52,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 461 transitions. [2024-11-19 00:08:52,752 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 461 transitions. Word has length 455 [2024-11-19 00:08:52,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:08:52,754 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 461 transitions. [2024-11-19 00:08:52,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 67.5) internal successors, (135), 2 states have internal predecessors, (135), 2 states have call successors, (65), 2 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 2 states have call successors, (65) [2024-11-19 00:08:52,755 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 461 transitions. [2024-11-19 00:08:52,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2024-11-19 00:08:52,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:08:52,766 INFO L215 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:52,785 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:08:52,967 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:08:52,967 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:08:52,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:08:52,968 INFO L85 PathProgramCache]: Analyzing trace with hash 190587467, now seen corresponding path program 1 times [2024-11-19 00:08:52,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:08:52,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216683837] [2024-11-19 00:08:52,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:08:52,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:08:53,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:08:53,377 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2024-11-19 00:08:53,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:08:53,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216683837] [2024-11-19 00:08:53,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216683837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:08:53,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:08:53,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:08:53,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279299497] [2024-11-19 00:08:53,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:08:53,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:08:53,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:08:53,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:08:53,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:08:53,383 INFO L87 Difference]: Start difference. First operand 285 states and 461 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2024-11-19 00:08:53,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:08:53,476 INFO L93 Difference]: Finished difference Result 761 states and 1229 transitions. [2024-11-19 00:08:53,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:08:53,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 455 [2024-11-19 00:08:53,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:08:53,485 INFO L225 Difference]: With dead ends: 761 [2024-11-19 00:08:53,486 INFO L226 Difference]: Without dead ends: 479 [2024-11-19 00:08:53,487 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:08:53,488 INFO L432 NwaCegarLoop]: 682 mSDtfsCounter, 283 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:08:53,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 1119 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:08:53,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-11-19 00:08:53,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 476. [2024-11-19 00:08:53,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 388 states have (on average 1.541237113402062) internal successors, (598), 389 states have internal predecessors, (598), 85 states have call successors, (85), 2 states have call predecessors, (85), 2 states have return successors, (85), 84 states have call predecessors, (85), 85 states have call successors, (85) [2024-11-19 00:08:53,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 768 transitions. [2024-11-19 00:08:53,582 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 768 transitions. Word has length 455 [2024-11-19 00:08:53,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:08:53,586 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 768 transitions. [2024-11-19 00:08:53,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2024-11-19 00:08:53,586 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 768 transitions. [2024-11-19 00:08:53,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2024-11-19 00:08:53,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:08:53,596 INFO L215 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:53,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:08:53,596 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:08:53,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:08:53,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1886749431, now seen corresponding path program 1 times [2024-11-19 00:08:53,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:08:53,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142944950] [2024-11-19 00:08:53,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:08:53,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:08:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:08:53,996 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2024-11-19 00:08:53,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:08:53,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142944950] [2024-11-19 00:08:53,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142944950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:08:53,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:08:53,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:08:53,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059413064] [2024-11-19 00:08:53,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:08:54,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:08:54,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:08:54,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:08:54,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:08:54,001 INFO L87 Difference]: Start difference. First operand 476 states and 768 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2024-11-19 00:08:54,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:08:54,236 INFO L93 Difference]: Finished difference Result 1279 states and 2056 transitions. [2024-11-19 00:08:54,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:08:54,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 455 [2024-11-19 00:08:54,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:08:54,245 INFO L225 Difference]: With dead ends: 1279 [2024-11-19 00:08:54,245 INFO L226 Difference]: Without dead ends: 806 [2024-11-19 00:08:54,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:08:54,248 INFO L432 NwaCegarLoop]: 723 mSDtfsCounter, 636 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 1599 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:08:54,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 1599 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:08:54,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2024-11-19 00:08:54,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 536. [2024-11-19 00:08:54,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 448 states have (on average 1.5647321428571428) internal successors, (701), 449 states have internal predecessors, (701), 85 states have call successors, (85), 2 states have call predecessors, (85), 2 states have return successors, (85), 84 states have call predecessors, (85), 85 states have call successors, (85) [2024-11-19 00:08:54,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 871 transitions. [2024-11-19 00:08:54,285 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 871 transitions. Word has length 455 [2024-11-19 00:08:54,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:08:54,288 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 871 transitions. [2024-11-19 00:08:54,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2024-11-19 00:08:54,289 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 871 transitions. [2024-11-19 00:08:54,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2024-11-19 00:08:54,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:08:54,296 INFO L215 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:54,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 00:08:54,297 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:08:54,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:08:54,297 INFO L85 PathProgramCache]: Analyzing trace with hash 841459915, now seen corresponding path program 1 times [2024-11-19 00:08:54,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:08:54,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499704961] [2024-11-19 00:08:54,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:08:54,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:08:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:08:54,546 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2024-11-19 00:08:54,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:08:54,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499704961] [2024-11-19 00:08:54,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499704961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:08:54,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:08:54,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:08:54,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274091359] [2024-11-19 00:08:54,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:08:54,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:08:54,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:08:54,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:08:54,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:08:54,549 INFO L87 Difference]: Start difference. First operand 536 states and 871 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2024-11-19 00:08:54,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:08:54,612 INFO L93 Difference]: Finished difference Result 1385 states and 2236 transitions. [2024-11-19 00:08:54,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:08:54,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 455 [2024-11-19 00:08:54,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:08:54,618 INFO L225 Difference]: With dead ends: 1385 [2024-11-19 00:08:54,618 INFO L226 Difference]: Without dead ends: 852 [2024-11-19 00:08:54,620 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:08:54,620 INFO L432 NwaCegarLoop]: 675 mSDtfsCounter, 266 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:08:54,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 1115 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:08:54,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2024-11-19 00:08:54,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 849. [2024-11-19 00:08:54,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 695 states have (on average 1.5338129496402877) internal successors, (1066), 698 states have internal predecessors, (1066), 149 states have call successors, (149), 4 states have call predecessors, (149), 4 states have return successors, (149), 146 states have call predecessors, (149), 149 states have call successors, (149) [2024-11-19 00:08:54,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1364 transitions. [2024-11-19 00:08:54,657 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1364 transitions. Word has length 455 [2024-11-19 00:08:54,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:08:54,657 INFO L471 AbstractCegarLoop]: Abstraction has 849 states and 1364 transitions. [2024-11-19 00:08:54,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2024-11-19 00:08:54,658 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1364 transitions. [2024-11-19 00:08:54,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2024-11-19 00:08:54,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:08:54,663 INFO L215 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:54,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 00:08:54,663 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:08:54,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:08:54,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1734946253, now seen corresponding path program 1 times [2024-11-19 00:08:54,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:08:54,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672530689] [2024-11-19 00:08:54,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:08:54,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:08:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:08:55,380 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2024-11-19 00:08:55,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:08:55,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672530689] [2024-11-19 00:08:55,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672530689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:08:55,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:08:55,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:08:55,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407001288] [2024-11-19 00:08:55,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:08:55,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:08:55,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:08:55,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:08:55,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:08:55,383 INFO L87 Difference]: Start difference. First operand 849 states and 1364 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2024-11-19 00:08:55,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:08:55,476 INFO L93 Difference]: Finished difference Result 2534 states and 4079 transitions. [2024-11-19 00:08:55,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:08:55,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 455 [2024-11-19 00:08:55,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:08:55,486 INFO L225 Difference]: With dead ends: 2534 [2024-11-19 00:08:55,486 INFO L226 Difference]: Without dead ends: 1688 [2024-11-19 00:08:55,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:08:55,490 INFO L432 NwaCegarLoop]: 553 mSDtfsCounter, 320 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:08:55,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 991 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:08:55,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states. [2024-11-19 00:08:55,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1686. [2024-11-19 00:08:55,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1686 states, 1379 states have (on average 1.5257432922407541) internal successors, (2104), 1385 states have internal predecessors, (2104), 298 states have call successors, (298), 8 states have call predecessors, (298), 8 states have return successors, (298), 292 states have call predecessors, (298), 298 states have call successors, (298) [2024-11-19 00:08:55,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1686 states and 2700 transitions. [2024-11-19 00:08:55,623 INFO L78 Accepts]: Start accepts. Automaton has 1686 states and 2700 transitions. Word has length 455 [2024-11-19 00:08:55,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:08:55,625 INFO L471 AbstractCegarLoop]: Abstraction has 1686 states and 2700 transitions. [2024-11-19 00:08:55,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2024-11-19 00:08:55,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1686 states and 2700 transitions. [2024-11-19 00:08:55,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2024-11-19 00:08:55,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:08:55,634 INFO L215 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:55,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 00:08:55,635 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:08:55,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:08:55,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1789339151, now seen corresponding path program 1 times [2024-11-19 00:08:55,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:08:55,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111740667] [2024-11-19 00:08:55,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:08:55,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:08:55,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:08:56,493 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2024-11-19 00:08:56,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:08:56,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111740667] [2024-11-19 00:08:56,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111740667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:08:56,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:08:56,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:08:56,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175977727] [2024-11-19 00:08:56,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:08:56,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:08:56,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:08:56,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:08:56,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:08:56,500 INFO L87 Difference]: Start difference. First operand 1686 states and 2700 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2024-11-19 00:08:57,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:08:57,326 INFO L93 Difference]: Finished difference Result 4201 states and 6744 transitions. [2024-11-19 00:08:57,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:08:57,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 455 [2024-11-19 00:08:57,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:08:57,341 INFO L225 Difference]: With dead ends: 4201 [2024-11-19 00:08:57,341 INFO L226 Difference]: Without dead ends: 3355 [2024-11-19 00:08:57,344 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:08:57,345 INFO L432 NwaCegarLoop]: 979 mSDtfsCounter, 919 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 2072 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 00:08:57,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 2072 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 00:08:57,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3355 states. [2024-11-19 00:08:57,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3355 to 2535. [2024-11-19 00:08:57,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2535 states, 2075 states have (on average 1.52) internal successors, (3154), 2084 states have internal predecessors, (3154), 447 states have call successors, (447), 12 states have call predecessors, (447), 12 states have return successors, (447), 438 states have call predecessors, (447), 447 states have call successors, (447) [2024-11-19 00:08:57,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2535 states to 2535 states and 4048 transitions. [2024-11-19 00:08:57,487 INFO L78 Accepts]: Start accepts. Automaton has 2535 states and 4048 transitions. Word has length 455 [2024-11-19 00:08:57,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:08:57,489 INFO L471 AbstractCegarLoop]: Abstraction has 2535 states and 4048 transitions. [2024-11-19 00:08:57,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2024-11-19 00:08:57,489 INFO L276 IsEmpty]: Start isEmpty. Operand 2535 states and 4048 transitions. [2024-11-19 00:08:57,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2024-11-19 00:08:57,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:08:57,496 INFO L215 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:57,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 00:08:57,497 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:08:57,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:08:57,497 INFO L85 PathProgramCache]: Analyzing trace with hash 252262127, now seen corresponding path program 1 times [2024-11-19 00:08:57,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:08:57,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848300565] [2024-11-19 00:08:57,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:08:57,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:08:57,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:09:01,000 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2024-11-19 00:09:01,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:09:01,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848300565] [2024-11-19 00:09:01,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848300565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:09:01,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:09:01,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:09:01,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455090222] [2024-11-19 00:09:01,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:09:01,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:09:01,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:09:01,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:09:01,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:09:01,007 INFO L87 Difference]: Start difference. First operand 2535 states and 4048 transitions. Second operand has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 2 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) [2024-11-19 00:09:02,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:09:02,737 INFO L93 Difference]: Finished difference Result 8376 states and 13249 transitions. [2024-11-19 00:09:02,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:09:02,739 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 2 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) Word has length 456 [2024-11-19 00:09:02,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:09:02,763 INFO L225 Difference]: With dead ends: 8376 [2024-11-19 00:09:02,763 INFO L226 Difference]: Without dead ends: 5844 [2024-11-19 00:09:02,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:09:02,774 INFO L432 NwaCegarLoop]: 516 mSDtfsCounter, 1119 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1119 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-19 00:09:02,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1119 Valid, 1632 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-19 00:09:02,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5844 states. [2024-11-19 00:09:02,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5844 to 4958. [2024-11-19 00:09:02,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4958 states, 4438 states have (on average 1.5565570076611086) internal successors, (6908), 4459 states have internal predecessors, (6908), 495 states have call successors, (495), 24 states have call predecessors, (495), 24 states have return successors, (495), 474 states have call predecessors, (495), 495 states have call successors, (495) [2024-11-19 00:09:02,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4958 states to 4958 states and 7898 transitions. [2024-11-19 00:09:02,965 INFO L78 Accepts]: Start accepts. Automaton has 4958 states and 7898 transitions. Word has length 456 [2024-11-19 00:09:02,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:09:02,965 INFO L471 AbstractCegarLoop]: Abstraction has 4958 states and 7898 transitions. [2024-11-19 00:09:02,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 2 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) [2024-11-19 00:09:02,966 INFO L276 IsEmpty]: Start isEmpty. Operand 4958 states and 7898 transitions. [2024-11-19 00:09:02,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2024-11-19 00:09:02,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:09:02,975 INFO L215 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:02,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 00:09:02,975 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:09:02,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:09:02,976 INFO L85 PathProgramCache]: Analyzing trace with hash 165340348, now seen corresponding path program 1 times [2024-11-19 00:09:02,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:09:02,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577207217] [2024-11-19 00:09:02,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:09:02,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:09:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:09:17,612 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2024-11-19 00:09:17,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:09:17,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577207217] [2024-11-19 00:09:17,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577207217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:09:17,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:09:17,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:09:17,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533627344] [2024-11-19 00:09:17,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:09:17,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:09:17,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:09:17,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:09:17,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:09:17,615 INFO L87 Difference]: Start difference. First operand 4958 states and 7898 transitions. Second operand has 9 states, 9 states have (on average 14.88888888888889) internal successors, (134), 9 states have internal predecessors, (134), 3 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 3 states have call predecessors, (65), 3 states have call successors, (65) [2024-11-19 00:09:19,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:09:19,673 INFO L93 Difference]: Finished difference Result 11487 states and 18213 transitions. [2024-11-19 00:09:19,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:09:19,674 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.88888888888889) internal successors, (134), 9 states have internal predecessors, (134), 3 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 3 states have call predecessors, (65), 3 states have call successors, (65) Word has length 456 [2024-11-19 00:09:19,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:09:19,699 INFO L225 Difference]: With dead ends: 11487 [2024-11-19 00:09:19,699 INFO L226 Difference]: Without dead ends: 6532 [2024-11-19 00:09:19,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:09:19,711 INFO L432 NwaCegarLoop]: 599 mSDtfsCounter, 1007 mSDsluCounter, 1176 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1007 SdHoareTripleChecker+Valid, 1775 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 00:09:19,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1007 Valid, 1775 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-19 00:09:19,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6532 states. [2024-11-19 00:09:19,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6532 to 4958. [2024-11-19 00:09:19,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4958 states, 4438 states have (on average 1.5565570076611086) internal successors, (6908), 4459 states have internal predecessors, (6908), 495 states have call successors, (495), 24 states have call predecessors, (495), 24 states have return successors, (495), 474 states have call predecessors, (495), 495 states have call successors, (495) [2024-11-19 00:09:19,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4958 states to 4958 states and 7898 transitions. [2024-11-19 00:09:19,894 INFO L78 Accepts]: Start accepts. Automaton has 4958 states and 7898 transitions. Word has length 456 [2024-11-19 00:09:19,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:09:19,895 INFO L471 AbstractCegarLoop]: Abstraction has 4958 states and 7898 transitions. [2024-11-19 00:09:19,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.88888888888889) internal successors, (134), 9 states have internal predecessors, (134), 3 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 3 states have call predecessors, (65), 3 states have call successors, (65) [2024-11-19 00:09:19,896 INFO L276 IsEmpty]: Start isEmpty. Operand 4958 states and 7898 transitions. [2024-11-19 00:09:19,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2024-11-19 00:09:19,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:09:19,905 INFO L215 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:19,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 00:09:19,905 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:09:19,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:09:19,906 INFO L85 PathProgramCache]: Analyzing trace with hash 367164282, now seen corresponding path program 1 times [2024-11-19 00:09:19,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:09:19,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898375555] [2024-11-19 00:09:19,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:09:19,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:09:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:09:20,570 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2024-11-19 00:09:20,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:09:20,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898375555] [2024-11-19 00:09:20,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898375555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:09:20,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:09:20,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:09:20,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004671984] [2024-11-19 00:09:20,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:09:20,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:09:20,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:09:20,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:09:20,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:09:20,573 INFO L87 Difference]: Start difference. First operand 4958 states and 7898 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2024-11-19 00:09:21,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:09:21,093 INFO L93 Difference]: Finished difference Result 16814 states and 26645 transitions. [2024-11-19 00:09:21,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:09:21,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 456 [2024-11-19 00:09:21,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:09:21,153 INFO L225 Difference]: With dead ends: 16814 [2024-11-19 00:09:21,153 INFO L226 Difference]: Without dead ends: 11859 [2024-11-19 00:09:21,168 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:09:21,169 INFO L432 NwaCegarLoop]: 572 mSDtfsCounter, 599 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 1476 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:09:21,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 1476 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:09:21,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11859 states. [2024-11-19 00:09:21,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11859 to 9911. [2024-11-19 00:09:21,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9911 states, 8872 states have (on average 1.5547790802524797) internal successors, (13794), 8914 states have internal predecessors, (13794), 990 states have call successors, (990), 48 states have call predecessors, (990), 48 states have return successors, (990), 948 states have call predecessors, (990), 990 states have call successors, (990) [2024-11-19 00:09:21,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9911 states to 9911 states and 15774 transitions. [2024-11-19 00:09:21,587 INFO L78 Accepts]: Start accepts. Automaton has 9911 states and 15774 transitions. Word has length 456 [2024-11-19 00:09:21,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:09:21,588 INFO L471 AbstractCegarLoop]: Abstraction has 9911 states and 15774 transitions. [2024-11-19 00:09:21,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2024-11-19 00:09:21,589 INFO L276 IsEmpty]: Start isEmpty. Operand 9911 states and 15774 transitions. [2024-11-19 00:09:21,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2024-11-19 00:09:21,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:09:21,598 INFO L215 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:21,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 00:09:21,599 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:09:21,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:09:21,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1138531853, now seen corresponding path program 1 times [2024-11-19 00:09:21,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:09:21,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845622248] [2024-11-19 00:09:21,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:09:21,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:09:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:09:23,853 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2024-11-19 00:09:23,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:09:23,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845622248] [2024-11-19 00:09:23,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845622248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:09:23,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:09:23,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:09:23,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060913178] [2024-11-19 00:09:23,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:09:23,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:09:23,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:09:23,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:09:23,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:09:23,856 INFO L87 Difference]: Start difference. First operand 9911 states and 15774 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 4 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 4 states have call predecessors, (65), 4 states have call successors, (65) [2024-11-19 00:09:25,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:09:25,011 INFO L93 Difference]: Finished difference Result 19873 states and 31653 transitions. [2024-11-19 00:09:25,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:09:25,012 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 4 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 4 states have call predecessors, (65), 4 states have call successors, (65) Word has length 457 [2024-11-19 00:09:25,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:09:25,047 INFO L225 Difference]: With dead ends: 19873 [2024-11-19 00:09:25,047 INFO L226 Difference]: Without dead ends: 9965 [2024-11-19 00:09:25,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:09:25,070 INFO L432 NwaCegarLoop]: 433 mSDtfsCounter, 704 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:09:25,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 1022 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 00:09:25,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9965 states. [2024-11-19 00:09:25,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9965 to 9965. [2024-11-19 00:09:25,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9965 states, 8926 states have (on average 1.5514228097692135) internal successors, (13848), 8968 states have internal predecessors, (13848), 990 states have call successors, (990), 48 states have call predecessors, (990), 48 states have return successors, (990), 948 states have call predecessors, (990), 990 states have call successors, (990) [2024-11-19 00:09:25,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9965 states to 9965 states and 15828 transitions. [2024-11-19 00:09:25,501 INFO L78 Accepts]: Start accepts. Automaton has 9965 states and 15828 transitions. Word has length 457 [2024-11-19 00:09:25,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:09:25,502 INFO L471 AbstractCegarLoop]: Abstraction has 9965 states and 15828 transitions. [2024-11-19 00:09:25,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 4 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 4 states have call predecessors, (65), 4 states have call successors, (65) [2024-11-19 00:09:25,505 INFO L276 IsEmpty]: Start isEmpty. Operand 9965 states and 15828 transitions. [2024-11-19 00:09:25,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2024-11-19 00:09:25,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:09:25,515 INFO L215 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:25,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 00:09:25,515 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:09:25,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:09:25,516 INFO L85 PathProgramCache]: Analyzing trace with hash 896490889, now seen corresponding path program 1 times [2024-11-19 00:09:25,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:09:25,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71732456] [2024-11-19 00:09:25,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:09:25,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:09:25,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:09:26,486 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2024-11-19 00:09:26,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:09:26,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71732456] [2024-11-19 00:09:26,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71732456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:09:26,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:09:26,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:09:26,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748692269] [2024-11-19 00:09:26,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:09:26,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:09:26,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:09:26,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:09:26,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:09:26,488 INFO L87 Difference]: Start difference. First operand 9965 states and 15828 transitions. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2024-11-19 00:09:27,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:09:27,081 INFO L93 Difference]: Finished difference Result 25790 states and 40879 transitions. [2024-11-19 00:09:27,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:09:27,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 458 [2024-11-19 00:09:27,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:09:27,119 INFO L225 Difference]: With dead ends: 25790 [2024-11-19 00:09:27,119 INFO L226 Difference]: Without dead ends: 15828 [2024-11-19 00:09:27,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:09:27,140 INFO L432 NwaCegarLoop]: 455 mSDtfsCounter, 357 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 1647 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:09:27,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 1647 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:09:27,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15828 states. [2024-11-19 00:09:27,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15828 to 10153. [2024-11-19 00:09:27,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10153 states, 9048 states have (on average 1.5490716180371353) internal successors, (14016), 9090 states have internal predecessors, (14016), 1055 states have call successors, (1055), 49 states have call predecessors, (1055), 49 states have return successors, (1055), 1013 states have call predecessors, (1055), 1055 states have call successors, (1055) [2024-11-19 00:09:27,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10153 states to 10153 states and 16126 transitions. [2024-11-19 00:09:27,582 INFO L78 Accepts]: Start accepts. Automaton has 10153 states and 16126 transitions. Word has length 458 [2024-11-19 00:09:27,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:09:27,583 INFO L471 AbstractCegarLoop]: Abstraction has 10153 states and 16126 transitions. [2024-11-19 00:09:27,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2024-11-19 00:09:27,583 INFO L276 IsEmpty]: Start isEmpty. Operand 10153 states and 16126 transitions. [2024-11-19 00:09:27,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2024-11-19 00:09:27,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:09:27,593 INFO L215 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:27,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 00:09:27,593 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:09:27,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:09:27,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1014551669, now seen corresponding path program 1 times [2024-11-19 00:09:27,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:09:27,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362701914] [2024-11-19 00:09:27,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:09:27,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:09:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:09:28,433 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2024-11-19 00:09:28,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:09:28,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362701914] [2024-11-19 00:09:28,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362701914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:09:28,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:09:28,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 00:09:28,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335891247] [2024-11-19 00:09:28,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:09:28,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:09:28,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:09:28,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:09:28,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:09:28,436 INFO L87 Difference]: Start difference. First operand 10153 states and 16126 transitions. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2024-11-19 00:09:28,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:09:28,963 INFO L93 Difference]: Finished difference Result 25841 states and 40947 transitions. [2024-11-19 00:09:28,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 00:09:28,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 458 [2024-11-19 00:09:28,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:09:29,002 INFO L225 Difference]: With dead ends: 25841 [2024-11-19 00:09:29,002 INFO L226 Difference]: Without dead ends: 15825 [2024-11-19 00:09:29,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:09:29,026 INFO L432 NwaCegarLoop]: 457 mSDtfsCounter, 436 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 1683 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:09:29,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 1683 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:09:29,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15825 states. [2024-11-19 00:09:29,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15825 to 10150. [2024-11-19 00:09:29,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10150 states, 9045 states have (on average 1.5485903814262023) internal successors, (14007), 9087 states have internal predecessors, (14007), 1055 states have call successors, (1055), 49 states have call predecessors, (1055), 49 states have return successors, (1055), 1013 states have call predecessors, (1055), 1055 states have call successors, (1055) [2024-11-19 00:09:29,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10150 states to 10150 states and 16117 transitions. [2024-11-19 00:09:29,469 INFO L78 Accepts]: Start accepts. Automaton has 10150 states and 16117 transitions. Word has length 458 [2024-11-19 00:09:29,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:09:29,470 INFO L471 AbstractCegarLoop]: Abstraction has 10150 states and 16117 transitions. [2024-11-19 00:09:29,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2024-11-19 00:09:29,470 INFO L276 IsEmpty]: Start isEmpty. Operand 10150 states and 16117 transitions. [2024-11-19 00:09:29,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2024-11-19 00:09:29,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:09:29,482 INFO L215 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:29,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 00:09:29,482 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:09:29,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:09:29,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1225979253, now seen corresponding path program 1 times [2024-11-19 00:09:29,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:09:29,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538185477] [2024-11-19 00:09:29,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:09:29,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:09:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:09:33,287 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2024-11-19 00:09:33,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:09:33,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538185477] [2024-11-19 00:09:33,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538185477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:09:33,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:09:33,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 00:09:33,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799013828] [2024-11-19 00:09:33,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:09:33,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:09:33,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:09:33,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:09:33,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:09:33,290 INFO L87 Difference]: Start difference. First operand 10150 states and 16117 transitions. Second operand has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 states have internal predecessors, (136), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2024-11-19 00:09:35,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:09:35,987 INFO L93 Difference]: Finished difference Result 34132 states and 53594 transitions. [2024-11-19 00:09:35,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:09:35,988 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 states have internal predecessors, (136), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 458 [2024-11-19 00:09:35,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:09:36,036 INFO L225 Difference]: With dead ends: 34132 [2024-11-19 00:09:36,037 INFO L226 Difference]: Without dead ends: 24170 [2024-11-19 00:09:36,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2024-11-19 00:09:36,056 INFO L432 NwaCegarLoop]: 609 mSDtfsCounter, 2689 mSDsluCounter, 2198 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2689 SdHoareTripleChecker+Valid, 2807 SdHoareTripleChecker+Invalid, 1834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-19 00:09:36,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2689 Valid, 2807 Invalid, 1834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-19 00:09:36,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24170 states. [2024-11-19 00:09:36,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24170 to 21182. [2024-11-19 00:09:36,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21182 states, 19039 states have (on average 1.545721939177478) internal successors, (29429), 19123 states have internal predecessors, (29429), 2045 states have call successors, (2045), 97 states have call predecessors, (2045), 97 states have return successors, (2045), 1961 states have call predecessors, (2045), 2045 states have call successors, (2045) [2024-11-19 00:09:36,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21182 states to 21182 states and 33519 transitions. [2024-11-19 00:09:36,975 INFO L78 Accepts]: Start accepts. Automaton has 21182 states and 33519 transitions. Word has length 458 [2024-11-19 00:09:36,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:09:36,976 INFO L471 AbstractCegarLoop]: Abstraction has 21182 states and 33519 transitions. [2024-11-19 00:09:36,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 states have internal predecessors, (136), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2024-11-19 00:09:36,976 INFO L276 IsEmpty]: Start isEmpty. Operand 21182 states and 33519 transitions. [2024-11-19 00:09:37,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2024-11-19 00:09:37,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:09:37,001 INFO L215 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:37,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 00:09:37,002 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:09:37,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:09:37,002 INFO L85 PathProgramCache]: Analyzing trace with hash -951219639, now seen corresponding path program 1 times [2024-11-19 00:09:37,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:09:37,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505027448] [2024-11-19 00:09:37,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:09:37,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:09:37,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:09:37,597 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2024-11-19 00:09:37,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:09:37,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505027448] [2024-11-19 00:09:37,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505027448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:09:37,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:09:37,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:09:37,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27182014] [2024-11-19 00:09:37,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:09:37,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:09:37,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:09:37,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:09:37,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:09:37,600 INFO L87 Difference]: Start difference. First operand 21182 states and 33519 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2024-11-19 00:09:38,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:09:38,868 INFO L93 Difference]: Finished difference Result 73738 states and 116447 transitions. [2024-11-19 00:09:38,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:09:38,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 458 [2024-11-19 00:09:38,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:09:38,970 INFO L225 Difference]: With dead ends: 73738 [2024-11-19 00:09:38,970 INFO L226 Difference]: Without dead ends: 52670 [2024-11-19 00:09:39,006 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:09:39,007 INFO L432 NwaCegarLoop]: 596 mSDtfsCounter, 612 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:09:39,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 1499 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:09:39,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52670 states. [2024-11-19 00:09:41,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52670 to 42030. [2024-11-19 00:09:41,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42030 states, 37811 states have (on average 1.5443653963132422) internal successors, (58394), 37979 states have internal predecessors, (58394), 4025 states have call successors, (4025), 193 states have call predecessors, (4025), 193 states have return successors, (4025), 3857 states have call predecessors, (4025), 4025 states have call successors, (4025) [2024-11-19 00:09:41,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42030 states to 42030 states and 66444 transitions. [2024-11-19 00:09:41,195 INFO L78 Accepts]: Start accepts. Automaton has 42030 states and 66444 transitions. Word has length 458 [2024-11-19 00:09:41,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:09:41,195 INFO L471 AbstractCegarLoop]: Abstraction has 42030 states and 66444 transitions. [2024-11-19 00:09:41,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2024-11-19 00:09:41,196 INFO L276 IsEmpty]: Start isEmpty. Operand 42030 states and 66444 transitions. [2024-11-19 00:09:41,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2024-11-19 00:09:41,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:09:41,225 INFO L215 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:41,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 00:09:41,226 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:09:41,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:09:41,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1721953205, now seen corresponding path program 1 times [2024-11-19 00:09:41,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:09:41,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265476772] [2024-11-19 00:09:41,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:09:41,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:09:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:09:41,921 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2024-11-19 00:09:41,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:09:41,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265476772] [2024-11-19 00:09:41,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265476772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:09:41,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:09:41,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:09:41,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895347251] [2024-11-19 00:09:41,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:09:41,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:09:41,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:09:41,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:09:41,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:09:41,924 INFO L87 Difference]: Start difference. First operand 42030 states and 66444 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2024-11-19 00:09:43,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:09:43,201 INFO L93 Difference]: Finished difference Result 106021 states and 167037 transitions. [2024-11-19 00:09:43,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:09:43,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 458 [2024-11-19 00:09:43,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:09:43,332 INFO L225 Difference]: With dead ends: 106021 [2024-11-19 00:09:43,332 INFO L226 Difference]: Without dead ends: 64116 [2024-11-19 00:09:43,413 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:09:43,414 INFO L432 NwaCegarLoop]: 458 mSDtfsCounter, 498 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 1361 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:09:43,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 1361 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:09:43,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64116 states. [2024-11-19 00:09:45,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64116 to 42030. [2024-11-19 00:09:45,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42030 states, 37811 states have (on average 1.544286054322816) internal successors, (58391), 37979 states have internal predecessors, (58391), 4025 states have call successors, (4025), 193 states have call predecessors, (4025), 193 states have return successors, (4025), 3857 states have call predecessors, (4025), 4025 states have call successors, (4025) [2024-11-19 00:09:45,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42030 states to 42030 states and 66441 transitions. [2024-11-19 00:09:45,539 INFO L78 Accepts]: Start accepts. Automaton has 42030 states and 66441 transitions. Word has length 458 [2024-11-19 00:09:45,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:09:45,540 INFO L471 AbstractCegarLoop]: Abstraction has 42030 states and 66441 transitions. [2024-11-19 00:09:45,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2024-11-19 00:09:45,540 INFO L276 IsEmpty]: Start isEmpty. Operand 42030 states and 66441 transitions. [2024-11-19 00:09:45,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2024-11-19 00:09:45,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:09:45,564 INFO L215 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:45,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 00:09:45,565 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:09:45,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:09:45,565 INFO L85 PathProgramCache]: Analyzing trace with hash 693883145, now seen corresponding path program 1 times [2024-11-19 00:09:45,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:09:45,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528265753] [2024-11-19 00:09:45,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:09:45,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:09:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:09:46,130 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2024-11-19 00:09:46,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:09:46,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528265753] [2024-11-19 00:09:46,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528265753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:09:46,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:09:46,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:09:46,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755743021] [2024-11-19 00:09:46,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:09:46,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:09:46,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:09:46,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:09:46,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:09:46,133 INFO L87 Difference]: Start difference. First operand 42030 states and 66441 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2024-11-19 00:09:50,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:09:50,097 INFO L93 Difference]: Finished difference Result 138740 states and 219136 transitions. [2024-11-19 00:09:50,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:09:50,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 458 [2024-11-19 00:09:50,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:09:50,308 INFO L225 Difference]: With dead ends: 138740 [2024-11-19 00:09:50,309 INFO L226 Difference]: Without dead ends: 96898 [2024-11-19 00:09:50,387 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:09:50,388 INFO L432 NwaCegarLoop]: 627 mSDtfsCounter, 832 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 832 SdHoareTripleChecker+Valid, 1486 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:09:50,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [832 Valid, 1486 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:09:50,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96898 states. [2024-11-19 00:09:55,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96898 to 95814. [2024-11-19 00:09:55,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95814 states, 85714 states have (on average 1.5392001306671022) internal successors, (131931), 86138 states have internal predecessors, (131931), 9617 states have call successors, (9617), 482 states have call predecessors, (9617), 482 states have return successors, (9617), 9193 states have call predecessors, (9617), 9617 states have call successors, (9617) [2024-11-19 00:09:55,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95814 states to 95814 states and 151165 transitions. [2024-11-19 00:09:55,359 INFO L78 Accepts]: Start accepts. Automaton has 95814 states and 151165 transitions. Word has length 458 [2024-11-19 00:09:55,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:09:55,360 INFO L471 AbstractCegarLoop]: Abstraction has 95814 states and 151165 transitions. [2024-11-19 00:09:55,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2024-11-19 00:09:55,360 INFO L276 IsEmpty]: Start isEmpty. Operand 95814 states and 151165 transitions. [2024-11-19 00:09:55,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2024-11-19 00:09:55,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:09:55,431 INFO L215 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:55,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 00:09:55,432 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:09:55,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:09:55,432 INFO L85 PathProgramCache]: Analyzing trace with hash 2041183381, now seen corresponding path program 1 times [2024-11-19 00:09:55,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:09:55,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644392813] [2024-11-19 00:09:55,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:09:55,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:09:55,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:09:56,021 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2024-11-19 00:09:56,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:09:56,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644392813] [2024-11-19 00:09:56,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644392813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:09:56,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:09:56,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:09:56,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660733583] [2024-11-19 00:09:56,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:09:56,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:09:56,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:09:56,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:09:56,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:09:56,023 INFO L87 Difference]: Start difference. First operand 95814 states and 151165 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65)