./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label05.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f95bc0400f9e54d231740d68b8f60687442b1216917c3afc522bda656e30c0ed --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:58:51,105 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:58:51,192 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:58:51,196 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:58:51,196 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:58:51,227 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:58:51,228 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:58:51,228 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:58:51,229 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:58:51,230 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:58:51,231 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:58:51,231 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:58:51,232 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:58:51,236 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:58:51,236 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:58:51,237 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:58:51,237 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:58:51,237 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:58:51,237 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:58:51,237 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:58:51,238 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:58:51,240 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:58:51,240 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:58:51,241 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:58:51,241 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:58:51,241 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:58:51,241 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:58:51,241 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:58:51,242 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:58:51,242 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:58:51,242 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:58:51,242 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:58:51,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:58:51,243 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:58:51,243 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:58:51,243 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:58:51,243 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:58:51,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:58:51,244 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:58:51,245 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:58:51,246 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:58:51,246 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:58:51,246 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 -> f95bc0400f9e54d231740d68b8f60687442b1216917c3afc522bda656e30c0ed [2024-11-10 00:58:51,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:58:51,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:58:51,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:58:51,516 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:58:51,517 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:58:51,518 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label05.c [2024-11-10 00:58:52,960 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:58:53,435 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:58:53,437 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label05.c [2024-11-10 00:58:53,483 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d130a92e/131ceaeb76a34f799292e2b15e404d7f/FLAG2d15a0fc4 [2024-11-10 00:58:53,502 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d130a92e/131ceaeb76a34f799292e2b15e404d7f [2024-11-10 00:58:53,505 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:58:53,508 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:58:53,511 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:58:53,511 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:58:53,517 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:58:53,518 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:58:53" (1/1) ... [2024-11-10 00:58:53,519 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61186348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:58:53, skipping insertion in model container [2024-11-10 00:58:53,519 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:58:53" (1/1) ... [2024-11-10 00:58:53,642 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:58:54,037 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label05.c[15510,15523] [2024-11-10 00:58:54,113 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label05.c[22446,22459] [2024-11-10 00:58:54,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:58:54,788 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:58:54,835 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label05.c[15510,15523] [2024-11-10 00:58:54,845 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label05.c[22446,22459] [2024-11-10 00:58:55,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:58:55,345 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:58:55,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:58:55 WrapperNode [2024-11-10 00:58:55,346 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:58:55,347 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:58:55,347 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:58:55,347 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:58:55,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:58:55" (1/1) ... [2024-11-10 00:58:55,423 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:58:55" (1/1) ... [2024-11-10 00:58:55,664 INFO L138 Inliner]: procedures = 38, calls = 23, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 5155 [2024-11-10 00:58:55,665 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:58:55,666 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:58:55,666 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:58:55,666 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:58:55,676 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:58:55" (1/1) ... [2024-11-10 00:58:55,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:58:55" (1/1) ... [2024-11-10 00:58:55,834 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:58:55" (1/1) ... [2024-11-10 00:58:55,989 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-10 00:58:55,990 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:58:55" (1/1) ... [2024-11-10 00:58:55,990 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:58:55" (1/1) ... [2024-11-10 00:58:56,177 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:58:55" (1/1) ... [2024-11-10 00:58:56,202 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:58:55" (1/1) ... [2024-11-10 00:58:56,224 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:58:55" (1/1) ... [2024-11-10 00:58:56,243 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:58:55" (1/1) ... [2024-11-10 00:58:56,311 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:58:56,312 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:58:56,312 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:58:56,312 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:58:56,314 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:58:55" (1/1) ... [2024-11-10 00:58:56,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:58:56,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:58:56,349 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-10 00:58:56,354 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-10 00:58:56,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:58:56,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:58:56,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:58:56,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:58:56,522 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:58:56,525 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:59:01,955 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3685: havoc calculate_output2_#t~ret42#1; [2024-11-10 00:59:01,956 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5175: havoc calculate_output3_#t~ret43#1; [2024-11-10 00:59:01,956 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2206: havoc calculate_output_#t~ret41#1; [2024-11-10 00:59:02,355 INFO L? ?]: Removed 2086 outVars from TransFormulas that were not future-live. [2024-11-10 00:59:02,356 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:59:02,401 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:59:02,404 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:59:02,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:59:02 BoogieIcfgContainer [2024-11-10 00:59:02,405 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:59:02,407 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:59:02,407 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:59:02,410 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:59:02,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:58:53" (1/3) ... [2024-11-10 00:59:02,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55a2edde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:59:02, skipping insertion in model container [2024-11-10 00:59:02,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:58:55" (2/3) ... [2024-11-10 00:59:02,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55a2edde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:59:02, skipping insertion in model container [2024-11-10 00:59:02,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:59:02" (3/3) ... [2024-11-10 00:59:02,413 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label05.c [2024-11-10 00:59:02,429 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:59:02,430 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 00:59:02,541 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:59:02,549 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;@4909292a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:59:02,550 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 00:59:02,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 923 states, 920 states have (on average 2.635869565217391) internal successors, (2425), 922 states have internal predecessors, (2425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:02,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 00:59:02,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:02,568 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:59:02,568 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:02,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:02,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1166387314, now seen corresponding path program 1 times [2024-11-10 00:59:02,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:02,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684282049] [2024-11-10 00:59:02,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:02,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:02,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:02,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:02,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684282049] [2024-11-10 00:59:02,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684282049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:02,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:02,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:59:02,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539321424] [2024-11-10 00:59:02,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:02,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 00:59:02,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:02,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 00:59:02,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:59:02,870 INFO L87 Difference]: Start difference. First operand has 923 states, 920 states have (on average 2.635869565217391) internal successors, (2425), 922 states have internal predecessors, (2425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:02,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:02,978 INFO L93 Difference]: Finished difference Result 1796 states and 4758 transitions. [2024-11-10 00:59:02,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 00:59:02,984 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-10 00:59:02,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:03,005 INFO L225 Difference]: With dead ends: 1796 [2024-11-10 00:59:03,005 INFO L226 Difference]: Without dead ends: 855 [2024-11-10 00:59:03,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:59:03,014 INFO L432 NwaCegarLoop]: 2354 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, 2354 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-10 00:59:03,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2354 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:59:03,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2024-11-10 00:59:03,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2024-11-10 00:59:03,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 853 states have (on average 2.6846424384525207) internal successors, (2290), 854 states have internal predecessors, (2290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:03,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 2290 transitions. [2024-11-10 00:59:03,123 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 2290 transitions. Word has length 28 [2024-11-10 00:59:03,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:03,123 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 2290 transitions. [2024-11-10 00:59:03,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:03,125 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 2290 transitions. [2024-11-10 00:59:03,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 00:59:03,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:03,126 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:59:03,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:59:03,127 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:03,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:03,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1090523693, now seen corresponding path program 1 times [2024-11-10 00:59:03,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:03,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208565000] [2024-11-10 00:59:03,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:03,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:03,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:03,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:03,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:03,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208565000] [2024-11-10 00:59:03,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208565000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:03,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:03,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:59:03,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750426141] [2024-11-10 00:59:03,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:03,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:59:03,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:03,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:59:03,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:59:03,437 INFO L87 Difference]: Start difference. First operand 855 states and 2290 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:03,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:03,596 INFO L93 Difference]: Finished difference Result 912 states and 2377 transitions. [2024-11-10 00:59:03,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:59:03,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-10 00:59:03,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:03,602 INFO L225 Difference]: With dead ends: 912 [2024-11-10 00:59:03,602 INFO L226 Difference]: Without dead ends: 855 [2024-11-10 00:59:03,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:59:03,604 INFO L432 NwaCegarLoop]: 2288 mSDtfsCounter, 0 mSDsluCounter, 6819 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9107 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:03,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9107 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:59:03,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2024-11-10 00:59:03,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2024-11-10 00:59:03,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 853 states have (on average 2.637749120750293) internal successors, (2250), 854 states have internal predecessors, (2250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:03,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 2250 transitions. [2024-11-10 00:59:03,636 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 2250 transitions. Word has length 28 [2024-11-10 00:59:03,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:03,637 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 2250 transitions. [2024-11-10 00:59:03,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:03,637 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 2250 transitions. [2024-11-10 00:59:03,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 00:59:03,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:03,641 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:59:03,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:59:03,641 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:03,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:03,643 INFO L85 PathProgramCache]: Analyzing trace with hash -852741113, now seen corresponding path program 1 times [2024-11-10 00:59:03,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:03,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913304793] [2024-11-10 00:59:03,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:03,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:03,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:03,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:03,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913304793] [2024-11-10 00:59:03,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913304793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:03,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:03,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:03,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579115451] [2024-11-10 00:59:03,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:03,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:59:03,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:03,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:59:03,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:59:03,872 INFO L87 Difference]: Start difference. First operand 855 states and 2250 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:12,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:12,147 INFO L93 Difference]: Finished difference Result 3114 states and 8603 transitions. [2024-11-10 00:59:12,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 00:59:12,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-10 00:59:12,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:12,160 INFO L225 Difference]: With dead ends: 3114 [2024-11-10 00:59:12,161 INFO L226 Difference]: Without dead ends: 2359 [2024-11-10 00:59:12,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:59:12,163 INFO L432 NwaCegarLoop]: 824 mSDtfsCounter, 4481 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 8238 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4481 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 9338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 8238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:12,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4481 Valid, 847 Invalid, 9338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 8238 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2024-11-10 00:59:12,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2359 states. [2024-11-10 00:59:12,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2359 to 2359. [2024-11-10 00:59:12,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2359 states, 2357 states have (on average 2.4344505727619854) internal successors, (5738), 2358 states have internal predecessors, (5738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:12,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 2359 states and 5738 transitions. [2024-11-10 00:59:12,238 INFO L78 Accepts]: Start accepts. Automaton has 2359 states and 5738 transitions. Word has length 62 [2024-11-10 00:59:12,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:12,240 INFO L471 AbstractCegarLoop]: Abstraction has 2359 states and 5738 transitions. [2024-11-10 00:59:12,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:12,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2359 states and 5738 transitions. [2024-11-10 00:59:12,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 00:59:12,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:12,245 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:59:12,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:59:12,246 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:12,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:12,247 INFO L85 PathProgramCache]: Analyzing trace with hash 165928225, now seen corresponding path program 1 times [2024-11-10 00:59:12,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:12,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604287490] [2024-11-10 00:59:12,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:12,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:12,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:12,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:12,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:12,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604287490] [2024-11-10 00:59:12,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604287490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:12,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:12,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:59:12,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958757346] [2024-11-10 00:59:12,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:12,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:59:12,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:12,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:59:12,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:59:12,541 INFO L87 Difference]: Start difference. First operand 2359 states and 5738 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:12,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:12,907 INFO L93 Difference]: Finished difference Result 2995 states and 6734 transitions. [2024-11-10 00:59:12,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 00:59:12,908 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-10 00:59:12,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:12,921 INFO L225 Difference]: With dead ends: 2995 [2024-11-10 00:59:12,922 INFO L226 Difference]: Without dead ends: 2942 [2024-11-10 00:59:12,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2024-11-10 00:59:12,925 INFO L432 NwaCegarLoop]: 2244 mSDtfsCounter, 13988 mSDsluCounter, 1586 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13988 SdHoareTripleChecker+Valid, 3830 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:12,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13988 Valid, 3830 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:59:12,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2024-11-10 00:59:12,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 2409. [2024-11-10 00:59:13,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2409 states, 2407 states have (on average 2.4167012879102616) internal successors, (5817), 2408 states have internal predecessors, (5817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:13,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2409 states to 2409 states and 5817 transitions. [2024-11-10 00:59:13,010 INFO L78 Accepts]: Start accepts. Automaton has 2409 states and 5817 transitions. Word has length 67 [2024-11-10 00:59:13,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:13,012 INFO L471 AbstractCegarLoop]: Abstraction has 2409 states and 5817 transitions. [2024-11-10 00:59:13,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:13,013 INFO L276 IsEmpty]: Start isEmpty. Operand 2409 states and 5817 transitions. [2024-11-10 00:59:13,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:59:13,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:13,017 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:59:13,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:59:13,017 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:13,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:13,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1462372477, now seen corresponding path program 1 times [2024-11-10 00:59:13,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:13,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531988772] [2024-11-10 00:59:13,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:13,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:13,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:13,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:13,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531988772] [2024-11-10 00:59:13,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531988772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:13,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:13,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:59:13,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572023655] [2024-11-10 00:59:13,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:13,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:59:13,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:13,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:59:13,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:59:13,442 INFO L87 Difference]: Start difference. First operand 2409 states and 5817 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:13,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:13,734 INFO L93 Difference]: Finished difference Result 2515 states and 5981 transitions. [2024-11-10 00:59:13,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:59:13,735 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-10 00:59:13,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:13,746 INFO L225 Difference]: With dead ends: 2515 [2024-11-10 00:59:13,747 INFO L226 Difference]: Without dead ends: 2412 [2024-11-10 00:59:13,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-11-10 00:59:13,750 INFO L432 NwaCegarLoop]: 2242 mSDtfsCounter, 8756 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8756 SdHoareTripleChecker+Valid, 2640 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:13,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8756 Valid, 2640 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:59:13,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2412 states. [2024-11-10 00:59:13,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2412 to 2409. [2024-11-10 00:59:13,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2409 states, 2407 states have (on average 2.416285832987121) internal successors, (5816), 2408 states have internal predecessors, (5816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:13,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2409 states to 2409 states and 5816 transitions. [2024-11-10 00:59:13,819 INFO L78 Accepts]: Start accepts. Automaton has 2409 states and 5816 transitions. Word has length 69 [2024-11-10 00:59:13,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:13,820 INFO L471 AbstractCegarLoop]: Abstraction has 2409 states and 5816 transitions. [2024-11-10 00:59:13,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:13,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2409 states and 5816 transitions. [2024-11-10 00:59:13,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-10 00:59:13,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:13,823 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:59:13,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:59:13,823 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:13,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:13,824 INFO L85 PathProgramCache]: Analyzing trace with hash -660054622, now seen corresponding path program 1 times [2024-11-10 00:59:13,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:13,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834103663] [2024-11-10 00:59:13,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:13,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:13,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:13,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:13,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834103663] [2024-11-10 00:59:13,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834103663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:13,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:13,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:13,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118322746] [2024-11-10 00:59:13,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:13,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:13,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:13,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:13,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:13,956 INFO L87 Difference]: Start difference. First operand 2409 states and 5816 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:14,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:14,007 INFO L93 Difference]: Finished difference Result 2603 states and 6118 transitions. [2024-11-10 00:59:14,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:14,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-10 00:59:14,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:14,019 INFO L225 Difference]: With dead ends: 2603 [2024-11-10 00:59:14,019 INFO L226 Difference]: Without dead ends: 2500 [2024-11-10 00:59:14,021 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-10 00:59:14,022 INFO L432 NwaCegarLoop]: 2246 mSDtfsCounter, 2176 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2176 SdHoareTripleChecker+Valid, 2322 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:14,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2176 Valid, 2322 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:59:14,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2500 states. [2024-11-10 00:59:14,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2500 to 2495. [2024-11-10 00:59:14,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2495 states, 2493 states have (on average 2.385880465302848) internal successors, (5948), 2494 states have internal predecessors, (5948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:14,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 5948 transitions. [2024-11-10 00:59:14,085 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 5948 transitions. Word has length 70 [2024-11-10 00:59:14,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:14,085 INFO L471 AbstractCegarLoop]: Abstraction has 2495 states and 5948 transitions. [2024-11-10 00:59:14,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:14,086 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 5948 transitions. [2024-11-10 00:59:14,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:59:14,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:14,087 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:59:14,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:59:14,087 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:14,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:14,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1454056645, now seen corresponding path program 1 times [2024-11-10 00:59:14,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:14,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346329064] [2024-11-10 00:59:14,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:14,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:14,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:14,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:14,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346329064] [2024-11-10 00:59:14,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346329064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:14,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:14,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:14,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517321844] [2024-11-10 00:59:14,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:14,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:14,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:14,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:14,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:14,158 INFO L87 Difference]: Start difference. First operand 2495 states and 5948 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:14,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:14,198 INFO L93 Difference]: Finished difference Result 2857 states and 6506 transitions. [2024-11-10 00:59:14,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:14,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-10 00:59:14,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:14,210 INFO L225 Difference]: With dead ends: 2857 [2024-11-10 00:59:14,210 INFO L226 Difference]: Without dead ends: 2668 [2024-11-10 00:59:14,212 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-10 00:59:14,212 INFO L432 NwaCegarLoop]: 2299 mSDtfsCounter, 2189 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2189 SdHoareTripleChecker+Valid, 2391 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:14,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2189 Valid, 2391 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:59:14,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2024-11-10 00:59:14,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 2665. [2024-11-10 00:59:14,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2665 states, 2663 states have (on average 2.330829891100263) internal successors, (6207), 2664 states have internal predecessors, (6207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:14,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2665 states to 2665 states and 6207 transitions. [2024-11-10 00:59:14,277 INFO L78 Accepts]: Start accepts. Automaton has 2665 states and 6207 transitions. Word has length 71 [2024-11-10 00:59:14,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:14,278 INFO L471 AbstractCegarLoop]: Abstraction has 2665 states and 6207 transitions. [2024-11-10 00:59:14,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:14,278 INFO L276 IsEmpty]: Start isEmpty. Operand 2665 states and 6207 transitions. [2024-11-10 00:59:14,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:59:14,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:14,279 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:59:14,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:59:14,280 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:14,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:14,280 INFO L85 PathProgramCache]: Analyzing trace with hash 452646917, now seen corresponding path program 1 times [2024-11-10 00:59:14,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:14,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551232812] [2024-11-10 00:59:14,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:14,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:14,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:14,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:14,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551232812] [2024-11-10 00:59:14,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551232812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:14,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:14,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:14,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644772844] [2024-11-10 00:59:14,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:14,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:14,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:14,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:14,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:14,344 INFO L87 Difference]: Start difference. First operand 2665 states and 6207 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:14,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:14,389 INFO L93 Difference]: Finished difference Result 3351 states and 7255 transitions. [2024-11-10 00:59:14,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:14,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-10 00:59:14,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:14,403 INFO L225 Difference]: With dead ends: 3351 [2024-11-10 00:59:14,403 INFO L226 Difference]: Without dead ends: 2992 [2024-11-10 00:59:14,405 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-10 00:59:14,407 INFO L432 NwaCegarLoop]: 2297 mSDtfsCounter, 2187 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2187 SdHoareTripleChecker+Valid, 2393 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:14,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2187 Valid, 2393 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:59:14,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2992 states. [2024-11-10 00:59:14,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2992 to 2989. [2024-11-10 00:59:14,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2989 states, 2987 states have (on average 2.2407097422162705) internal successors, (6693), 2988 states have internal predecessors, (6693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:14,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2989 states and 6693 transitions. [2024-11-10 00:59:14,539 INFO L78 Accepts]: Start accepts. Automaton has 2989 states and 6693 transitions. Word has length 71 [2024-11-10 00:59:14,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:14,540 INFO L471 AbstractCegarLoop]: Abstraction has 2989 states and 6693 transitions. [2024-11-10 00:59:14,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:14,540 INFO L276 IsEmpty]: Start isEmpty. Operand 2989 states and 6693 transitions. [2024-11-10 00:59:14,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:59:14,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:14,541 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:59:14,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:59:14,541 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:14,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:14,541 INFO L85 PathProgramCache]: Analyzing trace with hash 438197061, now seen corresponding path program 1 times [2024-11-10 00:59:14,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:14,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827702263] [2024-11-10 00:59:14,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:14,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:14,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:14,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:14,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827702263] [2024-11-10 00:59:14,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827702263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:14,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:14,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:14,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065264150] [2024-11-10 00:59:14,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:14,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:14,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:14,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:14,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:14,620 INFO L87 Difference]: Start difference. First operand 2989 states and 6693 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:14,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:14,679 INFO L93 Difference]: Finished difference Result 4291 states and 8657 transitions. [2024-11-10 00:59:14,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:14,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-10 00:59:14,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:14,710 INFO L225 Difference]: With dead ends: 4291 [2024-11-10 00:59:14,710 INFO L226 Difference]: Without dead ends: 3608 [2024-11-10 00:59:14,713 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-10 00:59:14,715 INFO L432 NwaCegarLoop]: 2295 mSDtfsCounter, 2185 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2185 SdHoareTripleChecker+Valid, 2395 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:14,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2185 Valid, 2395 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:59:14,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3608 states. [2024-11-10 00:59:14,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3608 to 3605. [2024-11-10 00:59:14,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3605 states, 3603 states have (on average 2.109630863169581) internal successors, (7601), 3604 states have internal predecessors, (7601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:14,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3605 states to 3605 states and 7601 transitions. [2024-11-10 00:59:14,822 INFO L78 Accepts]: Start accepts. Automaton has 3605 states and 7601 transitions. Word has length 71 [2024-11-10 00:59:14,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:14,822 INFO L471 AbstractCegarLoop]: Abstraction has 3605 states and 7601 transitions. [2024-11-10 00:59:14,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:14,823 INFO L276 IsEmpty]: Start isEmpty. Operand 3605 states and 7601 transitions. [2024-11-10 00:59:14,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:59:14,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:14,824 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:59:14,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:59:14,825 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:14,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:14,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1765167483, now seen corresponding path program 1 times [2024-11-10 00:59:14,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:14,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383065144] [2024-11-10 00:59:14,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:14,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:14,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:14,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:14,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383065144] [2024-11-10 00:59:14,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383065144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:14,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:14,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:14,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601834911] [2024-11-10 00:59:14,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:14,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:14,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:14,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:14,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:14,903 INFO L87 Difference]: Start difference. First operand 3605 states and 7601 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:14,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:14,974 INFO L93 Difference]: Finished difference Result 6075 states and 11269 transitions. [2024-11-10 00:59:14,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:14,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-10 00:59:14,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:14,987 INFO L225 Difference]: With dead ends: 6075 [2024-11-10 00:59:14,988 INFO L226 Difference]: Without dead ends: 4776 [2024-11-10 00:59:14,991 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-10 00:59:14,992 INFO L432 NwaCegarLoop]: 2293 mSDtfsCounter, 2183 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2183 SdHoareTripleChecker+Valid, 2397 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:14,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2183 Valid, 2397 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:59:14,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4776 states. [2024-11-10 00:59:15,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4776 to 4773. [2024-11-10 00:59:15,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4773 states, 4771 states have (on average 1.9469712848459442) internal successors, (9289), 4772 states have internal predecessors, (9289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:15,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4773 states to 4773 states and 9289 transitions. [2024-11-10 00:59:15,117 INFO L78 Accepts]: Start accepts. Automaton has 4773 states and 9289 transitions. Word has length 71 [2024-11-10 00:59:15,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:15,118 INFO L471 AbstractCegarLoop]: Abstraction has 4773 states and 9289 transitions. [2024-11-10 00:59:15,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:15,118 INFO L276 IsEmpty]: Start isEmpty. Operand 4773 states and 9289 transitions. [2024-11-10 00:59:15,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:59:15,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:15,119 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:59:15,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:59:15,120 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:15,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:15,120 INFO L85 PathProgramCache]: Analyzing trace with hash 2005522758, now seen corresponding path program 1 times [2024-11-10 00:59:15,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:15,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222128648] [2024-11-10 00:59:15,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:15,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:15,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:15,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:15,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:15,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222128648] [2024-11-10 00:59:15,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222128648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:15,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:15,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:59:15,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796802939] [2024-11-10 00:59:15,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:15,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:59:15,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:15,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:59:15,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:59:15,367 INFO L87 Difference]: Start difference. First operand 4773 states and 9289 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:15,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:15,485 INFO L93 Difference]: Finished difference Result 4872 states and 9419 transitions. [2024-11-10 00:59:15,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:59:15,486 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-10 00:59:15,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:15,499 INFO L225 Difference]: With dead ends: 4872 [2024-11-10 00:59:15,500 INFO L226 Difference]: Without dead ends: 4869 [2024-11-10 00:59:15,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:59:15,503 INFO L432 NwaCegarLoop]: 2244 mSDtfsCounter, 0 mSDsluCounter, 13451 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15695 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:15,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15695 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:59:15,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4869 states. [2024-11-10 00:59:15,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4869 to 4869. [2024-11-10 00:59:15,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4869 states, 4867 states have (on average 1.9250051366344771) internal successors, (9369), 4868 states have internal predecessors, (9369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:15,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4869 states to 4869 states and 9369 transitions. [2024-11-10 00:59:15,626 INFO L78 Accepts]: Start accepts. Automaton has 4869 states and 9369 transitions. Word has length 71 [2024-11-10 00:59:15,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:15,627 INFO L471 AbstractCegarLoop]: Abstraction has 4869 states and 9369 transitions. [2024-11-10 00:59:15,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:15,627 INFO L276 IsEmpty]: Start isEmpty. Operand 4869 states and 9369 transitions. [2024-11-10 00:59:15,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 00:59:15,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:15,628 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:59:15,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:59:15,628 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:15,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:15,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1736130949, now seen corresponding path program 1 times [2024-11-10 00:59:15,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:15,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012391919] [2024-11-10 00:59:15,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:15,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:15,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:15,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:15,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012391919] [2024-11-10 00:59:15,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012391919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:15,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:15,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:15,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796210921] [2024-11-10 00:59:15,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:15,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:15,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:15,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:15,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:15,696 INFO L87 Difference]: Start difference. First operand 4869 states and 9369 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:15,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:15,794 INFO L93 Difference]: Finished difference Result 9739 states and 16349 transitions. [2024-11-10 00:59:15,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:15,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-10 00:59:15,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:15,809 INFO L225 Difference]: With dead ends: 9739 [2024-11-10 00:59:15,809 INFO L226 Difference]: Without dead ends: 7176 [2024-11-10 00:59:15,815 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-10 00:59:15,816 INFO L432 NwaCegarLoop]: 2309 mSDtfsCounter, 2191 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2191 SdHoareTripleChecker+Valid, 2397 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:15,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2191 Valid, 2397 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:59:15,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7176 states. [2024-11-10 00:59:16,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7176 to 7173. [2024-11-10 00:59:16,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7173 states, 7171 states have (on average 1.7527541486543021) internal successors, (12569), 7172 states have internal predecessors, (12569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:16,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7173 states to 7173 states and 12569 transitions. [2024-11-10 00:59:16,059 INFO L78 Accepts]: Start accepts. Automaton has 7173 states and 12569 transitions. Word has length 71 [2024-11-10 00:59:16,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:16,059 INFO L471 AbstractCegarLoop]: Abstraction has 7173 states and 12569 transitions. [2024-11-10 00:59:16,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:16,059 INFO L276 IsEmpty]: Start isEmpty. Operand 7173 states and 12569 transitions. [2024-11-10 00:59:16,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-10 00:59:16,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:16,060 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:59:16,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:59:16,061 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:16,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:16,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1729014533, now seen corresponding path program 1 times [2024-11-10 00:59:16,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:16,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9241558] [2024-11-10 00:59:16,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:16,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:16,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:16,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:16,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9241558] [2024-11-10 00:59:16,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9241558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:16,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:16,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:16,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555085788] [2024-11-10 00:59:16,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:16,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:16,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:16,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:16,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:16,126 INFO L87 Difference]: Start difference. First operand 7173 states and 12569 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:16,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:16,262 INFO L93 Difference]: Finished difference Result 12303 states and 19938 transitions. [2024-11-10 00:59:16,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:16,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-11-10 00:59:16,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:16,283 INFO L225 Difference]: With dead ends: 12303 [2024-11-10 00:59:16,284 INFO L226 Difference]: Without dead ends: 9547 [2024-11-10 00:59:16,292 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-10 00:59:16,293 INFO L432 NwaCegarLoop]: 2314 mSDtfsCounter, 2190 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2190 SdHoareTripleChecker+Valid, 2398 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:16,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2190 Valid, 2398 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:59:16,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9547 states. [2024-11-10 00:59:16,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9547 to 9544. [2024-11-10 00:59:16,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9544 states, 9542 states have (on average 1.6629637392580172) internal successors, (15868), 9543 states have internal predecessors, (15868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:16,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9544 states to 9544 states and 15868 transitions. [2024-11-10 00:59:16,549 INFO L78 Accepts]: Start accepts. Automaton has 9544 states and 15868 transitions. Word has length 73 [2024-11-10 00:59:16,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:16,550 INFO L471 AbstractCegarLoop]: Abstraction has 9544 states and 15868 transitions. [2024-11-10 00:59:16,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:16,550 INFO L276 IsEmpty]: Start isEmpty. Operand 9544 states and 15868 transitions. [2024-11-10 00:59:16,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:59:16,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:16,554 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:59:16,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:59:16,554 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:16,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:16,555 INFO L85 PathProgramCache]: Analyzing trace with hash 8683955, now seen corresponding path program 1 times [2024-11-10 00:59:16,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:16,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930899829] [2024-11-10 00:59:16,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:16,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:16,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:16,768 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 00:59:16,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:16,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930899829] [2024-11-10 00:59:16,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930899829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:16,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:16,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:59:16,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308987303] [2024-11-10 00:59:16,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:16,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:59:16,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:16,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:59:16,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:59:16,772 INFO L87 Difference]: Start difference. First operand 9544 states and 15868 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:17,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:17,748 INFO L93 Difference]: Finished difference Result 54493 states and 79210 transitions. [2024-11-10 00:59:17,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:59:17,749 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-10 00:59:17,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:17,852 INFO L225 Difference]: With dead ends: 54493 [2024-11-10 00:59:17,852 INFO L226 Difference]: Without dead ends: 47258 [2024-11-10 00:59:17,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:59:17,881 INFO L432 NwaCegarLoop]: 2332 mSDtfsCounter, 11542 mSDsluCounter, 2965 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11542 SdHoareTripleChecker+Valid, 5297 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:17,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11542 Valid, 5297 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:59:17,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47258 states. [2024-11-10 00:59:18,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47258 to 16776. [2024-11-10 00:59:18,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16776 states, 16774 states have (on average 1.548825563371885) internal successors, (25980), 16775 states have internal predecessors, (25980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:18,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16776 states to 16776 states and 25980 transitions. [2024-11-10 00:59:18,828 INFO L78 Accepts]: Start accepts. Automaton has 16776 states and 25980 transitions. Word has length 94 [2024-11-10 00:59:18,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:18,828 INFO L471 AbstractCegarLoop]: Abstraction has 16776 states and 25980 transitions. [2024-11-10 00:59:18,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:18,829 INFO L276 IsEmpty]: Start isEmpty. Operand 16776 states and 25980 transitions. [2024-11-10 00:59:18,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:59:18,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:18,833 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:59:18,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:59:18,834 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:18,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:18,834 INFO L85 PathProgramCache]: Analyzing trace with hash -992725773, now seen corresponding path program 1 times [2024-11-10 00:59:18,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:18,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437415864] [2024-11-10 00:59:18,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:18,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:18,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:19,055 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 00:59:19,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:19,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437415864] [2024-11-10 00:59:19,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437415864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:19,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:19,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:59:19,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302064682] [2024-11-10 00:59:19,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:19,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:59:19,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:19,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:59:19,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:59:19,057 INFO L87 Difference]: Start difference. First operand 16776 states and 25980 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:20,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:20,189 INFO L93 Difference]: Finished difference Result 61725 states and 89322 transitions. [2024-11-10 00:59:20,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:59:20,191 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-10 00:59:20,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:20,306 INFO L225 Difference]: With dead ends: 61725 [2024-11-10 00:59:20,306 INFO L226 Difference]: Without dead ends: 54490 [2024-11-10 00:59:20,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:59:20,332 INFO L432 NwaCegarLoop]: 2328 mSDtfsCounter, 11598 mSDsluCounter, 2861 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11598 SdHoareTripleChecker+Valid, 5189 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:20,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11598 Valid, 5189 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:59:20,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54490 states. [2024-11-10 00:59:21,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54490 to 27656. [2024-11-10 00:59:21,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27656 states, 27654 states have (on average 1.4856440297967743) internal successors, (41084), 27655 states have internal predecessors, (41084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:21,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27656 states to 27656 states and 41084 transitions. [2024-11-10 00:59:21,457 INFO L78 Accepts]: Start accepts. Automaton has 27656 states and 41084 transitions. Word has length 94 [2024-11-10 00:59:21,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:21,458 INFO L471 AbstractCegarLoop]: Abstraction has 27656 states and 41084 transitions. [2024-11-10 00:59:21,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:21,459 INFO L276 IsEmpty]: Start isEmpty. Operand 27656 states and 41084 transitions. [2024-11-10 00:59:21,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:59:21,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:21,464 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:59:21,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:59:21,465 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:21,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:21,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1007175629, now seen corresponding path program 1 times [2024-11-10 00:59:21,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:21,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747265937] [2024-11-10 00:59:21,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:21,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:21,692 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-10 00:59:21,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:21,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747265937] [2024-11-10 00:59:21,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747265937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:21,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:21,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:59:21,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379496540] [2024-11-10 00:59:21,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:21,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:59:21,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:21,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:59:21,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:59:21,696 INFO L87 Difference]: Start difference. First operand 27656 states and 41084 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:22,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:22,882 INFO L93 Difference]: Finished difference Result 68957 states and 99434 transitions. [2024-11-10 00:59:22,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:59:22,883 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-10 00:59:22,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:22,989 INFO L225 Difference]: With dead ends: 68957 [2024-11-10 00:59:22,989 INFO L226 Difference]: Without dead ends: 61722 [2024-11-10 00:59:23,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:59:23,019 INFO L432 NwaCegarLoop]: 2324 mSDtfsCounter, 11650 mSDsluCounter, 2870 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11650 SdHoareTripleChecker+Valid, 5194 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:23,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11650 Valid, 5194 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:59:23,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61722 states. [2024-11-10 00:59:24,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61722 to 34888. [2024-11-10 00:59:24,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34888 states, 34886 states have (on average 1.4675227885111506) internal successors, (51196), 34887 states have internal predecessors, (51196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:24,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34888 states to 34888 states and 51196 transitions. [2024-11-10 00:59:24,364 INFO L78 Accepts]: Start accepts. Automaton has 34888 states and 51196 transitions. Word has length 94 [2024-11-10 00:59:24,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:24,365 INFO L471 AbstractCegarLoop]: Abstraction has 34888 states and 51196 transitions. [2024-11-10 00:59:24,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:24,365 INFO L276 IsEmpty]: Start isEmpty. Operand 34888 states and 51196 transitions. [2024-11-10 00:59:24,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:59:24,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:24,373 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:59:24,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 00:59:24,373 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:24,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:24,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1084427123, now seen corresponding path program 1 times [2024-11-10 00:59:24,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:24,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122918119] [2024-11-10 00:59:24,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:24,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:24,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:24,912 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-10 00:59:24,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:24,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122918119] [2024-11-10 00:59:24,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122918119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:24,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:24,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:59:24,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396956348] [2024-11-10 00:59:24,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:24,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:59:24,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:24,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:59:24,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:59:24,915 INFO L87 Difference]: Start difference. First operand 34888 states and 51196 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:26,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:26,007 INFO L93 Difference]: Finished difference Result 76189 states and 109546 transitions. [2024-11-10 00:59:26,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:59:26,008 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-10 00:59:26,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:26,110 INFO L225 Difference]: With dead ends: 76189 [2024-11-10 00:59:26,111 INFO L226 Difference]: Without dead ends: 68954 [2024-11-10 00:59:26,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:59:26,141 INFO L432 NwaCegarLoop]: 2333 mSDtfsCounter, 11547 mSDsluCounter, 2962 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11547 SdHoareTripleChecker+Valid, 5295 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:26,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11547 Valid, 5295 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:59:26,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68954 states. [2024-11-10 00:59:27,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68954 to 42120. [2024-11-10 00:59:27,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42120 states, 42118 states have (on average 1.4556246735362552) internal successors, (61308), 42119 states have internal predecessors, (61308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:27,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42120 states to 42120 states and 61308 transitions. [2024-11-10 00:59:27,723 INFO L78 Accepts]: Start accepts. Automaton has 42120 states and 61308 transitions. Word has length 94 [2024-11-10 00:59:27,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:27,724 INFO L471 AbstractCegarLoop]: Abstraction has 42120 states and 61308 transitions. [2024-11-10 00:59:27,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:27,724 INFO L276 IsEmpty]: Start isEmpty. Operand 42120 states and 61308 transitions. [2024-11-10 00:59:27,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:59:27,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:27,734 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:59:27,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 00:59:27,735 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:27,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:27,735 INFO L85 PathProgramCache]: Analyzing trace with hash 290758259, now seen corresponding path program 1 times [2024-11-10 00:59:27,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:27,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206124549] [2024-11-10 00:59:27,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:27,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:27,933 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 00:59:27,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:27,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206124549] [2024-11-10 00:59:27,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206124549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:27,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:27,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:59:27,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028717071] [2024-11-10 00:59:27,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:27,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:59:27,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:27,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:59:27,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:59:27,936 INFO L87 Difference]: Start difference. First operand 42120 states and 61308 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:29,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:29,461 INFO L93 Difference]: Finished difference Result 83421 states and 119658 transitions. [2024-11-10 00:59:29,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:59:29,462 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-10 00:59:29,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:29,553 INFO L225 Difference]: With dead ends: 83421 [2024-11-10 00:59:29,553 INFO L226 Difference]: Without dead ends: 76186 [2024-11-10 00:59:29,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:59:29,573 INFO L432 NwaCegarLoop]: 2333 mSDtfsCounter, 11478 mSDsluCounter, 3147 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11478 SdHoareTripleChecker+Valid, 5480 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:29,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11478 Valid, 5480 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:59:29,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76186 states. [2024-11-10 00:59:31,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76186 to 49352. [2024-11-10 00:59:31,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49352 states, 49350 states have (on average 1.4472137791286728) internal successors, (71420), 49351 states have internal predecessors, (71420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:31,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49352 states to 49352 states and 71420 transitions. [2024-11-10 00:59:31,190 INFO L78 Accepts]: Start accepts. Automaton has 49352 states and 71420 transitions. Word has length 94 [2024-11-10 00:59:31,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:31,190 INFO L471 AbstractCegarLoop]: Abstraction has 49352 states and 71420 transitions. [2024-11-10 00:59:31,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:31,190 INFO L276 IsEmpty]: Start isEmpty. Operand 49352 states and 71420 transitions. [2024-11-10 00:59:31,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 00:59:31,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:31,197 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:59:31,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 00:59:31,198 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:31,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:31,198 INFO L85 PathProgramCache]: Analyzing trace with hash 2044706709, now seen corresponding path program 1 times [2024-11-10 00:59:31,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:31,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681959712] [2024-11-10 00:59:31,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:31,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:31,439 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:31,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:31,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681959712] [2024-11-10 00:59:31,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681959712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:31,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:31,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:31,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240432919] [2024-11-10 00:59:31,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:31,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:31,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:31,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:31,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:31,443 INFO L87 Difference]: Start difference. First operand 49352 states and 71420 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:32,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:32,346 INFO L93 Difference]: Finished difference Result 82662 states and 118457 transitions. [2024-11-10 00:59:32,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:32,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-11-10 00:59:32,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:32,406 INFO L225 Difference]: With dead ends: 82662 [2024-11-10 00:59:32,406 INFO L226 Difference]: Without dead ends: 35619 [2024-11-10 00:59:32,439 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-10 00:59:32,440 INFO L432 NwaCegarLoop]: 2300 mSDtfsCounter, 59 mSDsluCounter, 2235 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 4535 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:32,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 4535 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:59:32,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35619 states. [2024-11-10 00:59:33,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35619 to 35616. [2024-11-10 00:59:33,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35616 states, 35614 states have (on average 1.4678497220194306) internal successors, (52276), 35615 states have internal predecessors, (52276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:33,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35616 states to 35616 states and 52276 transitions. [2024-11-10 00:59:33,334 INFO L78 Accepts]: Start accepts. Automaton has 35616 states and 52276 transitions. Word has length 96 [2024-11-10 00:59:33,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:33,334 INFO L471 AbstractCegarLoop]: Abstraction has 35616 states and 52276 transitions. [2024-11-10 00:59:33,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:33,334 INFO L276 IsEmpty]: Start isEmpty. Operand 35616 states and 52276 transitions. [2024-11-10 00:59:33,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 00:59:33,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:33,337 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:59:33,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 00:59:33,337 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:33,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:33,338 INFO L85 PathProgramCache]: Analyzing trace with hash 296051, now seen corresponding path program 1 times [2024-11-10 00:59:33,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:33,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735009760] [2024-11-10 00:59:33,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:33,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:33,513 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:59:33,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:33,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735009760] [2024-11-10 00:59:33,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735009760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:33,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:33,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:59:33,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636951066] [2024-11-10 00:59:33,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:33,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:59:33,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:33,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:59:33,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:59:33,515 INFO L87 Difference]: Start difference. First operand 35616 states and 52276 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:35,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:35,202 INFO L93 Difference]: Finished difference Result 66357 states and 95682 transitions. [2024-11-10 00:59:35,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:59:35,202 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-11-10 00:59:35,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:35,277 INFO L225 Difference]: With dead ends: 66357 [2024-11-10 00:59:35,277 INFO L226 Difference]: Without dead ends: 61234 [2024-11-10 00:59:35,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:59:35,289 INFO L432 NwaCegarLoop]: 2321 mSDtfsCounter, 11502 mSDsluCounter, 3090 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11502 SdHoareTripleChecker+Valid, 5411 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:35,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11502 Valid, 5411 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:59:35,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61234 states. [2024-11-10 00:59:36,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61234 to 40736. [2024-11-10 00:59:36,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40736 states, 40734 states have (on average 1.459321451367408) internal successors, (59444), 40735 states have internal predecessors, (59444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:36,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40736 states to 40736 states and 59444 transitions. [2024-11-10 00:59:36,421 INFO L78 Accepts]: Start accepts. Automaton has 40736 states and 59444 transitions. Word has length 96 [2024-11-10 00:59:36,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:36,421 INFO L471 AbstractCegarLoop]: Abstraction has 40736 states and 59444 transitions. [2024-11-10 00:59:36,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:36,421 INFO L276 IsEmpty]: Start isEmpty. Operand 40736 states and 59444 transitions. [2024-11-10 00:59:36,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 00:59:36,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:36,425 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:59:36,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 00:59:36,425 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:36,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:36,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1721101739, now seen corresponding path program 1 times [2024-11-10 00:59:36,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:36,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523449030] [2024-11-10 00:59:36,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:36,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:36,530 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:36,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:36,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523449030] [2024-11-10 00:59:36,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523449030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:36,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:36,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:36,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375429347] [2024-11-10 00:59:36,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:36,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:36,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:36,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:36,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:36,532 INFO L87 Difference]: Start difference. First operand 40736 states and 59444 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:37,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:37,264 INFO L93 Difference]: Finished difference Result 59942 states and 86328 transitions. [2024-11-10 00:59:37,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:37,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2024-11-10 00:59:37,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:37,301 INFO L225 Difference]: With dead ends: 59942 [2024-11-10 00:59:37,301 INFO L226 Difference]: Without dead ends: 21539 [2024-11-10 00:59:37,323 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-10 00:59:37,324 INFO L432 NwaCegarLoop]: 2293 mSDtfsCounter, 52 mSDsluCounter, 2227 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 4520 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:37,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 4520 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:59:37,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21539 states. [2024-11-10 00:59:38,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21539 to 21536. [2024-11-10 00:59:38,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21536 states, 21534 states have (on average 1.501068078387666) internal successors, (32324), 21535 states have internal predecessors, (32324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:38,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21536 states to 21536 states and 32324 transitions. [2024-11-10 00:59:38,052 INFO L78 Accepts]: Start accepts. Automaton has 21536 states and 32324 transitions. Word has length 98 [2024-11-10 00:59:38,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:38,052 INFO L471 AbstractCegarLoop]: Abstraction has 21536 states and 32324 transitions. [2024-11-10 00:59:38,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:38,053 INFO L276 IsEmpty]: Start isEmpty. Operand 21536 states and 32324 transitions. [2024-11-10 00:59:38,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-10 00:59:38,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:38,055 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:59:38,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 00:59:38,056 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:38,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:38,056 INFO L85 PathProgramCache]: Analyzing trace with hash -2089553961, now seen corresponding path program 1 times [2024-11-10 00:59:38,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:38,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977701029] [2024-11-10 00:59:38,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:38,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:38,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:38,284 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:38,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:38,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977701029] [2024-11-10 00:59:38,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977701029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:38,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:38,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:38,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259107274] [2024-11-10 00:59:38,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:38,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:38,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:38,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:38,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:38,287 INFO L87 Difference]: Start difference. First operand 21536 states and 32324 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:38,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:38,556 INFO L93 Difference]: Finished difference Result 31142 states and 45648 transitions. [2024-11-10 00:59:38,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:38,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-11-10 00:59:38,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:38,576 INFO L225 Difference]: With dead ends: 31142 [2024-11-10 00:59:38,576 INFO L226 Difference]: Without dead ends: 11939 [2024-11-10 00:59:38,592 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-10 00:59:38,592 INFO L432 NwaCegarLoop]: 2286 mSDtfsCounter, 47 mSDsluCounter, 2219 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 4505 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:38,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 4505 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:59:38,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11939 states. [2024-11-10 00:59:38,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11939 to 11936. [2024-11-10 00:59:38,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11936 states, 11934 states have (on average 1.582369700016759) internal successors, (18884), 11935 states have internal predecessors, (18884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:38,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11936 states to 11936 states and 18884 transitions. [2024-11-10 00:59:38,869 INFO L78 Accepts]: Start accepts. Automaton has 11936 states and 18884 transitions. Word has length 100 [2024-11-10 00:59:38,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:38,869 INFO L471 AbstractCegarLoop]: Abstraction has 11936 states and 18884 transitions. [2024-11-10 00:59:38,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:38,870 INFO L276 IsEmpty]: Start isEmpty. Operand 11936 states and 18884 transitions. [2024-11-10 00:59:38,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-10 00:59:38,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:38,871 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:59:38,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 00:59:38,872 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:38,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:38,872 INFO L85 PathProgramCache]: Analyzing trace with hash -2047755810, now seen corresponding path program 1 times [2024-11-10 00:59:38,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:38,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988343676] [2024-11-10 00:59:38,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:38,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:38,974 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:38,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:38,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988343676] [2024-11-10 00:59:38,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988343676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:38,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:38,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:38,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890175235] [2024-11-10 00:59:38,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:38,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:38,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:38,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:38,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:38,977 INFO L87 Difference]: Start difference. First operand 11936 states and 18884 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:39,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:39,135 INFO L93 Difference]: Finished difference Result 16742 states and 25488 transitions. [2024-11-10 00:59:39,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:39,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2024-11-10 00:59:39,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:39,144 INFO L225 Difference]: With dead ends: 16742 [2024-11-10 00:59:39,144 INFO L226 Difference]: Without dead ends: 7139 [2024-11-10 00:59:39,151 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-10 00:59:39,151 INFO L432 NwaCegarLoop]: 2279 mSDtfsCounter, 44 mSDsluCounter, 2211 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 4490 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:39,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 4490 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:59:39,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7139 states. [2024-11-10 00:59:39,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7139 to 7136. [2024-11-10 00:59:39,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7136 states, 7134 states have (on average 1.713484721054107) internal successors, (12224), 7135 states have internal predecessors, (12224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:39,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7136 states to 7136 states and 12224 transitions. [2024-11-10 00:59:39,284 INFO L78 Accepts]: Start accepts. Automaton has 7136 states and 12224 transitions. Word has length 102 [2024-11-10 00:59:39,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:39,285 INFO L471 AbstractCegarLoop]: Abstraction has 7136 states and 12224 transitions. [2024-11-10 00:59:39,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:39,285 INFO L276 IsEmpty]: Start isEmpty. Operand 7136 states and 12224 transitions. [2024-11-10 00:59:39,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-10 00:59:39,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:39,286 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:59:39,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 00:59:39,287 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:39,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:39,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1649296645, now seen corresponding path program 1 times [2024-11-10 00:59:39,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:39,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290559089] [2024-11-10 00:59:39,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:39,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:39,390 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:39,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:39,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290559089] [2024-11-10 00:59:39,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290559089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:39,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:39,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:39,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015951285] [2024-11-10 00:59:39,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:39,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:39,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:39,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:39,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:39,393 INFO L87 Difference]: Start difference. First operand 7136 states and 12224 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:39,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:39,464 INFO L93 Difference]: Finished difference Result 9542 states and 15498 transitions. [2024-11-10 00:59:39,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:39,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-11-10 00:59:39,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:39,473 INFO L225 Difference]: With dead ends: 9542 [2024-11-10 00:59:39,473 INFO L226 Difference]: Without dead ends: 4739 [2024-11-10 00:59:39,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:39,477 INFO L432 NwaCegarLoop]: 2272 mSDtfsCounter, 41 mSDsluCounter, 2203 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 4475 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:39,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 4475 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:59:39,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4739 states. [2024-11-10 00:59:39,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4739 to 4736. [2024-11-10 00:59:39,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4736 states, 4734 states have (on average 1.8850866075200676) internal successors, (8924), 4735 states have internal predecessors, (8924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:39,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4736 states to 4736 states and 8924 transitions. [2024-11-10 00:59:39,550 INFO L78 Accepts]: Start accepts. Automaton has 4736 states and 8924 transitions. Word has length 104 [2024-11-10 00:59:39,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:39,551 INFO L471 AbstractCegarLoop]: Abstraction has 4736 states and 8924 transitions. [2024-11-10 00:59:39,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:39,551 INFO L276 IsEmpty]: Start isEmpty. Operand 4736 states and 8924 transitions. [2024-11-10 00:59:39,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-10 00:59:39,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:39,552 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:59:39,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 00:59:39,552 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:39,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:39,553 INFO L85 PathProgramCache]: Analyzing trace with hash -2017853108, now seen corresponding path program 1 times [2024-11-10 00:59:39,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:39,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063020061] [2024-11-10 00:59:39,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:39,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:39,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:39,651 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:39,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:39,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063020061] [2024-11-10 00:59:39,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063020061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:59:39,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:59:39,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:59:39,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287730029] [2024-11-10 00:59:39,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:59:39,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:59:39,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:39,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:59:39,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:59:39,654 INFO L87 Difference]: Start difference. First operand 4736 states and 8924 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:39,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:39,712 INFO L93 Difference]: Finished difference Result 5942 states and 10548 transitions. [2024-11-10 00:59:39,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:59:39,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2024-11-10 00:59:39,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:39,720 INFO L225 Difference]: With dead ends: 5942 [2024-11-10 00:59:39,720 INFO L226 Difference]: Without dead ends: 3539 [2024-11-10 00:59:39,723 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-10 00:59:39,723 INFO L432 NwaCegarLoop]: 2265 mSDtfsCounter, 38 mSDsluCounter, 2195 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 4460 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:39,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 4460 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:59:39,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3539 states. [2024-11-10 00:59:39,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3539 to 3536. [2024-11-10 00:59:39,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3536 states, 3534 states have (on average 2.0625353706847767) internal successors, (7289), 3535 states have internal predecessors, (7289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:39,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3536 states to 3536 states and 7289 transitions. [2024-11-10 00:59:39,848 INFO L78 Accepts]: Start accepts. Automaton has 3536 states and 7289 transitions. Word has length 106 [2024-11-10 00:59:39,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:39,848 INFO L471 AbstractCegarLoop]: Abstraction has 3536 states and 7289 transitions. [2024-11-10 00:59:39,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:39,852 INFO L276 IsEmpty]: Start isEmpty. Operand 3536 states and 7289 transitions. [2024-11-10 00:59:39,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 00:59:39,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:39,854 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:59:39,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 00:59:39,854 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:39,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:39,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1799921997, now seen corresponding path program 1 times [2024-11-10 00:59:39,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:39,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743629716] [2024-11-10 00:59:39,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:39,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:40,302 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:40,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:40,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743629716] [2024-11-10 00:59:40,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743629716] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:59:40,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995995860] [2024-11-10 00:59:40,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:40,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:59:40,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:59:40,305 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-10 00:59:40,306 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-10 00:59:40,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:40,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-10 00:59:40,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:59:42,198 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:42,199 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:59:45,014 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:45,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995995860] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:59:45,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:59:45,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17, 17] total 38 [2024-11-10 00:59:45,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739290542] [2024-11-10 00:59:45,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:59:45,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-10 00:59:45,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:45,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-10 00:59:45,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1161, Unknown=0, NotChecked=0, Total=1406 [2024-11-10 00:59:45,017 INFO L87 Difference]: Start difference. First operand 3536 states and 7289 transitions. Second operand has 38 states, 38 states have (on average 7.315789473684211) internal successors, (278), 38 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:47,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:47,614 INFO L93 Difference]: Finished difference Result 9604 states and 15387 transitions. [2024-11-10 00:59:47,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-10 00:59:47,615 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 7.315789473684211) internal successors, (278), 38 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2024-11-10 00:59:47,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:47,624 INFO L225 Difference]: With dead ends: 9604 [2024-11-10 00:59:47,624 INFO L226 Difference]: Without dead ends: 8401 [2024-11-10 00:59:47,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1880 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1495, Invalid=4985, Unknown=0, NotChecked=0, Total=6480 [2024-11-10 00:59:47,628 INFO L432 NwaCegarLoop]: 2240 mSDtfsCounter, 21755 mSDsluCounter, 18493 mSDsCounter, 0 mSdLazyCounter, 1314 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21755 SdHoareTripleChecker+Valid, 20733 SdHoareTripleChecker+Invalid, 1372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:47,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21755 Valid, 20733 Invalid, 1372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1314 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 00:59:47,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8401 states. [2024-11-10 00:59:47,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8401 to 5914. [2024-11-10 00:59:47,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5914 states, 5912 states have (on average 1.7560893098782138) internal successors, (10382), 5913 states have internal predecessors, (10382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:47,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5914 states to 5914 states and 10382 transitions. [2024-11-10 00:59:47,826 INFO L78 Accepts]: Start accepts. Automaton has 5914 states and 10382 transitions. Word has length 108 [2024-11-10 00:59:47,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:47,827 INFO L471 AbstractCegarLoop]: Abstraction has 5914 states and 10382 transitions. [2024-11-10 00:59:47,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 7.315789473684211) internal successors, (278), 38 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:47,827 INFO L276 IsEmpty]: Start isEmpty. Operand 5914 states and 10382 transitions. [2024-11-10 00:59:47,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-10 00:59:47,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:47,829 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:59:47,848 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-10 00:59:48,032 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,SelfDestructingSolverStorable25 [2024-11-10 00:59:48,033 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:48,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:48,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1067440103, now seen corresponding path program 1 times [2024-11-10 00:59:48,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:48,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454174616] [2024-11-10 00:59:48,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:48,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:48,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:48,391 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:48,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:48,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454174616] [2024-11-10 00:59:48,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454174616] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:59:48,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25408801] [2024-11-10 00:59:48,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:48,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:59:48,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:59:48,395 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:59:48,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 00:59:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:48,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-10 00:59:48,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:59:49,225 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:49,225 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:59:50,413 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:50,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25408801] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:59:50,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:59:50,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 30 [2024-11-10 00:59:50,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505188477] [2024-11-10 00:59:50,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:59:50,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-10 00:59:50,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:50,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-10 00:59:50,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2024-11-10 00:59:50,416 INFO L87 Difference]: Start difference. First operand 5914 states and 10382 transitions. Second operand has 30 states, 30 states have (on average 9.7) internal successors, (291), 30 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:51,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:51,330 INFO L93 Difference]: Finished difference Result 13337 states and 20171 transitions. [2024-11-10 00:59:51,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 00:59:51,330 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 9.7) internal successors, (291), 30 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2024-11-10 00:59:51,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:51,341 INFO L225 Difference]: With dead ends: 13337 [2024-11-10 00:59:51,341 INFO L226 Difference]: Without dead ends: 9756 [2024-11-10 00:59:51,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=468, Invalid=1512, Unknown=0, NotChecked=0, Total=1980 [2024-11-10 00:59:51,346 INFO L432 NwaCegarLoop]: 2228 mSDtfsCounter, 13763 mSDsluCounter, 7320 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13763 SdHoareTripleChecker+Valid, 9548 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:51,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13763 Valid, 9548 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:59:51,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9756 states. [2024-11-10 00:59:51,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9756 to 9664. [2024-11-10 00:59:51,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9664 states, 9662 states have (on average 1.5741047402194164) internal successors, (15209), 9663 states have internal predecessors, (15209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:51,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9664 states to 9664 states and 15209 transitions. [2024-11-10 00:59:51,541 INFO L78 Accepts]: Start accepts. Automaton has 9664 states and 15209 transitions. Word has length 109 [2024-11-10 00:59:51,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:51,542 INFO L471 AbstractCegarLoop]: Abstraction has 9664 states and 15209 transitions. [2024-11-10 00:59:51,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 9.7) internal successors, (291), 30 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:51,542 INFO L276 IsEmpty]: Start isEmpty. Operand 9664 states and 15209 transitions. [2024-11-10 00:59:51,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-10 00:59:51,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:51,544 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:59:51,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 00:59:51,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-10 00:59:51,745 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:51,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:51,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1705393453, now seen corresponding path program 1 times [2024-11-10 00:59:51,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:51,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419778104] [2024-11-10 00:59:51,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:51,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:52,459 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:52,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:52,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419778104] [2024-11-10 00:59:52,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419778104] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:59:52,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398624056] [2024-11-10 00:59:52,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:52,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:59:52,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:59:52,462 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:59:52,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 00:59:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:52,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 00:59:52,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:59:53,159 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:53,160 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:59:54,205 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:54,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398624056] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:59:54,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:59:54,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2024-11-10 00:59:54,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132360871] [2024-11-10 00:59:54,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:59:54,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-10 00:59:54,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:59:54,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-10 00:59:54,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2024-11-10 00:59:54,209 INFO L87 Difference]: Start difference. First operand 9664 states and 15209 transitions. Second operand has 29 states, 29 states have (on average 10.586206896551724) internal successors, (307), 28 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:56,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:59:56,472 INFO L93 Difference]: Finished difference Result 38439 states and 53106 transitions. [2024-11-10 00:59:56,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-10 00:59:56,473 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 10.586206896551724) internal successors, (307), 28 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2024-11-10 00:59:56,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:59:56,511 INFO L225 Difference]: With dead ends: 38439 [2024-11-10 00:59:56,512 INFO L226 Difference]: Without dead ends: 31108 [2024-11-10 00:59:56,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=751, Invalid=3031, Unknown=0, NotChecked=0, Total=3782 [2024-11-10 00:59:56,527 INFO L432 NwaCegarLoop]: 2223 mSDtfsCounter, 34147 mSDsluCounter, 11823 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34147 SdHoareTripleChecker+Valid, 14046 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 00:59:56,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34147 Valid, 14046 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 00:59:56,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31108 states. [2024-11-10 00:59:57,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31108 to 30924. [2024-11-10 00:59:57,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30924 states, 30922 states have (on average 1.3784684043722917) internal successors, (42625), 30923 states have internal predecessors, (42625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:57,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30924 states to 30924 states and 42625 transitions. [2024-11-10 00:59:57,616 INFO L78 Accepts]: Start accepts. Automaton has 30924 states and 42625 transitions. Word has length 109 [2024-11-10 00:59:57,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:59:57,617 INFO L471 AbstractCegarLoop]: Abstraction has 30924 states and 42625 transitions. [2024-11-10 00:59:57,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 10.586206896551724) internal successors, (307), 28 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:59:57,617 INFO L276 IsEmpty]: Start isEmpty. Operand 30924 states and 42625 transitions. [2024-11-10 00:59:57,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-10 00:59:57,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:59:57,620 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:59:57,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 00:59:57,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:59:57,821 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:59:57,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:59:57,822 INFO L85 PathProgramCache]: Analyzing trace with hash 818333428, now seen corresponding path program 1 times [2024-11-10 00:59:57,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:59:57,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256580168] [2024-11-10 00:59:57,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:57,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:59:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:58,264 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:58,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:59:58,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256580168] [2024-11-10 00:59:58,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256580168] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:59:58,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094742948] [2024-11-10 00:59:58,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:59:58,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:59:58,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:59:58,267 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:59:58,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 00:59:58,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:59:58,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-10 00:59:58,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:59:59,805 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:59:59,805 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 01:00:02,154 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:00:02,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094742948] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 01:00:02,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 01:00:02,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18, 15] total 39 [2024-11-10 01:00:02,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575726368] [2024-11-10 01:00:02,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 01:00:02,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-10 01:00:02,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:00:02,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-10 01:00:02,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1330, Unknown=0, NotChecked=0, Total=1482 [2024-11-10 01:00:02,157 INFO L87 Difference]: Start difference. First operand 30924 states and 42625 transitions. Second operand has 39 states, 39 states have (on average 7.6923076923076925) internal successors, (300), 39 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)