./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label02.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.5_overflow.ufo.UNBOUNDED.pals+Problem12_label02.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 2d5ef49da8a464b4b8c9ada6da6f38848fd0a828ef607f1296d8e73281f8aa1e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:55:52,369 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:55:52,461 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:55:52,468 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:55:52,468 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:55:52,508 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:55:52,510 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:55:52,511 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:55:52,511 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:55:52,515 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:55:52,515 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:55:52,515 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:55:52,516 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:55:52,516 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:55:52,516 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:55:52,517 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:55:52,517 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:55:52,520 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:55:52,520 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:55:52,520 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:55:52,521 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:55:52,521 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:55:52,521 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:55:52,522 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:55:52,522 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:55:52,522 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:55:52,523 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:55:52,523 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:55:52,523 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:55:52,523 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:55:52,524 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:55:52,524 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:55:52,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:55:52,525 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:55:52,525 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:55:52,525 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:55:52,525 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:55:52,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:55:52,527 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:55:52,528 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:55:52,528 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:55:52,528 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:55:52,529 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 -> 2d5ef49da8a464b4b8c9ada6da6f38848fd0a828ef607f1296d8e73281f8aa1e [2024-11-10 00:55:52,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:55:52,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:55:52,821 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:55:52,823 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:55:52,823 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:55:52,824 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c [2024-11-10 00:55:54,283 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:55:54,709 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:55:54,710 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c [2024-11-10 00:55:54,746 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7bea666d/acc9b4d671ae443fb492a0eb1cc153b9/FLAG4fcba934b [2024-11-10 00:55:54,762 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7bea666d/acc9b4d671ae443fb492a0eb1cc153b9 [2024-11-10 00:55:54,765 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:55:54,766 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:55:54,770 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:55:54,770 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:55:54,775 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:55:54,776 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:55:54" (1/1) ... [2024-11-10 00:55:54,776 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@809aea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:54, skipping insertion in model container [2024-11-10 00:55:54,777 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:55:54" (1/1) ... [2024-11-10 00:55:54,894 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:55:55,263 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.5_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c[11742,11755] [2024-11-10 00:55:55,368 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.5_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c[19032,19045] [2024-11-10 00:55:56,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:55:56,020 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:55:56,072 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.5_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c[11742,11755] [2024-11-10 00:55:56,088 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.5_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c[19032,19045] [2024-11-10 00:55:56,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:55:56,499 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:55:56,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:56 WrapperNode [2024-11-10 00:55:56,499 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:55:56,500 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:55:56,501 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:55:56,501 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:55:56,519 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:55:56" (1/1) ... [2024-11-10 00:55:56,614 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:55:56" (1/1) ... [2024-11-10 00:55:56,846 INFO L138 Inliner]: procedures = 37, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5093 [2024-11-10 00:55:56,846 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:55:56,847 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:55:56,847 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:55:56,847 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:55:56,857 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:56" (1/1) ... [2024-11-10 00:55:56,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:56" (1/1) ... [2024-11-10 00:55:56,899 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:56" (1/1) ... [2024-11-10 00:55:57,107 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:55:57,107 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:56" (1/1) ... [2024-11-10 00:55:57,108 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:56" (1/1) ... [2024-11-10 00:55:57,341 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:56" (1/1) ... [2024-11-10 00:55:57,358 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:56" (1/1) ... [2024-11-10 00:55:57,378 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:56" (1/1) ... [2024-11-10 00:55:57,393 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:56" (1/1) ... [2024-11-10 00:55:57,440 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:55:57,442 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:55:57,442 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:55:57,443 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:55:57,444 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:56" (1/1) ... [2024-11-10 00:55:57,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:55:57,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:55:57,479 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:55:57,482 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:55:57,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:55:57,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:55:57,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:55:57,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:55:57,661 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:55:57,663 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:56:03,142 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2128: havoc calculate_output_#t~ret37#1; [2024-11-10 00:56:03,143 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3607: havoc calculate_output2_#t~ret38#1; [2024-11-10 00:56:03,143 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5097: havoc calculate_output3_#t~ret39#1; [2024-11-10 00:56:03,500 INFO L? ?]: Removed 2081 outVars from TransFormulas that were not future-live. [2024-11-10 00:56:03,500 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:56:03,545 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:56:03,546 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:56:03,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:56:03 BoogieIcfgContainer [2024-11-10 00:56:03,546 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:56:03,549 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:56:03,549 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:56:03,553 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:56:03,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:55:54" (1/3) ... [2024-11-10 00:56:03,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@557562fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:56:03, skipping insertion in model container [2024-11-10 00:56:03,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:56" (2/3) ... [2024-11-10 00:56:03,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@557562fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:56:03, skipping insertion in model container [2024-11-10 00:56:03,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:56:03" (3/3) ... [2024-11-10 00:56:03,557 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label02.c [2024-11-10 00:56:03,573 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:56:03,573 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 00:56:03,671 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:56:03,678 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;@76b16592, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:56:03,678 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 00:56:03,688 INFO L276 IsEmpty]: Start isEmpty. Operand has 906 states, 903 states have (on average 2.6511627906976742) internal successors, (2394), 905 states have internal predecessors, (2394), 0 states have call successors, (0), 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:56:03,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 00:56:03,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:03,697 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] [2024-11-10 00:56:03,698 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:03,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:03,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1826649402, now seen corresponding path program 1 times [2024-11-10 00:56:03,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:03,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320846077] [2024-11-10 00:56:03,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:03,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:03,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:03,986 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:56:03,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:03,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320846077] [2024-11-10 00:56:03,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320846077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:03,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:03,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:56:03,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584916629] [2024-11-10 00:56:03,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:03,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 00:56:03,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:04,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 00:56:04,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:56:04,024 INFO L87 Difference]: Start difference. First operand has 906 states, 903 states have (on average 2.6511627906976742) internal successors, (2394), 905 states have internal predecessors, (2394), 0 states have call successors, (0), 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 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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:56:04,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:04,115 INFO L93 Difference]: Finished difference Result 1771 states and 4714 transitions. [2024-11-10 00:56:04,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 00:56:04,117 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-11-10 00:56:04,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:04,141 INFO L225 Difference]: With dead ends: 1771 [2024-11-10 00:56:04,142 INFO L226 Difference]: Without dead ends: 838 [2024-11-10 00:56:04,149 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:56:04,155 INFO L432 NwaCegarLoop]: 2323 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, 2323 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:56:04,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2323 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:56:04,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-11-10 00:56:04,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2024-11-10 00:56:04,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 836 states have (on average 2.702153110047847) internal successors, (2259), 837 states have internal predecessors, (2259), 0 states have call successors, (0), 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:56:04,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 2259 transitions. [2024-11-10 00:56:04,238 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 2259 transitions. Word has length 26 [2024-11-10 00:56:04,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:04,238 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 2259 transitions. [2024-11-10 00:56:04,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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:56:04,239 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 2259 transitions. [2024-11-10 00:56:04,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 00:56:04,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:04,241 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] [2024-11-10 00:56:04,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:56:04,241 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:04,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:04,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1417825177, now seen corresponding path program 1 times [2024-11-10 00:56:04,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:04,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097172683] [2024-11-10 00:56:04,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:04,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:04,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:04,456 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:56:04,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:04,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097172683] [2024-11-10 00:56:04,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097172683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:04,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:04,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:56:04,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116125818] [2024-11-10 00:56:04,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:04,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:56:04,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:04,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:56:04,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:56:04,462 INFO L87 Difference]: Start difference. First operand 838 states and 2259 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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:56:04,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:04,595 INFO L93 Difference]: Finished difference Result 887 states and 2333 transitions. [2024-11-10 00:56:04,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:56:04,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-11-10 00:56:04,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:04,599 INFO L225 Difference]: With dead ends: 887 [2024-11-10 00:56:04,600 INFO L226 Difference]: Without dead ends: 838 [2024-11-10 00:56:04,601 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:56:04,602 INFO L432 NwaCegarLoop]: 2257 mSDtfsCounter, 0 mSDsluCounter, 6735 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8992 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:04,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8992 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:56:04,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-11-10 00:56:04,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2024-11-10 00:56:04,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 836 states have (on average 2.665071770334928) internal successors, (2228), 837 states have internal predecessors, (2228), 0 states have call successors, (0), 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:56:04,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 2228 transitions. [2024-11-10 00:56:04,639 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 2228 transitions. Word has length 26 [2024-11-10 00:56:04,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:04,639 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 2228 transitions. [2024-11-10 00:56:04,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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:56:04,640 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 2228 transitions. [2024-11-10 00:56:04,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-10 00:56:04,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:04,645 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] [2024-11-10 00:56:04,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:56:04,645 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:04,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:04,646 INFO L85 PathProgramCache]: Analyzing trace with hash -2138475845, now seen corresponding path program 1 times [2024-11-10 00:56:04,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:04,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452703836] [2024-11-10 00:56:04,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:04,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:04,895 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:56:04,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:04,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452703836] [2024-11-10 00:56:04,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452703836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:04,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:04,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:56:04,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234715889] [2024-11-10 00:56:04,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:04,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:56:04,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:04,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:56:04,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:56:04,900 INFO L87 Difference]: Start difference. First operand 838 states and 2228 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:05,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:05,175 INFO L93 Difference]: Finished difference Result 1288 states and 2928 transitions. [2024-11-10 00:56:05,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 00:56:05,176 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-11-10 00:56:05,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:05,183 INFO L225 Difference]: With dead ends: 1288 [2024-11-10 00:56:05,184 INFO L226 Difference]: Without dead ends: 1243 [2024-11-10 00:56:05,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-10 00:56:05,186 INFO L432 NwaCegarLoop]: 2222 mSDtfsCounter, 11386 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11386 SdHoareTripleChecker+Valid, 3378 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:05,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11386 Valid, 3378 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:56:05,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2024-11-10 00:56:05,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 880. [2024-11-10 00:56:05,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 878 states have (on average 2.612756264236902) internal successors, (2294), 879 states have internal predecessors, (2294), 0 states have call successors, (0), 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:56:05,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 2294 transitions. [2024-11-10 00:56:05,224 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 2294 transitions. Word has length 56 [2024-11-10 00:56:05,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:05,224 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 2294 transitions. [2024-11-10 00:56:05,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:05,225 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 2294 transitions. [2024-11-10 00:56:05,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 00:56:05,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:05,229 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] [2024-11-10 00:56:05,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:56:05,229 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:05,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:05,230 INFO L85 PathProgramCache]: Analyzing trace with hash 208440989, now seen corresponding path program 1 times [2024-11-10 00:56:05,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:05,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260565749] [2024-11-10 00:56:05,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:05,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:05,542 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:56:05,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:05,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260565749] [2024-11-10 00:56:05,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260565749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:05,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:05,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:56:05,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863494048] [2024-11-10 00:56:05,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:05,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:56:05,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:05,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:56:05,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:56:05,545 INFO L87 Difference]: Start difference. First operand 880 states and 2294 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 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:56:05,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:05,758 INFO L93 Difference]: Finished difference Result 970 states and 2432 transitions. [2024-11-10 00:56:05,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:56:05,758 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-10 00:56:05,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:05,764 INFO L225 Difference]: With dead ends: 970 [2024-11-10 00:56:05,764 INFO L226 Difference]: Without dead ends: 883 [2024-11-10 00:56:05,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-11-10 00:56:05,766 INFO L432 NwaCegarLoop]: 2221 mSDtfsCounter, 6531 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6531 SdHoareTripleChecker+Valid, 2486 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:05,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6531 Valid, 2486 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:56:05,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2024-11-10 00:56:05,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 880. [2024-11-10 00:56:05,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 878 states have (on average 2.611617312072893) internal successors, (2293), 879 states have internal predecessors, (2293), 0 states have call successors, (0), 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:56:05,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 2293 transitions. [2024-11-10 00:56:05,790 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 2293 transitions. Word has length 58 [2024-11-10 00:56:05,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:05,791 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 2293 transitions. [2024-11-10 00:56:05,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 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:56:05,792 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 2293 transitions. [2024-11-10 00:56:05,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-10 00:56:05,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:05,796 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] [2024-11-10 00:56:05,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:56:05,796 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:05,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:05,797 INFO L85 PathProgramCache]: Analyzing trace with hash -404444728, now seen corresponding path program 1 times [2024-11-10 00:56:05,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:05,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747328955] [2024-11-10 00:56:05,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:05,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:05,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:05,933 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:56:05,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:05,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747328955] [2024-11-10 00:56:05,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747328955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:05,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:05,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:56:05,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56849177] [2024-11-10 00:56:05,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:05,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:56:05,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:05,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:56:05,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:05,935 INFO L87 Difference]: Start difference. First operand 880 states and 2293 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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:56:05,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:05,973 INFO L93 Difference]: Finished difference Result 1042 states and 2543 transitions. [2024-11-10 00:56:05,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:56:05,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2024-11-10 00:56:05,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:05,979 INFO L225 Difference]: With dead ends: 1042 [2024-11-10 00:56:05,979 INFO L226 Difference]: Without dead ends: 955 [2024-11-10 00:56:05,980 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:56:05,980 INFO L432 NwaCegarLoop]: 2225 mSDtfsCounter, 2166 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2166 SdHoareTripleChecker+Valid, 2290 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:05,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2166 Valid, 2290 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:56:05,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2024-11-10 00:56:05,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 952. [2024-11-10 00:56:05,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 950 states have (on average 2.5294736842105263) internal successors, (2403), 951 states have internal predecessors, (2403), 0 states have call successors, (0), 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:56:06,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 2403 transitions. [2024-11-10 00:56:06,003 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 2403 transitions. Word has length 59 [2024-11-10 00:56:06,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:06,004 INFO L471 AbstractCegarLoop]: Abstraction has 952 states and 2403 transitions. [2024-11-10 00:56:06,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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:56:06,004 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 2403 transitions. [2024-11-10 00:56:06,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:56:06,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:06,006 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:56:06,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:56:06,006 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:06,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:06,007 INFO L85 PathProgramCache]: Analyzing trace with hash 788028767, now seen corresponding path program 1 times [2024-11-10 00:56:06,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:06,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606380447] [2024-11-10 00:56:06,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:06,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:06,088 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:56:06,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:06,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606380447] [2024-11-10 00:56:06,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606380447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:06,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:06,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:56:06,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159682537] [2024-11-10 00:56:06,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:06,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:56:06,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:06,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:56:06,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:06,090 INFO L87 Difference]: Start difference. First operand 952 states and 2403 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:06,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:06,123 INFO L93 Difference]: Finished difference Result 1254 states and 2865 transitions. [2024-11-10 00:56:06,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:56:06,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-10 00:56:06,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:06,129 INFO L225 Difference]: With dead ends: 1254 [2024-11-10 00:56:06,129 INFO L226 Difference]: Without dead ends: 1095 [2024-11-10 00:56:06,130 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:56:06,131 INFO L432 NwaCegarLoop]: 2276 mSDtfsCounter, 2178 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2178 SdHoareTripleChecker+Valid, 2351 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:56:06,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2178 Valid, 2351 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:56:06,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2024-11-10 00:56:06,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1092. [2024-11-10 00:56:06,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 1090 states have (on average 2.398165137614679) internal successors, (2614), 1091 states have internal predecessors, (2614), 0 states have call successors, (0), 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:56:06,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 2614 transitions. [2024-11-10 00:56:06,156 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 2614 transitions. Word has length 60 [2024-11-10 00:56:06,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:06,156 INFO L471 AbstractCegarLoop]: Abstraction has 1092 states and 2614 transitions. [2024-11-10 00:56:06,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:06,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 2614 transitions. [2024-11-10 00:56:06,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:56:06,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:06,157 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:56:06,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:56:06,158 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:06,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:06,158 INFO L85 PathProgramCache]: Analyzing trace with hash -213380961, now seen corresponding path program 1 times [2024-11-10 00:56:06,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:06,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644556855] [2024-11-10 00:56:06,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:06,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:06,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:06,217 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:56:06,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:06,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644556855] [2024-11-10 00:56:06,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644556855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:06,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:06,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:56:06,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229159608] [2024-11-10 00:56:06,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:06,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:56:06,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:06,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:56:06,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:06,220 INFO L87 Difference]: Start difference. First operand 1092 states and 2614 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:06,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:06,252 INFO L93 Difference]: Finished difference Result 1658 states and 3470 transitions. [2024-11-10 00:56:06,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:56:06,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-10 00:56:06,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:06,259 INFO L225 Difference]: With dead ends: 1658 [2024-11-10 00:56:06,259 INFO L226 Difference]: Without dead ends: 1359 [2024-11-10 00:56:06,260 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:56:06,260 INFO L432 NwaCegarLoop]: 2274 mSDtfsCounter, 2176 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2176 SdHoareTripleChecker+Valid, 2353 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:56:06,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2176 Valid, 2353 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:56:06,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2024-11-10 00:56:06,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1356. [2024-11-10 00:56:06,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1356 states, 1354 states have (on average 2.218611521418021) internal successors, (3004), 1355 states have internal predecessors, (3004), 0 states have call successors, (0), 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:56:06,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 3004 transitions. [2024-11-10 00:56:06,295 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 3004 transitions. Word has length 60 [2024-11-10 00:56:06,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:06,296 INFO L471 AbstractCegarLoop]: Abstraction has 1356 states and 3004 transitions. [2024-11-10 00:56:06,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:06,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 3004 transitions. [2024-11-10 00:56:06,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:56:06,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:06,297 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:56:06,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:56:06,297 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:06,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:06,298 INFO L85 PathProgramCache]: Analyzing trace with hash -227830817, now seen corresponding path program 1 times [2024-11-10 00:56:06,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:06,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728381773] [2024-11-10 00:56:06,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:06,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:06,376 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:56:06,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:06,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728381773] [2024-11-10 00:56:06,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728381773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:06,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:06,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:56:06,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276679735] [2024-11-10 00:56:06,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:06,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:56:06,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:06,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:56:06,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:06,380 INFO L87 Difference]: Start difference. First operand 1356 states and 3004 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:06,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:06,418 INFO L93 Difference]: Finished difference Result 2418 states and 4584 transitions. [2024-11-10 00:56:06,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:56:06,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-10 00:56:06,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:06,427 INFO L225 Difference]: With dead ends: 2418 [2024-11-10 00:56:06,428 INFO L226 Difference]: Without dead ends: 1855 [2024-11-10 00:56:06,429 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:56:06,430 INFO L432 NwaCegarLoop]: 2272 mSDtfsCounter, 2174 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2174 SdHoareTripleChecker+Valid, 2355 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:56:06,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2174 Valid, 2355 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:56:06,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1855 states. [2024-11-10 00:56:06,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1855 to 1852. [2024-11-10 00:56:06,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1852 states, 1850 states have (on average 2.0108108108108107) internal successors, (3720), 1851 states have internal predecessors, (3720), 0 states have call successors, (0), 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:56:06,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1852 states to 1852 states and 3720 transitions. [2024-11-10 00:56:06,480 INFO L78 Accepts]: Start accepts. Automaton has 1852 states and 3720 transitions. Word has length 60 [2024-11-10 00:56:06,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:06,482 INFO L471 AbstractCegarLoop]: Abstraction has 1852 states and 3720 transitions. [2024-11-10 00:56:06,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:06,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 3720 transitions. [2024-11-10 00:56:06,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:56:06,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:06,483 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:56:06,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:56:06,484 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:06,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:06,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1863771935, now seen corresponding path program 1 times [2024-11-10 00:56:06,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:06,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446373916] [2024-11-10 00:56:06,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:06,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:06,558 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:56:06,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:06,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446373916] [2024-11-10 00:56:06,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446373916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:06,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:06,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:56:06,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809540662] [2024-11-10 00:56:06,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:06,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:56:06,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:06,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:56:06,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:06,562 INFO L87 Difference]: Start difference. First operand 1852 states and 3720 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:06,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:06,617 INFO L93 Difference]: Finished difference Result 3842 states and 6620 transitions. [2024-11-10 00:56:06,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:56:06,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-10 00:56:06,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:06,631 INFO L225 Difference]: With dead ends: 3842 [2024-11-10 00:56:06,632 INFO L226 Difference]: Without dead ends: 2783 [2024-11-10 00:56:06,635 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:56:06,637 INFO L432 NwaCegarLoop]: 2270 mSDtfsCounter, 2172 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2172 SdHoareTripleChecker+Valid, 2357 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:56:06,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2172 Valid, 2357 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:56:06,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2783 states. [2024-11-10 00:56:06,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2783 to 2780. [2024-11-10 00:56:06,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2780 states, 2778 states have (on average 1.80849532037437) internal successors, (5024), 2779 states have internal predecessors, (5024), 0 states have call successors, (0), 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:56:06,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2780 states to 2780 states and 5024 transitions. [2024-11-10 00:56:06,709 INFO L78 Accepts]: Start accepts. Automaton has 2780 states and 5024 transitions. Word has length 60 [2024-11-10 00:56:06,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:06,710 INFO L471 AbstractCegarLoop]: Abstraction has 2780 states and 5024 transitions. [2024-11-10 00:56:06,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:06,710 INFO L276 IsEmpty]: Start isEmpty. Operand 2780 states and 5024 transitions. [2024-11-10 00:56:06,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:56:06,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:06,711 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:56:06,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:56:06,712 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:06,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:06,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1339494880, now seen corresponding path program 1 times [2024-11-10 00:56:06,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:06,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776746890] [2024-11-10 00:56:06,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:06,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:06,976 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:56:06,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:06,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776746890] [2024-11-10 00:56:06,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776746890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:06,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:06,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:56:06,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299403412] [2024-11-10 00:56:06,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:06,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:56:06,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:06,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:56:06,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:56:06,980 INFO L87 Difference]: Start difference. First operand 2780 states and 5024 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:07,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:07,080 INFO L93 Difference]: Finished difference Result 2879 states and 5154 transitions. [2024-11-10 00:56:07,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:56:07,081 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-10 00:56:07,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:07,092 INFO L225 Difference]: With dead ends: 2879 [2024-11-10 00:56:07,093 INFO L226 Difference]: Without dead ends: 2876 [2024-11-10 00:56:07,094 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:56:07,094 INFO L432 NwaCegarLoop]: 2222 mSDtfsCounter, 0 mSDsluCounter, 13319 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15541 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:56:07,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15541 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:56:07,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2876 states. [2024-11-10 00:56:07,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2876 to 2876. [2024-11-10 00:56:07,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2876 states, 2874 states have (on average 1.7759220598469032) internal successors, (5104), 2875 states have internal predecessors, (5104), 0 states have call successors, (0), 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:56:07,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2876 states and 5104 transitions. [2024-11-10 00:56:07,164 INFO L78 Accepts]: Start accepts. Automaton has 2876 states and 5104 transitions. Word has length 60 [2024-11-10 00:56:07,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:07,165 INFO L471 AbstractCegarLoop]: Abstraction has 2876 states and 5104 transitions. [2024-11-10 00:56:07,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:07,165 INFO L276 IsEmpty]: Start isEmpty. Operand 2876 states and 5104 transitions. [2024-11-10 00:56:07,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:56:07,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:07,167 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:56:07,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:56:07,167 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:07,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:07,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1070103071, now seen corresponding path program 1 times [2024-11-10 00:56:07,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:07,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135409597] [2024-11-10 00:56:07,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:07,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:07,226 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:56:07,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:07,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135409597] [2024-11-10 00:56:07,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135409597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:07,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:07,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:56:07,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327477728] [2024-11-10 00:56:07,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:07,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:56:07,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:07,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:56:07,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:07,228 INFO L87 Difference]: Start difference. First operand 2876 states and 5104 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:07,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:07,335 INFO L93 Difference]: Finished difference Result 5125 states and 8312 transitions. [2024-11-10 00:56:07,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:56:07,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-10 00:56:07,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:07,351 INFO L225 Difference]: With dead ends: 5125 [2024-11-10 00:56:07,352 INFO L226 Difference]: Without dead ends: 3938 [2024-11-10 00:56:07,355 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:56:07,355 INFO L432 NwaCegarLoop]: 2282 mSDtfsCounter, 2180 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2180 SdHoareTripleChecker+Valid, 2353 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:56:07,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2180 Valid, 2353 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:56:07,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3938 states. [2024-11-10 00:56:07,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3938 to 3935. [2024-11-10 00:56:07,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3935 states, 3933 states have (on average 1.6687007373506229) internal successors, (6563), 3934 states have internal predecessors, (6563), 0 states have call successors, (0), 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:56:07,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3935 states to 3935 states and 6563 transitions. [2024-11-10 00:56:07,461 INFO L78 Accepts]: Start accepts. Automaton has 3935 states and 6563 transitions. Word has length 60 [2024-11-10 00:56:07,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:07,462 INFO L471 AbstractCegarLoop]: Abstraction has 3935 states and 6563 transitions. [2024-11-10 00:56:07,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:07,462 INFO L276 IsEmpty]: Start isEmpty. Operand 3935 states and 6563 transitions. [2024-11-10 00:56:07,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-10 00:56:07,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:07,464 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] [2024-11-10 00:56:07,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:56:07,465 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:07,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:07,465 INFO L85 PathProgramCache]: Analyzing trace with hash -3331995, now seen corresponding path program 1 times [2024-11-10 00:56:07,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:07,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532308001] [2024-11-10 00:56:07,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:07,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:07,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:07,608 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:56:07,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:07,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532308001] [2024-11-10 00:56:07,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532308001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:07,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:07,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:56:07,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219966258] [2024-11-10 00:56:07,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:07,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:56:07,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:07,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:56:07,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:56:07,611 INFO L87 Difference]: Start difference. First operand 3935 states and 6563 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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:56:15,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:15,550 INFO L93 Difference]: Finished difference Result 6194 states and 12916 transitions. [2024-11-10 00:56:15,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 00:56:15,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2024-11-10 00:56:15,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:15,576 INFO L225 Difference]: With dead ends: 6194 [2024-11-10 00:56:15,576 INFO L226 Difference]: Without dead ends: 5439 [2024-11-10 00:56:15,579 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:56:15,580 INFO L432 NwaCegarLoop]: 784 mSDtfsCounter, 4443 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 8074 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4443 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 9227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 8074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:15,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4443 Valid, 807 Invalid, 9227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 8074 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2024-11-10 00:56:15,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5439 states. [2024-11-10 00:56:15,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5439 to 5439. [2024-11-10 00:56:15,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5439 states, 5437 states have (on average 1.8464226595549016) internal successors, (10039), 5438 states have internal predecessors, (10039), 0 states have call successors, (0), 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:56:15,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5439 states to 5439 states and 10039 transitions. [2024-11-10 00:56:15,839 INFO L78 Accepts]: Start accepts. Automaton has 5439 states and 10039 transitions. Word has length 65 [2024-11-10 00:56:15,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:15,840 INFO L471 AbstractCegarLoop]: Abstraction has 5439 states and 10039 transitions. [2024-11-10 00:56:15,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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:56:15,841 INFO L276 IsEmpty]: Start isEmpty. Operand 5439 states and 10039 transitions. [2024-11-10 00:56:15,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:56:15,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:15,843 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] [2024-11-10 00:56:15,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:56:15,843 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:15,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:15,844 INFO L85 PathProgramCache]: Analyzing trace with hash 958545093, now seen corresponding path program 1 times [2024-11-10 00:56:15,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:15,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428944120] [2024-11-10 00:56:15,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:15,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:16,007 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 00:56:16,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:16,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428944120] [2024-11-10 00:56:16,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428944120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:16,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:16,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:56:16,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438182666] [2024-11-10 00:56:16,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:16,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:56:16,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:16,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:56:16,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:56:16,010 INFO L87 Difference]: Start difference. First operand 5439 states and 10039 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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:56:16,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:16,364 INFO L93 Difference]: Finished difference Result 21825 states and 32963 transitions. [2024-11-10 00:56:16,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:56:16,365 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 81 [2024-11-10 00:56:16,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:16,414 INFO L225 Difference]: With dead ends: 21825 [2024-11-10 00:56:16,415 INFO L226 Difference]: Without dead ends: 18686 [2024-11-10 00:56:16,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:56:16,427 INFO L432 NwaCegarLoop]: 2293 mSDtfsCounter, 9059 mSDsluCounter, 2708 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9059 SdHoareTripleChecker+Valid, 5001 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:16,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9059 Valid, 5001 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:56:16,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18686 states. [2024-11-10 00:56:16,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18686 to 8575. [2024-11-10 00:56:16,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8575 states, 8573 states have (on average 1.678642248921031) internal successors, (14391), 8574 states have internal predecessors, (14391), 0 states have call successors, (0), 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:56:16,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8575 states to 8575 states and 14391 transitions. [2024-11-10 00:56:16,715 INFO L78 Accepts]: Start accepts. Automaton has 8575 states and 14391 transitions. Word has length 81 [2024-11-10 00:56:16,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:16,715 INFO L471 AbstractCegarLoop]: Abstraction has 8575 states and 14391 transitions. [2024-11-10 00:56:16,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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:56:16,715 INFO L276 IsEmpty]: Start isEmpty. Operand 8575 states and 14391 transitions. [2024-11-10 00:56:16,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:56:16,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:16,718 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] [2024-11-10 00:56:16,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:56:16,718 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:16,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:16,719 INFO L85 PathProgramCache]: Analyzing trace with hash -42864635, now seen corresponding path program 1 times [2024-11-10 00:56:16,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:16,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532465528] [2024-11-10 00:56:16,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:16,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:16,871 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 00:56:16,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:16,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532465528] [2024-11-10 00:56:16,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532465528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:16,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:16,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:56:16,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265645038] [2024-11-10 00:56:16,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:16,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:56:16,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:16,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:56:16,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:56:16,874 INFO L87 Difference]: Start difference. First operand 8575 states and 14391 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 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:56:17,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:17,294 INFO L93 Difference]: Finished difference Result 24961 states and 37315 transitions. [2024-11-10 00:56:17,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:56:17,295 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 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 81 [2024-11-10 00:56:17,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:17,338 INFO L225 Difference]: With dead ends: 24961 [2024-11-10 00:56:17,338 INFO L226 Difference]: Without dead ends: 21822 [2024-11-10 00:56:17,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:56:17,350 INFO L432 NwaCegarLoop]: 2290 mSDtfsCounter, 9083 mSDsluCounter, 2646 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9083 SdHoareTripleChecker+Valid, 4936 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:17,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9083 Valid, 4936 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:56:17,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21822 states. [2024-11-10 00:56:17,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21822 to 13295. [2024-11-10 00:56:17,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13295 states, 13293 states have (on average 1.571278116301813) internal successors, (20887), 13294 states have internal predecessors, (20887), 0 states have call successors, (0), 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:56:17,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13295 states to 13295 states and 20887 transitions. [2024-11-10 00:56:17,797 INFO L78 Accepts]: Start accepts. Automaton has 13295 states and 20887 transitions. Word has length 81 [2024-11-10 00:56:17,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:17,797 INFO L471 AbstractCegarLoop]: Abstraction has 13295 states and 20887 transitions. [2024-11-10 00:56:17,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 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:56:17,798 INFO L276 IsEmpty]: Start isEmpty. Operand 13295 states and 20887 transitions. [2024-11-10 00:56:17,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:56:17,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:17,800 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] [2024-11-10 00:56:17,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:56:17,801 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:17,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:17,801 INFO L85 PathProgramCache]: Analyzing trace with hash -57314491, now seen corresponding path program 1 times [2024-11-10 00:56:17,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:17,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899813979] [2024-11-10 00:56:17,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:17,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:17,951 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 00:56:17,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:17,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899813979] [2024-11-10 00:56:17,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899813979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:17,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:17,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:56:17,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223351354] [2024-11-10 00:56:17,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:17,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:56:17,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:17,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:56:17,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:56:17,953 INFO L87 Difference]: Start difference. First operand 13295 states and 20887 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 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:56:18,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:18,383 INFO L93 Difference]: Finished difference Result 28097 states and 41667 transitions. [2024-11-10 00:56:18,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:56:18,383 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 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 81 [2024-11-10 00:56:18,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:18,431 INFO L225 Difference]: With dead ends: 28097 [2024-11-10 00:56:18,431 INFO L226 Difference]: Without dead ends: 24958 [2024-11-10 00:56:18,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:56:18,446 INFO L432 NwaCegarLoop]: 2287 mSDtfsCounter, 9118 mSDsluCounter, 2660 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9118 SdHoareTripleChecker+Valid, 4947 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:18,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9118 Valid, 4947 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:56:18,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24958 states. [2024-11-10 00:56:18,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24958 to 16431. [2024-11-10 00:56:19,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16431 states, 16429 states have (on average 1.5362468805161604) internal successors, (25239), 16430 states have internal predecessors, (25239), 0 states have call successors, (0), 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:56:19,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16431 states to 16431 states and 25239 transitions. [2024-11-10 00:56:19,041 INFO L78 Accepts]: Start accepts. Automaton has 16431 states and 25239 transitions. Word has length 81 [2024-11-10 00:56:19,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:19,042 INFO L471 AbstractCegarLoop]: Abstraction has 16431 states and 25239 transitions. [2024-11-10 00:56:19,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 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:56:19,042 INFO L276 IsEmpty]: Start isEmpty. Operand 16431 states and 25239 transitions. [2024-11-10 00:56:19,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:56:19,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:19,045 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] [2024-11-10 00:56:19,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:56:19,045 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:19,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:19,046 INFO L85 PathProgramCache]: Analyzing trace with hash 2034288261, now seen corresponding path program 1 times [2024-11-10 00:56:19,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:19,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885787935] [2024-11-10 00:56:19,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:19,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:19,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:19,193 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-10 00:56:19,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:19,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885787935] [2024-11-10 00:56:19,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885787935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:19,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:19,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:56:19,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952094725] [2024-11-10 00:56:19,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:19,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:56:19,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:19,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:56:19,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:56:19,198 INFO L87 Difference]: Start difference. First operand 16431 states and 25239 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 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:56:19,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:19,611 INFO L93 Difference]: Finished difference Result 31233 states and 46019 transitions. [2024-11-10 00:56:19,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:56:19,612 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 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 81 [2024-11-10 00:56:19,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:19,649 INFO L225 Difference]: With dead ends: 31233 [2024-11-10 00:56:19,650 INFO L226 Difference]: Without dead ends: 28094 [2024-11-10 00:56:19,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:56:19,664 INFO L432 NwaCegarLoop]: 2297 mSDtfsCounter, 9066 mSDsluCounter, 2722 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9066 SdHoareTripleChecker+Valid, 5019 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:19,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9066 Valid, 5019 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:56:19,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28094 states. [2024-11-10 00:56:20,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28094 to 19567. [2024-11-10 00:56:20,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19567 states, 19565 states have (on average 1.5124456938410427) internal successors, (29591), 19566 states have internal predecessors, (29591), 0 states have call successors, (0), 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:56:20,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19567 states to 19567 states and 29591 transitions. [2024-11-10 00:56:20,394 INFO L78 Accepts]: Start accepts. Automaton has 19567 states and 29591 transitions. Word has length 81 [2024-11-10 00:56:20,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:20,395 INFO L471 AbstractCegarLoop]: Abstraction has 19567 states and 29591 transitions. [2024-11-10 00:56:20,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 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:56:20,395 INFO L276 IsEmpty]: Start isEmpty. Operand 19567 states and 29591 transitions. [2024-11-10 00:56:20,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:56:20,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:20,400 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] [2024-11-10 00:56:20,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 00:56:20,400 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:20,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:20,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1240619397, now seen corresponding path program 1 times [2024-11-10 00:56:20,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:20,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011864314] [2024-11-10 00:56:20,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:20,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:20,597 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:56:20,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:20,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011864314] [2024-11-10 00:56:20,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011864314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:20,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:20,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:56:20,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91428174] [2024-11-10 00:56:20,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:20,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:56:20,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:20,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:56:20,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:56:20,600 INFO L87 Difference]: Start difference. First operand 19567 states and 29591 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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:56:21,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:21,415 INFO L93 Difference]: Finished difference Result 32577 states and 47907 transitions. [2024-11-10 00:56:21,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:56:21,415 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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 81 [2024-11-10 00:56:21,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:21,448 INFO L225 Difference]: With dead ends: 32577 [2024-11-10 00:56:21,448 INFO L226 Difference]: Without dead ends: 30334 [2024-11-10 00:56:21,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:56:21,459 INFO L432 NwaCegarLoop]: 2297 mSDtfsCounter, 9049 mSDsluCounter, 2828 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9049 SdHoareTripleChecker+Valid, 5125 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:21,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9049 Valid, 5125 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:56:21,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30334 states. [2024-11-10 00:56:21,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30334 to 21807. [2024-11-10 00:56:21,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21807 states, 21805 states have (on average 1.50089429030039) internal successors, (32727), 21806 states have internal predecessors, (32727), 0 states have call successors, (0), 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:56:21,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21807 states to 21807 states and 32727 transitions. [2024-11-10 00:56:21,970 INFO L78 Accepts]: Start accepts. Automaton has 21807 states and 32727 transitions. Word has length 81 [2024-11-10 00:56:21,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:21,971 INFO L471 AbstractCegarLoop]: Abstraction has 21807 states and 32727 transitions. [2024-11-10 00:56:21,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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:56:21,971 INFO L276 IsEmpty]: Start isEmpty. Operand 21807 states and 32727 transitions. [2024-11-10 00:56:21,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 00:56:21,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:21,976 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] [2024-11-10 00:56:21,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 00:56:21,976 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:21,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:21,977 INFO L85 PathProgramCache]: Analyzing trace with hash 33226279, now seen corresponding path program 1 times [2024-11-10 00:56:21,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:21,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371460396] [2024-11-10 00:56:21,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:21,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:22,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:22,136 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:56:22,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:22,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371460396] [2024-11-10 00:56:22,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371460396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:22,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:22,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:56:22,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187925701] [2024-11-10 00:56:22,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:22,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:56:22,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:22,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:56:22,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:22,139 INFO L87 Difference]: Start difference. First operand 21807 states and 32727 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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:56:22,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:22,525 INFO L93 Difference]: Finished difference Result 36394 states and 53137 transitions. [2024-11-10 00:56:22,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:56:22,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-11-10 00:56:22,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:22,552 INFO L225 Difference]: With dead ends: 36394 [2024-11-10 00:56:22,552 INFO L226 Difference]: Without dead ends: 16887 [2024-11-10 00:56:22,573 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:56:22,574 INFO L432 NwaCegarLoop]: 2270 mSDtfsCounter, 48 mSDsluCounter, 2216 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 4486 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:56:22,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 4486 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:56:22,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16887 states. [2024-11-10 00:56:22,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16887 to 16877. [2024-11-10 00:56:22,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16877 states, 16875 states have (on average 1.5306074074074074) internal successors, (25829), 16876 states have internal predecessors, (25829), 0 states have call successors, (0), 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:56:22,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16877 states to 16877 states and 25829 transitions. [2024-11-10 00:56:22,904 INFO L78 Accepts]: Start accepts. Automaton has 16877 states and 25829 transitions. Word has length 83 [2024-11-10 00:56:22,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:22,904 INFO L471 AbstractCegarLoop]: Abstraction has 16877 states and 25829 transitions. [2024-11-10 00:56:22,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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:56:22,905 INFO L276 IsEmpty]: Start isEmpty. Operand 16877 states and 25829 transitions. [2024-11-10 00:56:22,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 00:56:22,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:22,908 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] [2024-11-10 00:56:22,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 00:56:22,909 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:22,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:22,909 INFO L85 PathProgramCache]: Analyzing trace with hash 523692775, now seen corresponding path program 1 times [2024-11-10 00:56:22,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:22,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288798381] [2024-11-10 00:56:22,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:22,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:22,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:23,032 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:56:23,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:23,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288798381] [2024-11-10 00:56:23,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288798381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:23,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:23,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:56:23,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726415024] [2024-11-10 00:56:23,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:23,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:56:23,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:23,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:56:23,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:23,036 INFO L87 Difference]: Start difference. First operand 16877 states and 25829 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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:56:23,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:23,327 INFO L93 Difference]: Finished difference Result 24163 states and 35921 transitions. [2024-11-10 00:56:23,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:56:23,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-11-10 00:56:23,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:23,341 INFO L225 Difference]: With dead ends: 24163 [2024-11-10 00:56:23,342 INFO L226 Difference]: Without dead ends: 9600 [2024-11-10 00:56:23,352 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:56:23,352 INFO L432 NwaCegarLoop]: 2263 mSDtfsCounter, 43 mSDsluCounter, 2208 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 4471 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:56:23,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 4471 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:56:23,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9600 states. [2024-11-10 00:56:23,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9600 to 9597. [2024-11-10 00:56:23,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9597 states, 9595 states have (on average 1.6297029702970296) internal successors, (15637), 9596 states have internal predecessors, (15637), 0 states have call successors, (0), 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:56:23,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9597 states to 9597 states and 15637 transitions. [2024-11-10 00:56:23,517 INFO L78 Accepts]: Start accepts. Automaton has 9597 states and 15637 transitions. Word has length 83 [2024-11-10 00:56:23,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:23,517 INFO L471 AbstractCegarLoop]: Abstraction has 9597 states and 15637 transitions. [2024-11-10 00:56:23,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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:56:23,517 INFO L276 IsEmpty]: Start isEmpty. Operand 9597 states and 15637 transitions. [2024-11-10 00:56:23,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 00:56:23,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:23,519 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] [2024-11-10 00:56:23,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 00:56:23,519 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:23,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:23,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1197682903, now seen corresponding path program 1 times [2024-11-10 00:56:23,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:23,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444164591] [2024-11-10 00:56:23,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:23,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:23,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:23,608 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:23,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:23,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444164591] [2024-11-10 00:56:23,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444164591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:23,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:23,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:56:23,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024470656] [2024-11-10 00:56:23,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:23,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:56:23,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:23,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:56:23,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:23,611 INFO L87 Difference]: Start difference. First operand 9597 states and 15637 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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:56:23,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:23,725 INFO L93 Difference]: Finished difference Result 13243 states and 20633 transitions. [2024-11-10 00:56:23,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:56:23,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-11-10 00:56:23,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:23,735 INFO L225 Difference]: With dead ends: 13243 [2024-11-10 00:56:23,735 INFO L226 Difference]: Without dead ends: 5960 [2024-11-10 00:56:23,744 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:56:23,745 INFO L432 NwaCegarLoop]: 2256 mSDtfsCounter, 38 mSDsluCounter, 2200 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 4456 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:56:23,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 4456 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:56:23,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5960 states. [2024-11-10 00:56:23,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5960 to 5957. [2024-11-10 00:56:23,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5957 states, 5955 states have (on average 1.7788413098236775) internal successors, (10593), 5956 states have internal predecessors, (10593), 0 states have call successors, (0), 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:56:23,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5957 states to 5957 states and 10593 transitions. [2024-11-10 00:56:23,867 INFO L78 Accepts]: Start accepts. Automaton has 5957 states and 10593 transitions. Word has length 85 [2024-11-10 00:56:23,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:23,868 INFO L471 AbstractCegarLoop]: Abstraction has 5957 states and 10593 transitions. [2024-11-10 00:56:23,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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:56:23,868 INFO L276 IsEmpty]: Start isEmpty. Operand 5957 states and 10593 transitions. [2024-11-10 00:56:23,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-10 00:56:23,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:23,870 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] [2024-11-10 00:56:23,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 00:56:23,870 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:23,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:23,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1769393264, now seen corresponding path program 1 times [2024-11-10 00:56:23,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:23,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708552681] [2024-11-10 00:56:23,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:23,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:24,006 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:24,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:24,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708552681] [2024-11-10 00:56:24,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708552681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:24,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:24,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:56:24,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287356259] [2024-11-10 00:56:24,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:24,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:56:24,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:24,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:56:24,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:24,010 INFO L87 Difference]: Start difference. First operand 5957 states and 10593 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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:56:24,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:24,079 INFO L93 Difference]: Finished difference Result 7783 states and 13067 transitions. [2024-11-10 00:56:24,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:56:24,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-11-10 00:56:24,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:24,087 INFO L225 Difference]: With dead ends: 7783 [2024-11-10 00:56:24,087 INFO L226 Difference]: Without dead ends: 4140 [2024-11-10 00:56:24,090 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:56:24,092 INFO L432 NwaCegarLoop]: 2249 mSDtfsCounter, 35 mSDsluCounter, 2192 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 4441 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:56:24,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 4441 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:56:24,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4140 states. [2024-11-10 00:56:24,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4140 to 4137. [2024-11-10 00:56:24,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4137 states, 4135 states have (on average 1.9581620314389359) internal successors, (8097), 4136 states have internal predecessors, (8097), 0 states have call successors, (0), 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:56:24,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4137 states to 4137 states and 8097 transitions. [2024-11-10 00:56:24,156 INFO L78 Accepts]: Start accepts. Automaton has 4137 states and 8097 transitions. Word has length 87 [2024-11-10 00:56:24,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:24,156 INFO L471 AbstractCegarLoop]: Abstraction has 4137 states and 8097 transitions. [2024-11-10 00:56:24,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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:56:24,157 INFO L276 IsEmpty]: Start isEmpty. Operand 4137 states and 8097 transitions. [2024-11-10 00:56:24,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 00:56:24,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:24,158 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] [2024-11-10 00:56:24,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 00:56:24,158 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:24,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:24,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1728874217, now seen corresponding path program 1 times [2024-11-10 00:56:24,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:24,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706240247] [2024-11-10 00:56:24,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:24,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:24,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:24,243 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:24,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:24,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706240247] [2024-11-10 00:56:24,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706240247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:24,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:24,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:56:24,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265897639] [2024-11-10 00:56:24,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:24,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:56:24,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:24,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:56:24,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:24,246 INFO L87 Difference]: Start difference. First operand 4137 states and 8097 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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:56:24,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:24,292 INFO L93 Difference]: Finished difference Result 5053 states and 9323 transitions. [2024-11-10 00:56:24,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:56:24,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2024-11-10 00:56:24,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:24,299 INFO L225 Difference]: With dead ends: 5053 [2024-11-10 00:56:24,299 INFO L226 Difference]: Without dead ends: 3230 [2024-11-10 00:56:24,301 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:56:24,301 INFO L432 NwaCegarLoop]: 2242 mSDtfsCounter, 32 mSDsluCounter, 2184 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 4426 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:56:24,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 4426 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:56:24,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3230 states. [2024-11-10 00:56:24,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3230 to 3227. [2024-11-10 00:56:24,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3227 states, 3225 states have (on average 2.1277519379844962) internal successors, (6862), 3226 states have internal predecessors, (6862), 0 states have call successors, (0), 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:56:24,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3227 states to 3227 states and 6862 transitions. [2024-11-10 00:56:24,351 INFO L78 Accepts]: Start accepts. Automaton has 3227 states and 6862 transitions. Word has length 89 [2024-11-10 00:56:24,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:24,351 INFO L471 AbstractCegarLoop]: Abstraction has 3227 states and 6862 transitions. [2024-11-10 00:56:24,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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:56:24,351 INFO L276 IsEmpty]: Start isEmpty. Operand 3227 states and 6862 transitions. [2024-11-10 00:56:24,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 00:56:24,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:24,353 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:24,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 00:56:24,353 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:24,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:24,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1030885310, now seen corresponding path program 1 times [2024-11-10 00:56:24,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:24,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336914783] [2024-11-10 00:56:24,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:24,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:24,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:24,829 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:24,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:24,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336914783] [2024-11-10 00:56:24,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336914783] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:56:24,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542764600] [2024-11-10 00:56:24,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:24,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:56:24,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:56:24,833 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:56:24,834 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:56:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:25,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-10 00:56:25,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:56:26,022 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:26,023 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:56:27,627 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:27,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542764600] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:56:27,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:56:27,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 17] total 38 [2024-11-10 00:56:27,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611977908] [2024-11-10 00:56:27,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:56:27,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-10 00:56:27,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:27,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-10 00:56:27,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1249, Unknown=0, NotChecked=0, Total=1406 [2024-11-10 00:56:27,632 INFO L87 Difference]: Start difference. First operand 3227 states and 6862 transitions. Second operand has 38 states, 38 states have (on average 6.394736842105263) internal successors, (243), 38 states have internal predecessors, (243), 0 states have call successors, (0), 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:56:31,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:31,974 INFO L93 Difference]: Finished difference Result 10797 states and 16817 transitions. [2024-11-10 00:56:31,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-11-10 00:56:31,975 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 6.394736842105263) internal successors, (243), 38 states have internal predecessors, (243), 0 states have call successors, (0), 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 91 [2024-11-10 00:56:31,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:31,987 INFO L225 Difference]: With dead ends: 10797 [2024-11-10 00:56:31,987 INFO L226 Difference]: Without dead ends: 9884 [2024-11-10 00:56:31,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2706 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1693, Invalid=8207, Unknown=0, NotChecked=0, Total=9900 [2024-11-10 00:56:31,995 INFO L432 NwaCegarLoop]: 2183 mSDtfsCounter, 27017 mSDsluCounter, 25160 mSDsCounter, 0 mSdLazyCounter, 1902 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27017 SdHoareTripleChecker+Valid, 27343 SdHoareTripleChecker+Invalid, 1968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:31,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27017 Valid, 27343 Invalid, 1968 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [66 Valid, 1902 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 00:56:32,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9884 states. [2024-11-10 00:56:32,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9884 to 5905. [2024-11-10 00:56:32,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5905 states, 5903 states have (on average 1.7447060816533966) internal successors, (10299), 5904 states have internal predecessors, (10299), 0 states have call successors, (0), 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:56:32,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5905 states to 5905 states and 10299 transitions. [2024-11-10 00:56:32,134 INFO L78 Accepts]: Start accepts. Automaton has 5905 states and 10299 transitions. Word has length 91 [2024-11-10 00:56:32,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:32,134 INFO L471 AbstractCegarLoop]: Abstraction has 5905 states and 10299 transitions. [2024-11-10 00:56:32,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 6.394736842105263) internal successors, (243), 38 states have internal predecessors, (243), 0 states have call successors, (0), 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:56:32,135 INFO L276 IsEmpty]: Start isEmpty. Operand 5905 states and 10299 transitions. [2024-11-10 00:56:32,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 00:56:32,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:32,137 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:32,155 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:56:32,337 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,SelfDestructingSolverStorable22 [2024-11-10 00:56:32,338 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:32,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:32,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1605157303, now seen corresponding path program 1 times [2024-11-10 00:56:32,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:32,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102370941] [2024-11-10 00:56:32,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:32,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:32,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:32,851 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:32,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:32,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102370941] [2024-11-10 00:56:32,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102370941] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:56:32,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780134898] [2024-11-10 00:56:32,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:32,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:56:32,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:56:32,854 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:56:32,856 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:56:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:33,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 00:56:33,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:56:33,501 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:33,501 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:56:34,259 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:34,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780134898] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:56:34,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:56:34,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2024-11-10 00:56:34,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895317747] [2024-11-10 00:56:34,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:56:34,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-10 00:56:34,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:34,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-10 00:56:34,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2024-11-10 00:56:34,262 INFO L87 Difference]: Start difference. First operand 5905 states and 10299 transitions. Second operand has 23 states, 23 states have (on average 9.08695652173913) internal successors, (209), 22 states have internal predecessors, (209), 0 states have call successors, (0), 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:56:35,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:35,013 INFO L93 Difference]: Finished difference Result 13378 states and 20029 transitions. [2024-11-10 00:56:35,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 00:56:35,014 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.08695652173913) internal successors, (209), 22 states have internal predecessors, (209), 0 states have call successors, (0), 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 92 [2024-11-10 00:56:35,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:35,031 INFO L225 Difference]: With dead ends: 13378 [2024-11-10 00:56:35,031 INFO L226 Difference]: Without dead ends: 9787 [2024-11-10 00:56:35,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=278, Invalid=844, Unknown=0, NotChecked=0, Total=1122 [2024-11-10 00:56:35,040 INFO L432 NwaCegarLoop]: 2218 mSDtfsCounter, 15625 mSDsluCounter, 7126 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15625 SdHoareTripleChecker+Valid, 9344 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:35,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15625 Valid, 9344 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:56:35,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9787 states. [2024-11-10 00:56:35,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9787 to 9685. [2024-11-10 00:56:35,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9685 states, 9683 states have (on average 1.5582980481255808) internal successors, (15089), 9684 states have internal predecessors, (15089), 0 states have call successors, (0), 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:56:35,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9685 states to 9685 states and 15089 transitions. [2024-11-10 00:56:35,242 INFO L78 Accepts]: Start accepts. Automaton has 9685 states and 15089 transitions. Word has length 92 [2024-11-10 00:56:35,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:35,242 INFO L471 AbstractCegarLoop]: Abstraction has 9685 states and 15089 transitions. [2024-11-10 00:56:35,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.08695652173913) internal successors, (209), 22 states have internal predecessors, (209), 0 states have call successors, (0), 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:56:35,243 INFO L276 IsEmpty]: Start isEmpty. Operand 9685 states and 15089 transitions. [2024-11-10 00:56:35,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 00:56:35,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:35,245 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:35,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 00:56:35,445 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,SelfDestructingSolverStorable23 [2024-11-10 00:56:35,446 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:35,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:35,446 INFO L85 PathProgramCache]: Analyzing trace with hash 772439075, now seen corresponding path program 1 times [2024-11-10 00:56:35,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:35,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037881969] [2024-11-10 00:56:35,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:35,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:35,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:35,816 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:35,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:35,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037881969] [2024-11-10 00:56:35,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037881969] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:56:35,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880514147] [2024-11-10 00:56:35,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:35,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:56:35,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:56:35,819 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:56:35,821 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:56:36,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:36,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 00:56:36,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:56:36,397 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:36,400 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:56:37,220 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:37,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880514147] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:56:37,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:56:37,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-11-10 00:56:37,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644532109] [2024-11-10 00:56:37,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:56:37,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-10 00:56:37,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:37,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-10 00:56:37,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2024-11-10 00:56:37,225 INFO L87 Difference]: Start difference. First operand 9685 states and 15089 transitions. Second operand has 22 states, 22 states have (on average 9.181818181818182) internal successors, (202), 21 states have internal predecessors, (202), 0 states have call successors, (0), 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:56:37,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:37,812 INFO L93 Difference]: Finished difference Result 24430 states and 33967 transitions. [2024-11-10 00:56:37,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 00:56:37,812 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 9.181818181818182) internal successors, (202), 21 states have internal predecessors, (202), 0 states have call successors, (0), 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 92 [2024-11-10 00:56:37,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:37,830 INFO L225 Difference]: With dead ends: 24430 [2024-11-10 00:56:37,830 INFO L226 Difference]: Without dead ends: 17059 [2024-11-10 00:56:37,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=655, Unknown=0, NotChecked=0, Total=870 [2024-11-10 00:56:37,838 INFO L432 NwaCegarLoop]: 2202 mSDtfsCounter, 26313 mSDsluCounter, 4629 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26313 SdHoareTripleChecker+Valid, 6831 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:37,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26313 Valid, 6831 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:56:37,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17059 states. [2024-11-10 00:56:38,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17059 to 17053. [2024-11-10 00:56:38,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17053 states, 17051 states have (on average 1.4327018943170489) internal successors, (24429), 17052 states have internal predecessors, (24429), 0 states have call successors, (0), 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:56:38,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17053 states to 17053 states and 24429 transitions. [2024-11-10 00:56:38,200 INFO L78 Accepts]: Start accepts. Automaton has 17053 states and 24429 transitions. Word has length 92 [2024-11-10 00:56:38,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:38,200 INFO L471 AbstractCegarLoop]: Abstraction has 17053 states and 24429 transitions. [2024-11-10 00:56:38,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.181818181818182) internal successors, (202), 21 states have internal predecessors, (202), 0 states have call successors, (0), 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:56:38,201 INFO L276 IsEmpty]: Start isEmpty. Operand 17053 states and 24429 transitions. [2024-11-10 00:56:38,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-10 00:56:38,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:38,204 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:38,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 00:56:38,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:56:38,405 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:38,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:38,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1947591175, now seen corresponding path program 1 times [2024-11-10 00:56:38,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:38,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894264537] [2024-11-10 00:56:38,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:38,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:38,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:38,758 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:38,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:38,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894264537] [2024-11-10 00:56:38,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894264537] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:56:38,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531956958] [2024-11-10 00:56:38,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:38,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:56:38,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:56:38,761 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:56:38,762 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:56:38,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:38,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-10 00:56:38,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:56:39,497 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:39,498 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:56:40,538 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:40,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531956958] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:56:40,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:56:40,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 29 [2024-11-10 00:56:40,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277982400] [2024-11-10 00:56:40,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:56:40,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-10 00:56:40,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:40,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-10 00:56:40,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2024-11-10 00:56:40,541 INFO L87 Difference]: Start difference. First operand 17053 states and 24429 transitions. Second operand has 29 states, 29 states have (on average 8.448275862068966) internal successors, (245), 29 states have internal predecessors, (245), 0 states have call successors, (0), 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:56:41,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:41,749 INFO L93 Difference]: Finished difference Result 47686 states and 63715 transitions. [2024-11-10 00:56:41,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 00:56:41,750 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 8.448275862068966) internal successors, (245), 29 states have internal predecessors, (245), 0 states have call successors, (0), 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 93 [2024-11-10 00:56:41,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:41,787 INFO L225 Difference]: With dead ends: 47686 [2024-11-10 00:56:41,787 INFO L226 Difference]: Without dead ends: 32947 [2024-11-10 00:56:41,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=437, Invalid=1455, Unknown=0, NotChecked=0, Total=1892 [2024-11-10 00:56:41,803 INFO L432 NwaCegarLoop]: 2213 mSDtfsCounter, 17884 mSDsluCounter, 11504 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17884 SdHoareTripleChecker+Valid, 13717 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:41,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17884 Valid, 13717 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:56:41,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32947 states. [2024-11-10 00:56:42,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32947 to 32557. [2024-11-10 00:56:42,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32557 states, 32555 states have (on average 1.3448318230686531) internal successors, (43781), 32556 states have internal predecessors, (43781), 0 states have call successors, (0), 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:56:42,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32557 states to 32557 states and 43781 transitions. [2024-11-10 00:56:42,692 INFO L78 Accepts]: Start accepts. Automaton has 32557 states and 43781 transitions. Word has length 93 [2024-11-10 00:56:42,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:42,693 INFO L471 AbstractCegarLoop]: Abstraction has 32557 states and 43781 transitions. [2024-11-10 00:56:42,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.448275862068966) internal successors, (245), 29 states have internal predecessors, (245), 0 states have call successors, (0), 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:56:42,693 INFO L276 IsEmpty]: Start isEmpty. Operand 32557 states and 43781 transitions. [2024-11-10 00:56:42,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:56:42,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:42,697 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:42,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 00:56:42,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-10 00:56:42,898 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:42,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:42,898 INFO L85 PathProgramCache]: Analyzing trace with hash -911703645, now seen corresponding path program 1 times [2024-11-10 00:56:42,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:42,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139741186] [2024-11-10 00:56:42,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:42,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:44,910 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:44,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:44,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139741186] [2024-11-10 00:56:44,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139741186] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:56:44,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012984570] [2024-11-10 00:56:44,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:44,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:56:44,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:56:44,912 INFO L229 MonitoredProcess]: Starting monitored process 6 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:56:44,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 00:56:45,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:45,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 00:56:45,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:56:45,906 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:45,907 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:56:47,268 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:47,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012984570] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:56:47,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:56:47,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 13, 13] total 42 [2024-11-10 00:56:47,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062504209] [2024-11-10 00:56:47,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:56:47,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-10 00:56:47,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:47,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-10 00:56:47,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1579, Unknown=0, NotChecked=0, Total=1722 [2024-11-10 00:56:47,271 INFO L87 Difference]: Start difference. First operand 32557 states and 43781 transitions. Second operand has 42 states, 42 states have (on average 6.142857142857143) internal successors, (258), 42 states have internal predecessors, (258), 0 states have call successors, (0), 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:57:00,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:57:00,878 INFO L93 Difference]: Finished difference Result 92082 states and 118722 transitions. [2024-11-10 00:57:00,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2024-11-10 00:57:00,879 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 6.142857142857143) internal successors, (258), 42 states have internal predecessors, (258), 0 states have call successors, (0), 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:57:00,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:57:00,968 INFO L225 Difference]: With dead ends: 92082 [2024-11-10 00:57:00,968 INFO L226 Difference]: Without dead ends: 81967 [2024-11-10 00:57:00,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5868 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=3236, Invalid=15670, Unknown=0, NotChecked=0, Total=18906 [2024-11-10 00:57:00,985 INFO L432 NwaCegarLoop]: 2243 mSDtfsCounter, 28655 mSDsluCounter, 38907 mSDsCounter, 0 mSdLazyCounter, 3020 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28655 SdHoareTripleChecker+Valid, 41150 SdHoareTripleChecker+Invalid, 3120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 3020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:57:00,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28655 Valid, 41150 Invalid, 3120 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [100 Valid, 3020 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-10 00:57:01,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81967 states. [2024-11-10 00:57:02,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81967 to 30285. [2024-11-10 00:57:02,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30285 states, 30283 states have (on average 1.3495690651520655) internal successors, (40869), 30284 states have internal predecessors, (40869), 0 states have call successors, (0), 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:57:02,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30285 states to 30285 states and 40869 transitions. [2024-11-10 00:57:02,207 INFO L78 Accepts]: Start accepts. Automaton has 30285 states and 40869 transitions. Word has length 94 [2024-11-10 00:57:02,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:57:02,208 INFO L471 AbstractCegarLoop]: Abstraction has 30285 states and 40869 transitions. [2024-11-10 00:57:02,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 6.142857142857143) internal successors, (258), 42 states have internal predecessors, (258), 0 states have call successors, (0), 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:57:02,208 INFO L276 IsEmpty]: Start isEmpty. Operand 30285 states and 40869 transitions. [2024-11-10 00:57:02,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:57:02,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:57:02,212 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:02,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-10 00:57:02,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-10 00:57:02,413 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:57:02,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:57:02,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1405048741, now seen corresponding path program 1 times [2024-11-10 00:57:02,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:57:02,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278341674] [2024-11-10 00:57:02,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:57:02,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:57:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:57:03,449 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:57:03,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:57:03,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278341674] [2024-11-10 00:57:03,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278341674] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:57:03,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157312442] [2024-11-10 00:57:03,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:57:03,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:57:03,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:57:03,452 INFO L229 MonitoredProcess]: Starting monitored process 7 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:57:03,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 00:57:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:57:03,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-10 00:57:03,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:57:06,775 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:57:06,775 INFO L311 TraceCheckSpWp]: Computing backward predicates...