./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label06.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.7.ufo.BOUNDED-14.pals+Problem12_label06.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 5a8db184ab7332ab7843787a030506038544a962a60c0b43f4b663ada8e12be3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 01:00:56,147 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 01:00:56,207 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 01:00:56,213 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 01:00:56,215 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 01:00:56,241 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 01:00:56,242 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 01:00:56,242 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 01:00:56,243 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 01:00:56,244 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 01:00:56,244 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 01:00:56,244 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 01:00:56,245 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 01:00:56,246 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 01:00:56,247 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 01:00:56,247 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 01:00:56,262 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 01:00:56,262 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 01:00:56,262 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 01:00:56,263 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 01:00:56,263 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 01:00:56,267 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 01:00:56,267 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 01:00:56,267 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 01:00:56,267 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 01:00:56,268 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 01:00:56,268 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 01:00:56,268 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 01:00:56,268 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 01:00:56,268 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 01:00:56,268 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 01:00:56,268 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 01:00:56,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:00:56,269 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 01:00:56,269 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 01:00:56,269 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 01:00:56,269 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 01:00:56,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 01:00:56,269 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 01:00:56,270 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 01:00:56,270 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 01:00:56,270 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 01:00:56,271 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 -> 5a8db184ab7332ab7843787a030506038544a962a60c0b43f4b663ada8e12be3 [2024-11-10 01:00:56,630 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 01:00:56,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 01:00:56,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 01:00:56,665 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 01:00:56,665 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 01:00:56,666 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label06.c [2024-11-10 01:00:58,124 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 01:00:58,527 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 01:00:58,528 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label06.c [2024-11-10 01:00:58,561 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/941b3da1e/9228c3ff60b8471c9be68b679a408312/FLAG7d19337c8 [2024-11-10 01:00:58,576 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/941b3da1e/9228c3ff60b8471c9be68b679a408312 [2024-11-10 01:00:58,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 01:00:58,581 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 01:00:58,583 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 01:00:58,583 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 01:00:58,590 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 01:00:58,590 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:00:58" (1/1) ... [2024-11-10 01:00:58,591 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e620bcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:00:58, skipping insertion in model container [2024-11-10 01:00:58,591 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:00:58" (1/1) ... [2024-11-10 01:00:58,682 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 01:00:59,057 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.7.ufo.BOUNDED-14.pals+Problem12_label06.c[20426,20439] [2024-11-10 01:00:59,145 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.7.ufo.BOUNDED-14.pals+Problem12_label06.c[23243,23256] [2024-11-10 01:00:59,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:00:59,624 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 01:00:59,654 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.7.ufo.BOUNDED-14.pals+Problem12_label06.c[20426,20439] [2024-11-10 01:00:59,657 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.7.ufo.BOUNDED-14.pals+Problem12_label06.c[23243,23256] [2024-11-10 01:00:59,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:01:00,049 INFO L204 MainTranslator]: Completed translation [2024-11-10 01:01:00,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:01:00 WrapperNode [2024-11-10 01:01:00,054 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 01:01:00,055 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 01:01:00,055 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 01:01:00,055 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 01:01:00,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:01:00" (1/1) ... [2024-11-10 01:01:00,128 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:01:00" (1/1) ... [2024-11-10 01:01:00,521 INFO L138 Inliner]: procedures = 38, calls = 24, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 5219 [2024-11-10 01:01:00,522 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 01:01:00,523 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 01:01:00,523 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 01:01:00,523 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 01:01:00,533 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:01:00" (1/1) ... [2024-11-10 01:01:00,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:01:00" (1/1) ... [2024-11-10 01:01:00,647 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:01:00" (1/1) ... [2024-11-10 01:01:00,789 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 01:01:00,790 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:01:00" (1/1) ... [2024-11-10 01:01:00,790 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:01:00" (1/1) ... [2024-11-10 01:01:01,016 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:01:00" (1/1) ... [2024-11-10 01:01:01,037 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:01:00" (1/1) ... [2024-11-10 01:01:01,056 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:01:00" (1/1) ... [2024-11-10 01:01:01,070 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:01:00" (1/1) ... [2024-11-10 01:01:01,110 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 01:01:01,112 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 01:01:01,113 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 01:01:01,113 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 01:01:01,114 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:01:00" (1/1) ... [2024-11-10 01:01:01,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:01:01,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:01:01,152 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 01:01:01,160 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 01:01:01,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 01:01:01,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 01:01:01,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 01:01:01,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 01:01:01,311 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 01:01:01,314 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 01:01:05,497 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2285: havoc calculate_output_#t~ret46#1; [2024-11-10 01:01:05,497 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3764: havoc calculate_output2_#t~ret47#1; [2024-11-10 01:01:05,498 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5254: havoc calculate_output3_#t~ret48#1; [2024-11-10 01:01:05,727 INFO L? ?]: Removed 2091 outVars from TransFormulas that were not future-live. [2024-11-10 01:01:05,728 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 01:01:05,758 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 01:01:05,758 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 01:01:05,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:01:05 BoogieIcfgContainer [2024-11-10 01:01:05,759 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 01:01:05,760 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 01:01:05,760 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 01:01:05,767 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 01:01:05,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:00:58" (1/3) ... [2024-11-10 01:01:05,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fbdcf23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:01:05, skipping insertion in model container [2024-11-10 01:01:05,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:01:00" (2/3) ... [2024-11-10 01:01:05,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fbdcf23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:01:05, skipping insertion in model container [2024-11-10 01:01:05,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:01:05" (3/3) ... [2024-11-10 01:01:05,773 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.BOUNDED-14.pals+Problem12_label06.c [2024-11-10 01:01:05,786 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 01:01:05,786 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 01:01:05,869 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 01:01:05,875 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;@3675e7d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 01:01:05,875 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 01:01:05,886 INFO L276 IsEmpty]: Start isEmpty. Operand has 937 states, 934 states have (on average 2.6252676659528906) internal successors, (2452), 936 states have internal predecessors, (2452), 0 states have call successors, (0), 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 01:01:05,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 01:01:05,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:05,895 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 01:01:05,896 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:05,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:05,900 INFO L85 PathProgramCache]: Analyzing trace with hash -450755715, now seen corresponding path program 1 times [2024-11-10 01:01:05,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:05,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077855762] [2024-11-10 01:01:05,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:05,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:06,219 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 01:01:06,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:06,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077855762] [2024-11-10 01:01:06,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077855762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:06,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:06,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 01:01:06,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008017485] [2024-11-10 01:01:06,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:06,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:01:06,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:06,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:01:06,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:01:06,246 INFO L87 Difference]: Start difference. First operand has 937 states, 934 states have (on average 2.6252676659528906) internal successors, (2452), 936 states have internal predecessors, (2452), 0 states have call successors, (0), 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 3 states, 3 states have (on average 8.666666666666666) 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 01:01:10,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:10,733 INFO L93 Difference]: Finished difference Result 2588 states and 6993 transitions. [2024-11-10 01:01:10,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:01:10,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) 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 01:01:10,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:10,767 INFO L225 Difference]: With dead ends: 2588 [2024-11-10 01:01:10,768 INFO L226 Difference]: Without dead ends: 1621 [2024-11-10 01:01:10,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:01:10,780 INFO L432 NwaCegarLoop]: 717 mSDtfsCounter, 1676 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 3697 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1676 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 4393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 3697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:01:10,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1676 Valid, 730 Invalid, 4393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 3697 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-10 01:01:10,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2024-11-10 01:01:10,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1621. [2024-11-10 01:01:10,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1621 states, 1619 states have (on average 2.4564546016059294) internal successors, (3977), 1620 states have internal predecessors, (3977), 0 states have call successors, (0), 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 01:01:10,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1621 states to 1621 states and 3977 transitions. [2024-11-10 01:01:10,942 INFO L78 Accepts]: Start accepts. Automaton has 1621 states and 3977 transitions. Word has length 26 [2024-11-10 01:01:10,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:01:10,944 INFO L471 AbstractCegarLoop]: Abstraction has 1621 states and 3977 transitions. [2024-11-10 01:01:10,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) 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 01:01:10,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1621 states and 3977 transitions. [2024-11-10 01:01:10,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 01:01:10,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:10,948 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] [2024-11-10 01:01:10,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 01:01:10,949 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:10,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:10,950 INFO L85 PathProgramCache]: Analyzing trace with hash -752895771, now seen corresponding path program 1 times [2024-11-10 01:01:10,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:10,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282337998] [2024-11-10 01:01:10,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:10,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:11,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:11,241 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 01:01:11,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:11,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282337998] [2024-11-10 01:01:11,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282337998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:11,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:11,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:01:11,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613077576] [2024-11-10 01:01:11,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:11,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:01:11,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:11,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:01:11,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:01:11,252 INFO L87 Difference]: Start difference. First operand 1621 states and 3977 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 01:01:11,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:11,394 INFO L93 Difference]: Finished difference Result 1682 states and 4071 transitions. [2024-11-10 01:01:11,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:01:11,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-11-10 01:01:11,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:11,404 INFO L225 Difference]: With dead ends: 1682 [2024-11-10 01:01:11,405 INFO L226 Difference]: Without dead ends: 1621 [2024-11-10 01:01:11,406 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 01:01:11,408 INFO L432 NwaCegarLoop]: 2315 mSDtfsCounter, 0 mSDsluCounter, 6890 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9205 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:01:11,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9205 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:01:11,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2024-11-10 01:01:11,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1621. [2024-11-10 01:01:11,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1621 states, 1619 states have (on average 2.4255713403335393) internal successors, (3927), 1620 states have internal predecessors, (3927), 0 states have call successors, (0), 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 01:01:11,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1621 states to 1621 states and 3927 transitions. [2024-11-10 01:01:11,466 INFO L78 Accepts]: Start accepts. Automaton has 1621 states and 3927 transitions. Word has length 30 [2024-11-10 01:01:11,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:01:11,466 INFO L471 AbstractCegarLoop]: Abstraction has 1621 states and 3927 transitions. [2024-11-10 01:01:11,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 01:01:11,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1621 states and 3927 transitions. [2024-11-10 01:01:11,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 01:01:11,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:11,474 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:01:11,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 01:01:11,475 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:11,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:11,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1903427819, now seen corresponding path program 1 times [2024-11-10 01:01:11,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:11,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652969089] [2024-11-10 01:01:11,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:11,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:11,911 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 01:01:11,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:11,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652969089] [2024-11-10 01:01:11,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652969089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:11,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:11,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:01:11,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717114545] [2024-11-10 01:01:11,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:11,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:01:11,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:11,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:01:11,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:01:11,915 INFO L87 Difference]: Start difference. First operand 1621 states and 3927 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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 01:01:12,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:12,513 INFO L93 Difference]: Finished difference Result 2419 states and 5187 transitions. [2024-11-10 01:01:12,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 01:01:12,514 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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 79 [2024-11-10 01:01:12,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:12,529 INFO L225 Difference]: With dead ends: 2419 [2024-11-10 01:01:12,529 INFO L226 Difference]: Without dead ends: 2362 [2024-11-10 01:01:12,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2024-11-10 01:01:12,533 INFO L432 NwaCegarLoop]: 2263 mSDtfsCounter, 16322 mSDsluCounter, 3401 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16322 SdHoareTripleChecker+Valid, 5664 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:01:12,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16322 Valid, 5664 Invalid, 290 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [10 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:01:12,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2024-11-10 01:01:12,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 1675. [2024-11-10 01:01:12,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1675 states, 1673 states have (on average 2.398684997011357) internal successors, (4013), 1674 states have internal predecessors, (4013), 0 states have call successors, (0), 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 01:01:12,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1675 states and 4013 transitions. [2024-11-10 01:01:12,606 INFO L78 Accepts]: Start accepts. Automaton has 1675 states and 4013 transitions. Word has length 79 [2024-11-10 01:01:12,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:01:12,607 INFO L471 AbstractCegarLoop]: Abstraction has 1675 states and 4013 transitions. [2024-11-10 01:01:12,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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 01:01:12,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 4013 transitions. [2024-11-10 01:01:12,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 01:01:12,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:12,609 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:01:12,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 01:01:12,610 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:12,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:12,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1827426509, now seen corresponding path program 1 times [2024-11-10 01:01:12,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:12,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982773216] [2024-11-10 01:01:12,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:12,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:13,158 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 01:01:13,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:13,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982773216] [2024-11-10 01:01:13,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982773216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:13,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:13,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:01:13,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840883535] [2024-11-10 01:01:13,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:13,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:01:13,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:13,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:01:13,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:01:13,161 INFO L87 Difference]: Start difference. First operand 1675 states and 4013 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 0 states have call successors, (0), 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 01:01:13,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:13,505 INFO L93 Difference]: Finished difference Result 1789 states and 4191 transitions. [2024-11-10 01:01:13,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:01:13,509 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 0 states have call successors, (0), 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 01:01:13,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:13,516 INFO L225 Difference]: With dead ends: 1789 [2024-11-10 01:01:13,516 INFO L226 Difference]: Without dead ends: 1678 [2024-11-10 01:01:13,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-11-10 01:01:13,520 INFO L432 NwaCegarLoop]: 2258 mSDtfsCounter, 2243 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2243 SdHoareTripleChecker+Valid, 2874 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:01:13,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2243 Valid, 2874 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:01:13,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2024-11-10 01:01:13,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1675. [2024-11-10 01:01:13,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1675 states, 1673 states have (on average 2.3980872683801553) internal successors, (4012), 1674 states have internal predecessors, (4012), 0 states have call successors, (0), 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 01:01:13,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1675 states and 4012 transitions. [2024-11-10 01:01:13,553 INFO L78 Accepts]: Start accepts. Automaton has 1675 states and 4012 transitions. Word has length 81 [2024-11-10 01:01:13,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:01:13,555 INFO L471 AbstractCegarLoop]: Abstraction has 1675 states and 4012 transitions. [2024-11-10 01:01:13,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 0 states have call successors, (0), 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 01:01:13,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 4012 transitions. [2024-11-10 01:01:13,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 01:01:13,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:13,556 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:01:13,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 01:01:13,557 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:13,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:13,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1755501160, now seen corresponding path program 1 times [2024-11-10 01:01:13,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:13,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976639024] [2024-11-10 01:01:13,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:13,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:13,653 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 01:01:13,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:13,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976639024] [2024-11-10 01:01:13,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976639024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:13,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:13,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:01:13,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581572192] [2024-11-10 01:01:13,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:13,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:01:13,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:13,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:01:13,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:01:13,655 INFO L87 Difference]: Start difference. First operand 1675 states and 4012 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:13,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:13,701 INFO L93 Difference]: Finished difference Result 1885 states and 4342 transitions. [2024-11-10 01:01:13,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:01:13,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-10 01:01:13,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:13,709 INFO L225 Difference]: With dead ends: 1885 [2024-11-10 01:01:13,710 INFO L226 Difference]: Without dead ends: 1774 [2024-11-10 01:01:13,711 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 01:01:13,711 INFO L432 NwaCegarLoop]: 2273 mSDtfsCounter, 2182 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2182 SdHoareTripleChecker+Valid, 2358 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 01:01:13,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2182 Valid, 2358 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:01:13,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1774 states. [2024-11-10 01:01:13,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1771. [2024-11-10 01:01:13,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1771 states, 1769 states have (on average 2.3527416619559074) internal successors, (4162), 1770 states have internal predecessors, (4162), 0 states have call successors, (0), 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 01:01:13,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 4162 transitions. [2024-11-10 01:01:13,752 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 4162 transitions. Word has length 82 [2024-11-10 01:01:13,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:01:13,752 INFO L471 AbstractCegarLoop]: Abstraction has 1771 states and 4162 transitions. [2024-11-10 01:01:13,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:13,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 4162 transitions. [2024-11-10 01:01:13,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 01:01:13,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:13,754 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:01:13,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 01:01:13,755 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:13,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:13,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1519393231, now seen corresponding path program 1 times [2024-11-10 01:01:13,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:13,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137387141] [2024-11-10 01:01:13,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:13,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:13,828 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 01:01:13,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:13,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137387141] [2024-11-10 01:01:13,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137387141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:13,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:13,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:01:13,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360119200] [2024-11-10 01:01:13,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:13,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:01:13,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:13,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:01:13,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:01:13,830 INFO L87 Difference]: Start difference. First operand 1771 states and 4162 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 01:01:13,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:13,879 INFO L93 Difference]: Finished difference Result 1988 states and 4502 transitions. [2024-11-10 01:01:13,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:01:13,880 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 01:01:13,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:13,887 INFO L225 Difference]: With dead ends: 1988 [2024-11-10 01:01:13,887 INFO L226 Difference]: Without dead ends: 1877 [2024-11-10 01:01:13,888 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 01:01:13,889 INFO L432 NwaCegarLoop]: 2341 mSDtfsCounter, 2200 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2200 SdHoareTripleChecker+Valid, 2432 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 01:01:13,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2200 Valid, 2432 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:01:13,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2024-11-10 01:01:13,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1874. [2024-11-10 01:01:13,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1874 states, 1872 states have (on average 2.3087606837606836) internal successors, (4322), 1873 states have internal predecessors, (4322), 0 states have call successors, (0), 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 01:01:13,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 4322 transitions. [2024-11-10 01:01:13,924 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 4322 transitions. Word has length 83 [2024-11-10 01:01:13,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:01:13,925 INFO L471 AbstractCegarLoop]: Abstraction has 1874 states and 4322 transitions. [2024-11-10 01:01:13,925 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 01:01:13,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 4322 transitions. [2024-11-10 01:01:13,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 01:01:13,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:13,927 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:01:13,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 01:01:13,927 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:13,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:13,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1667474161, now seen corresponding path program 1 times [2024-11-10 01:01:13,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:13,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111914544] [2024-11-10 01:01:13,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:13,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:14,000 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 01:01:14,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:14,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111914544] [2024-11-10 01:01:14,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111914544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:14,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:14,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:01:14,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884227451] [2024-11-10 01:01:14,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:14,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:01:14,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:14,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:01:14,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:01:14,002 INFO L87 Difference]: Start difference. First operand 1874 states and 4322 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 01:01:14,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:14,039 INFO L93 Difference]: Finished difference Result 2464 states and 5244 transitions. [2024-11-10 01:01:14,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:01:14,042 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 01:01:14,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:14,049 INFO L225 Difference]: With dead ends: 2464 [2024-11-10 01:01:14,049 INFO L226 Difference]: Without dead ends: 2157 [2024-11-10 01:01:14,050 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 01:01:14,052 INFO L432 NwaCegarLoop]: 2343 mSDtfsCounter, 2198 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2198 SdHoareTripleChecker+Valid, 2438 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 01:01:14,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2198 Valid, 2438 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:01:14,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2157 states. [2024-11-10 01:01:14,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2157 to 2154. [2024-11-10 01:01:14,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2154 states, 2152 states have (on average 2.20910780669145) internal successors, (4754), 2153 states have internal predecessors, (4754), 0 states have call successors, (0), 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 01:01:14,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 4754 transitions. [2024-11-10 01:01:14,092 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 4754 transitions. Word has length 83 [2024-11-10 01:01:14,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:01:14,092 INFO L471 AbstractCegarLoop]: Abstraction has 2154 states and 4754 transitions. [2024-11-10 01:01:14,093 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 01:01:14,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 4754 transitions. [2024-11-10 01:01:14,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 01:01:14,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:14,094 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:01:14,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 01:01:14,094 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:14,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:14,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1854952335, now seen corresponding path program 1 times [2024-11-10 01:01:14,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:14,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595633184] [2024-11-10 01:01:14,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:14,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:14,156 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 01:01:14,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:14,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595633184] [2024-11-10 01:01:14,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595633184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:14,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:14,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:01:14,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960386936] [2024-11-10 01:01:14,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:14,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:01:14,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:14,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:01:14,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:01:14,158 INFO L87 Difference]: Start difference. First operand 2154 states and 4754 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 01:01:14,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:14,208 INFO L93 Difference]: Finished difference Result 3280 states and 6498 transitions. [2024-11-10 01:01:14,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:01:14,209 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 01:01:14,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:14,217 INFO L225 Difference]: With dead ends: 3280 [2024-11-10 01:01:14,217 INFO L226 Difference]: Without dead ends: 2693 [2024-11-10 01:01:14,218 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 01:01:14,219 INFO L432 NwaCegarLoop]: 2331 mSDtfsCounter, 2194 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2194 SdHoareTripleChecker+Valid, 2434 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 01:01:14,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2194 Valid, 2434 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:01:14,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2693 states. [2024-11-10 01:01:14,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2693 to 2690. [2024-11-10 01:01:14,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2690 states, 2688 states have (on average 2.072172619047619) internal successors, (5570), 2689 states have internal predecessors, (5570), 0 states have call successors, (0), 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 01:01:14,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2690 states to 2690 states and 5570 transitions. [2024-11-10 01:01:14,268 INFO L78 Accepts]: Start accepts. Automaton has 2690 states and 5570 transitions. Word has length 83 [2024-11-10 01:01:14,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:01:14,269 INFO L471 AbstractCegarLoop]: Abstraction has 2690 states and 5570 transitions. [2024-11-10 01:01:14,269 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 01:01:14,269 INFO L276 IsEmpty]: Start isEmpty. Operand 2690 states and 5570 transitions. [2024-11-10 01:01:14,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 01:01:14,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:14,270 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:01:14,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 01:01:14,270 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:14,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:14,270 INFO L85 PathProgramCache]: Analyzing trace with hash 853542607, now seen corresponding path program 1 times [2024-11-10 01:01:14,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:14,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511926807] [2024-11-10 01:01:14,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:14,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:14,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:14,323 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 01:01:14,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:14,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511926807] [2024-11-10 01:01:14,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511926807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:14,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:14,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:01:14,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440261069] [2024-11-10 01:01:14,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:14,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:01:14,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:14,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:01:14,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:01:14,327 INFO L87 Difference]: Start difference. First operand 2690 states and 5570 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 01:01:14,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:14,379 INFO L93 Difference]: Finished difference Result 4840 states and 8862 transitions. [2024-11-10 01:01:14,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:01:14,380 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 01:01:14,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:14,398 INFO L225 Difference]: With dead ends: 4840 [2024-11-10 01:01:14,399 INFO L226 Difference]: Without dead ends: 3717 [2024-11-10 01:01:14,402 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 01:01:14,402 INFO L432 NwaCegarLoop]: 2329 mSDtfsCounter, 2192 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2192 SdHoareTripleChecker+Valid, 2436 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 01:01:14,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2192 Valid, 2436 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:01:14,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3717 states. [2024-11-10 01:01:14,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3717 to 3714. [2024-11-10 01:01:14,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3714 states, 3712 states have (on average 1.9143318965517242) internal successors, (7106), 3713 states have internal predecessors, (7106), 0 states have call successors, (0), 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 01:01:14,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3714 states to 3714 states and 7106 transitions. [2024-11-10 01:01:14,481 INFO L78 Accepts]: Start accepts. Automaton has 3714 states and 7106 transitions. Word has length 83 [2024-11-10 01:01:14,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:01:14,482 INFO L471 AbstractCegarLoop]: Abstraction has 3714 states and 7106 transitions. [2024-11-10 01:01:14,482 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 01:01:14,482 INFO L276 IsEmpty]: Start isEmpty. Operand 3714 states and 7106 transitions. [2024-11-10 01:01:14,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 01:01:14,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:14,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, 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 01:01:14,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 01:01:14,483 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:14,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:14,483 INFO L85 PathProgramCache]: Analyzing trace with hash 839092751, now seen corresponding path program 1 times [2024-11-10 01:01:14,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:14,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334809398] [2024-11-10 01:01:14,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:14,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:14,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:14,534 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 01:01:14,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:14,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334809398] [2024-11-10 01:01:14,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334809398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:14,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:14,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:01:14,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439189611] [2024-11-10 01:01:14,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:14,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:01:14,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:14,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:01:14,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:01:14,536 INFO L87 Difference]: Start difference. First operand 3714 states and 7106 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 01:01:14,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:14,603 INFO L93 Difference]: Finished difference Result 7816 states and 13302 transitions. [2024-11-10 01:01:14,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:01:14,603 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 01:01:14,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:14,614 INFO L225 Difference]: With dead ends: 7816 [2024-11-10 01:01:14,615 INFO L226 Difference]: Without dead ends: 5669 [2024-11-10 01:01:14,619 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 01:01:14,619 INFO L432 NwaCegarLoop]: 2327 mSDtfsCounter, 2190 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2190 SdHoareTripleChecker+Valid, 2438 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 01:01:14,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2190 Valid, 2438 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:01:14,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5669 states. [2024-11-10 01:01:14,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5669 to 5666. [2024-11-10 01:01:14,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5666 states, 5664 states have (on average 1.7630649717514124) internal successors, (9986), 5665 states have internal predecessors, (9986), 0 states have call successors, (0), 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 01:01:14,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5666 states to 5666 states and 9986 transitions. [2024-11-10 01:01:14,751 INFO L78 Accepts]: Start accepts. Automaton has 5666 states and 9986 transitions. Word has length 83 [2024-11-10 01:01:14,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:01:14,751 INFO L471 AbstractCegarLoop]: Abstraction has 5666 states and 9986 transitions. [2024-11-10 01:01:14,752 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 01:01:14,752 INFO L276 IsEmpty]: Start isEmpty. Operand 5666 states and 9986 transitions. [2024-11-10 01:01:14,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 01:01:14,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:14,753 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:01:14,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 01:01:14,753 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:14,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:14,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1364271793, now seen corresponding path program 1 times [2024-11-10 01:01:14,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:14,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556495525] [2024-11-10 01:01:14,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:14,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:14,890 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 01:01:14,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:14,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556495525] [2024-11-10 01:01:14,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556495525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:14,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:14,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:01:14,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189546398] [2024-11-10 01:01:14,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:14,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:01:14,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:14,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:01:14,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:01:14,892 INFO L87 Difference]: Start difference. First operand 5666 states and 9986 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 01:01:14,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:14,995 INFO L93 Difference]: Finished difference Result 13480 states and 21606 transitions. [2024-11-10 01:01:14,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:01:14,996 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 01:01:14,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:15,015 INFO L225 Difference]: With dead ends: 13480 [2024-11-10 01:01:15,016 INFO L226 Difference]: Without dead ends: 9381 [2024-11-10 01:01:15,024 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 01:01:15,025 INFO L432 NwaCegarLoop]: 2325 mSDtfsCounter, 2188 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2188 SdHoareTripleChecker+Valid, 2440 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 01:01:15,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2188 Valid, 2440 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:01:15,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9381 states. [2024-11-10 01:01:15,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9381 to 9378. [2024-11-10 01:01:15,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9378 states, 9376 states have (on average 1.638438566552901) internal successors, (15362), 9377 states have internal predecessors, (15362), 0 states have call successors, (0), 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 01:01:15,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9378 states to 9378 states and 15362 transitions. [2024-11-10 01:01:15,225 INFO L78 Accepts]: Start accepts. Automaton has 9378 states and 15362 transitions. Word has length 83 [2024-11-10 01:01:15,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:01:15,225 INFO L471 AbstractCegarLoop]: Abstraction has 9378 states and 15362 transitions. [2024-11-10 01:01:15,226 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 01:01:15,226 INFO L276 IsEmpty]: Start isEmpty. Operand 9378 states and 15362 transitions. [2024-11-10 01:01:15,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 01:01:15,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:15,227 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:01:15,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 01:01:15,227 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:15,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:15,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1888548848, now seen corresponding path program 1 times [2024-11-10 01:01:15,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:15,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395158900] [2024-11-10 01:01:15,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:15,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:15,520 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 01:01:15,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:15,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395158900] [2024-11-10 01:01:15,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395158900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:15,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:15,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 01:01:15,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571984607] [2024-11-10 01:01:15,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:15,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 01:01:15,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:15,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 01:01:15,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:01:15,522 INFO L87 Difference]: Start difference. First operand 9378 states and 15362 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 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 01:01:15,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:15,682 INFO L93 Difference]: Finished difference Result 9765 states and 15876 transitions. [2024-11-10 01:01:15,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 01:01:15,684 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 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 01:01:15,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:15,700 INFO L225 Difference]: With dead ends: 9765 [2024-11-10 01:01:15,700 INFO L226 Difference]: Without dead ends: 9762 [2024-11-10 01:01:15,704 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 01:01:15,704 INFO L432 NwaCegarLoop]: 2261 mSDtfsCounter, 0 mSDsluCounter, 13553 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15814 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.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:01:15,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15814 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:01:15,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9762 states. [2024-11-10 01:01:15,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9762 to 9762. [2024-11-10 01:01:15,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9762 states, 9760 states have (on average 1.6100409836065575) internal successors, (15714), 9761 states have internal predecessors, (15714), 0 states have call successors, (0), 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 01:01:16,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9762 states to 9762 states and 15714 transitions. [2024-11-10 01:01:16,085 INFO L78 Accepts]: Start accepts. Automaton has 9762 states and 15714 transitions. Word has length 83 [2024-11-10 01:01:16,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:01:16,086 INFO L471 AbstractCegarLoop]: Abstraction has 9762 states and 15714 transitions. [2024-11-10 01:01:16,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 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 01:01:16,086 INFO L276 IsEmpty]: Start isEmpty. Operand 9762 states and 15714 transitions. [2024-11-10 01:01:16,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 01:01:16,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:16,087 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:01:16,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 01:01:16,087 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:16,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:16,087 INFO L85 PathProgramCache]: Analyzing trace with hash 2137026639, now seen corresponding path program 1 times [2024-11-10 01:01:16,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:16,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230326501] [2024-11-10 01:01:16,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:16,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:16,139 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 01:01:16,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:16,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230326501] [2024-11-10 01:01:16,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230326501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:16,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:16,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:01:16,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824885265] [2024-11-10 01:01:16,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:16,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:01:16,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:16,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:01:16,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:01:16,141 INFO L87 Difference]: Start difference. First operand 9762 states and 15714 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 01:01:16,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:16,295 INFO L93 Difference]: Finished difference Result 25384 states and 38118 transitions. [2024-11-10 01:01:16,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:01:16,295 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 01:01:16,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:16,322 INFO L225 Difference]: With dead ends: 25384 [2024-11-10 01:01:16,322 INFO L226 Difference]: Without dead ends: 17189 [2024-11-10 01:01:16,338 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 01:01:16,338 INFO L432 NwaCegarLoop]: 2341 mSDtfsCounter, 2196 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2196 SdHoareTripleChecker+Valid, 2440 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 01:01:16,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2196 Valid, 2440 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:01:16,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17189 states. [2024-11-10 01:01:16,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17189 to 17186. [2024-11-10 01:01:16,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17186 states, 17184 states have (on average 1.5159450651769089) internal successors, (26050), 17185 states have internal predecessors, (26050), 0 states have call successors, (0), 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 01:01:16,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17186 states to 17186 states and 26050 transitions. [2024-11-10 01:01:16,659 INFO L78 Accepts]: Start accepts. Automaton has 17186 states and 26050 transitions. Word has length 83 [2024-11-10 01:01:16,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:01:16,660 INFO L471 AbstractCegarLoop]: Abstraction has 17186 states and 26050 transitions. [2024-11-10 01:01:16,660 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 01:01:16,660 INFO L276 IsEmpty]: Start isEmpty. Operand 17186 states and 26050 transitions. [2024-11-10 01:01:16,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-10 01:01:16,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:16,662 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:01:16,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 01:01:16,663 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:16,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:16,663 INFO L85 PathProgramCache]: Analyzing trace with hash -401580594, now seen corresponding path program 1 times [2024-11-10 01:01:16,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:16,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097279989] [2024-11-10 01:01:16,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:16,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:16,839 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:01:16,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:16,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097279989] [2024-11-10 01:01:16,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097279989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:16,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:16,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:01:16,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090212307] [2024-11-10 01:01:16,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:16,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:01:16,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:16,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:01:16,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:01:16,841 INFO L87 Difference]: Start difference. First operand 17186 states and 26050 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:21,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:21,763 INFO L93 Difference]: Finished difference Result 19445 states and 31489 transitions. [2024-11-10 01:01:21,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:01:21,763 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2024-11-10 01:01:21,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:21,787 INFO L225 Difference]: With dead ends: 19445 [2024-11-10 01:01:21,787 INFO L226 Difference]: Without dead ends: 17938 [2024-11-10 01:01:21,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:01:21,791 INFO L432 NwaCegarLoop]: 839 mSDtfsCounter, 3228 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 5192 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3228 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 5413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 5192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-10 01:01:21,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3228 Valid, 1467 Invalid, 5413 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [221 Valid, 5192 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-10 01:01:21,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17938 states. [2024-11-10 01:01:22,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17938 to 17938. [2024-11-10 01:01:22,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17938 states, 17936 states have (on average 1.5325602140945584) internal successors, (27488), 17937 states have internal predecessors, (27488), 0 states have call successors, (0), 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 01:01:22,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17938 states to 17938 states and 27488 transitions. [2024-11-10 01:01:22,089 INFO L78 Accepts]: Start accepts. Automaton has 17938 states and 27488 transitions. Word has length 102 [2024-11-10 01:01:22,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:01:22,089 INFO L471 AbstractCegarLoop]: Abstraction has 17938 states and 27488 transitions. [2024-11-10 01:01:22,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:22,089 INFO L276 IsEmpty]: Start isEmpty. Operand 17938 states and 27488 transitions. [2024-11-10 01:01:22,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 01:01:22,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:22,095 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:01:22,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 01:01:22,095 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:22,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:22,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1954013601, now seen corresponding path program 1 times [2024-11-10 01:01:22,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:22,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946729787] [2024-11-10 01:01:22,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:22,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:22,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:22,285 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 01:01:22,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:22,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946729787] [2024-11-10 01:01:22,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946729787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:22,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:22,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:01:22,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781638916] [2024-11-10 01:01:22,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:22,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:01:22,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:22,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:01:22,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:01:22,288 INFO L87 Difference]: Start difference. First operand 17938 states and 27488 transitions. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:23,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:23,676 INFO L93 Difference]: Finished difference Result 125930 states and 180912 transitions. [2024-11-10 01:01:23,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:01:23,677 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2024-11-10 01:01:23,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:23,843 INFO L225 Difference]: With dead ends: 125930 [2024-11-10 01:01:23,843 INFO L226 Difference]: Without dead ends: 114919 [2024-11-10 01:01:23,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-10 01:01:23,955 INFO L432 NwaCegarLoop]: 2358 mSDtfsCounter, 13990 mSDsluCounter, 3606 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13990 SdHoareTripleChecker+Valid, 5964 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:01:23,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13990 Valid, 5964 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:01:24,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114919 states. [2024-11-10 01:01:25,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114919 to 31314. [2024-11-10 01:01:25,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31314 states, 31312 states have (on average 1.4787940725600408) internal successors, (46304), 31313 states have internal predecessors, (46304), 0 states have call successors, (0), 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 01:01:25,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31314 states to 31314 states and 46304 transitions. [2024-11-10 01:01:25,526 INFO L78 Accepts]: Start accepts. Automaton has 31314 states and 46304 transitions. Word has length 108 [2024-11-10 01:01:25,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:01:25,527 INFO L471 AbstractCegarLoop]: Abstraction has 31314 states and 46304 transitions. [2024-11-10 01:01:25,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:25,528 INFO L276 IsEmpty]: Start isEmpty. Operand 31314 states and 46304 transitions. [2024-11-10 01:01:25,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 01:01:25,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:25,534 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:01:25,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 01:01:25,535 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:25,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:25,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1232853791, now seen corresponding path program 1 times [2024-11-10 01:01:25,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:25,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898632286] [2024-11-10 01:01:25,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:25,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:25,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:25,750 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 01:01:25,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:25,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898632286] [2024-11-10 01:01:25,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898632286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:25,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:25,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:01:25,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630020655] [2024-11-10 01:01:25,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:25,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:01:25,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:25,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:01:25,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:01:25,752 INFO L87 Difference]: Start difference. First operand 31314 states and 46304 transitions. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:28,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:28,072 INFO L93 Difference]: Finished difference Result 141546 states and 202992 transitions. [2024-11-10 01:01:28,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:01:28,074 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2024-11-10 01:01:28,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:28,239 INFO L225 Difference]: With dead ends: 141546 [2024-11-10 01:01:28,240 INFO L226 Difference]: Without dead ends: 125927 [2024-11-10 01:01:28,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-10 01:01:28,270 INFO L432 NwaCegarLoop]: 2359 mSDtfsCounter, 13989 mSDsluCounter, 3552 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13989 SdHoareTripleChecker+Valid, 5911 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:01:28,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13989 Valid, 5911 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:01:28,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125927 states. [2024-11-10 01:01:30,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125927 to 52434. [2024-11-10 01:01:30,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52434 states, 52432 states have (on average 1.4494964906927068) internal successors, (76000), 52433 states have internal predecessors, (76000), 0 states have call successors, (0), 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 01:01:30,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52434 states to 52434 states and 76000 transitions. [2024-11-10 01:01:30,327 INFO L78 Accepts]: Start accepts. Automaton has 52434 states and 76000 transitions. Word has length 108 [2024-11-10 01:01:30,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:01:30,328 INFO L471 AbstractCegarLoop]: Abstraction has 52434 states and 76000 transitions. [2024-11-10 01:01:30,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:30,328 INFO L276 IsEmpty]: Start isEmpty. Operand 52434 states and 76000 transitions. [2024-11-10 01:01:30,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 01:01:30,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:30,338 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:01:30,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 01:01:30,338 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:30,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:30,338 INFO L85 PathProgramCache]: Analyzing trace with hash -2005394591, now seen corresponding path program 1 times [2024-11-10 01:01:30,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:30,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170483439] [2024-11-10 01:01:30,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:30,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:30,554 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 01:01:30,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:30,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170483439] [2024-11-10 01:01:30,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170483439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:30,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:30,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:01:30,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363052799] [2024-11-10 01:01:30,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:30,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:01:30,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:30,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:01:30,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:01:30,556 INFO L87 Difference]: Start difference. First operand 52434 states and 76000 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:33,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:33,720 INFO L93 Difference]: Finished difference Result 157162 states and 225008 transitions. [2024-11-10 01:01:33,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:01:33,721 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2024-11-10 01:01:33,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:33,965 INFO L225 Difference]: With dead ends: 157162 [2024-11-10 01:01:33,966 INFO L226 Difference]: Without dead ends: 141543 [2024-11-10 01:01:34,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-10 01:01:34,027 INFO L432 NwaCegarLoop]: 2356 mSDtfsCounter, 14035 mSDsluCounter, 3570 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14035 SdHoareTripleChecker+Valid, 5926 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:01:34,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14035 Valid, 5926 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:01:34,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141543 states. [2024-11-10 01:01:36,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141543 to 68050. [2024-11-10 01:01:36,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68050 states, 68048 states have (on average 1.4403950152833294) internal successors, (98016), 68049 states have internal predecessors, (98016), 0 states have call successors, (0), 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 01:01:37,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68050 states to 68050 states and 98016 transitions. [2024-11-10 01:01:37,099 INFO L78 Accepts]: Start accepts. Automaton has 68050 states and 98016 transitions. Word has length 108 [2024-11-10 01:01:37,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:01:37,101 INFO L471 AbstractCegarLoop]: Abstraction has 68050 states and 98016 transitions. [2024-11-10 01:01:37,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:37,101 INFO L276 IsEmpty]: Start isEmpty. Operand 68050 states and 98016 transitions. [2024-11-10 01:01:37,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 01:01:37,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:37,117 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:01:37,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 01:01:37,117 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:37,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:37,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1288162977, now seen corresponding path program 1 times [2024-11-10 01:01:37,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:37,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272748536] [2024-11-10 01:01:37,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:37,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:37,277 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-10 01:01:37,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:37,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272748536] [2024-11-10 01:01:37,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272748536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:37,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:37,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:01:37,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649739649] [2024-11-10 01:01:37,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:37,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:01:37,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:37,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:01:37,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:01:37,386 INFO L87 Difference]: Start difference. First operand 68050 states and 98016 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:40,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:40,573 INFO L93 Difference]: Finished difference Result 172778 states and 247024 transitions. [2024-11-10 01:01:40,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:01:40,573 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2024-11-10 01:01:40,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:40,900 INFO L225 Difference]: With dead ends: 172778 [2024-11-10 01:01:40,901 INFO L226 Difference]: Without dead ends: 157159 [2024-11-10 01:01:40,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-10 01:01:40,929 INFO L432 NwaCegarLoop]: 2353 mSDtfsCounter, 14092 mSDsluCounter, 3490 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14092 SdHoareTripleChecker+Valid, 5843 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:01:40,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14092 Valid, 5843 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:01:41,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157159 states. [2024-11-10 01:01:43,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157159 to 83666. [2024-11-10 01:01:43,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83666 states, 83664 states have (on average 1.434691145534519) internal successors, (120032), 83665 states have internal predecessors, (120032), 0 states have call successors, (0), 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 01:01:44,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83666 states to 83666 states and 120032 transitions. [2024-11-10 01:01:44,113 INFO L78 Accepts]: Start accepts. Automaton has 83666 states and 120032 transitions. Word has length 108 [2024-11-10 01:01:44,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:01:44,113 INFO L471 AbstractCegarLoop]: Abstraction has 83666 states and 120032 transitions. [2024-11-10 01:01:44,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:44,113 INFO L276 IsEmpty]: Start isEmpty. Operand 83666 states and 120032 transitions. [2024-11-10 01:01:44,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 01:01:44,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:44,132 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:01:44,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 01:01:44,132 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:44,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:44,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1273713121, now seen corresponding path program 1 times [2024-11-10 01:01:44,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:44,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815260845] [2024-11-10 01:01:44,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:44,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:44,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:44,323 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-10 01:01:44,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:44,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815260845] [2024-11-10 01:01:44,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815260845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:44,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:44,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:01:44,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244332472] [2024-11-10 01:01:44,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:44,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:01:44,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:44,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:01:44,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:01:44,324 INFO L87 Difference]: Start difference. First operand 83666 states and 120032 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:48,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:01:48,755 INFO L93 Difference]: Finished difference Result 188394 states and 269040 transitions. [2024-11-10 01:01:48,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:01:48,755 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2024-11-10 01:01:48,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:01:48,998 INFO L225 Difference]: With dead ends: 188394 [2024-11-10 01:01:48,998 INFO L226 Difference]: Without dead ends: 172775 [2024-11-10 01:01:49,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-10 01:01:49,036 INFO L432 NwaCegarLoop]: 2350 mSDtfsCounter, 14150 mSDsluCounter, 3505 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14150 SdHoareTripleChecker+Valid, 5855 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:01:49,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14150 Valid, 5855 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:01:49,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172775 states. [2024-11-10 01:01:52,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172775 to 99282. [2024-11-10 01:01:52,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99282 states, 99280 states have (on average 1.430781627719581) internal successors, (142048), 99281 states have internal predecessors, (142048), 0 states have call successors, (0), 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 01:01:52,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99282 states to 99282 states and 142048 transitions. [2024-11-10 01:01:52,270 INFO L78 Accepts]: Start accepts. Automaton has 99282 states and 142048 transitions. Word has length 108 [2024-11-10 01:01:52,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:01:52,270 INFO L471 AbstractCegarLoop]: Abstraction has 99282 states and 142048 transitions. [2024-11-10 01:01:52,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:01:52,271 INFO L276 IsEmpty]: Start isEmpty. Operand 99282 states and 142048 transitions. [2024-11-10 01:01:52,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 01:01:52,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:01:52,278 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:01:52,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 01:01:52,278 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:01:52,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:01:52,279 INFO L85 PathProgramCache]: Analyzing trace with hash -929651423, now seen corresponding path program 1 times [2024-11-10 01:01:52,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:01:52,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59243191] [2024-11-10 01:01:52,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:01:52,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:01:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:01:52,446 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 01:01:52,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:01:52,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59243191] [2024-11-10 01:01:52,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59243191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:01:52,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:01:52,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:01:52,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917531667] [2024-11-10 01:01:52,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:01:52,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:01:52,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:01:52,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:01:52,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:01:52,448 INFO L87 Difference]: Start difference. First operand 99282 states and 142048 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)