./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label03.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label03.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 5d6ca24940c3ee50144301bfe2ad5c39a9e1b17caba3dcee976fe158697f7f6f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 21:39:05,620 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 21:39:05,699 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 21:39:05,705 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 21:39:05,708 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 21:39:05,735 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 21:39:05,736 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 21:39:05,736 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 21:39:05,737 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 21:39:05,737 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 21:39:05,738 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 21:39:05,738 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 21:39:05,739 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 21:39:05,739 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 21:39:05,739 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 21:39:05,740 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 21:39:05,740 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 21:39:05,740 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 21:39:05,741 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 21:39:05,741 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 21:39:05,741 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 21:39:05,742 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 21:39:05,742 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 21:39:05,742 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 21:39:05,743 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 21:39:05,743 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 21:39:05,743 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 21:39:05,743 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 21:39:05,744 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 21:39:05,744 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 21:39:05,744 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 21:39:05,745 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 21:39:05,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:39:05,745 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 21:39:05,745 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 21:39:05,746 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 21:39:05,746 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 21:39:05,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 21:39:05,747 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 21:39:05,747 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 21:39:05,747 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 21:39:05,748 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 21:39:05,748 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 -> 5d6ca24940c3ee50144301bfe2ad5c39a9e1b17caba3dcee976fe158697f7f6f [2024-10-12 21:39:06,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 21:39:06,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 21:39:06,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 21:39:06,041 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 21:39:06,042 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 21:39:06,043 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label03.c [2024-10-12 21:39:07,478 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 21:39:07,945 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 21:39:07,947 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label03.c [2024-10-12 21:39:07,992 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab3ba74c7/11a3bc64c8f94e2dba160dc75bc4739a/FLAG9cfee565b [2024-10-12 21:39:08,008 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab3ba74c7/11a3bc64c8f94e2dba160dc75bc4739a [2024-10-12 21:39:08,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 21:39:08,013 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 21:39:08,015 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 21:39:08,015 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 21:39:08,021 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 21:39:08,021 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:39:08" (1/1) ... [2024-10-12 21:39:08,022 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@764d8b71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:39:08, skipping insertion in model container [2024-10-12 21:39:08,024 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:39:08" (1/1) ... [2024-10-12 21:39:08,158 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 21:39:08,556 WARN L248 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.8.ufo.UNBOUNDED.pals+Problem12_label03.c[26888,26901] [2024-10-12 21:39:08,585 WARN L248 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.8.ufo.UNBOUNDED.pals+Problem12_label03.c[29225,29238] [2024-10-12 21:39:09,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:39:09,347 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 21:39:09,398 WARN L248 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.8.ufo.UNBOUNDED.pals+Problem12_label03.c[26888,26901] [2024-10-12 21:39:09,406 WARN L248 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.8.ufo.UNBOUNDED.pals+Problem12_label03.c[29225,29238] [2024-10-12 21:39:09,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:39:09,803 INFO L204 MainTranslator]: Completed translation [2024-10-12 21:39:09,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:39:09 WrapperNode [2024-10-12 21:39:09,804 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 21:39:09,805 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 21:39:09,805 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 21:39:09,805 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 21:39:09,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:39:09" (1/1) ... [2024-10-12 21:39:09,892 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:39:09" (1/1) ... [2024-10-12 21:39:10,125 INFO L138 Inliner]: procedures = 40, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5291 [2024-10-12 21:39:10,125 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 21:39:10,126 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 21:39:10,126 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 21:39:10,126 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 21:39:10,141 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:39:09" (1/1) ... [2024-10-12 21:39:10,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:39:09" (1/1) ... [2024-10-12 21:39:10,197 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:39:09" (1/1) ... [2024-10-12 21:39:10,456 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-10-12 21:39:10,457 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:39:09" (1/1) ... [2024-10-12 21:39:10,457 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:39:09" (1/1) ... [2024-10-12 21:39:10,706 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:39:09" (1/1) ... [2024-10-12 21:39:10,739 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:39:09" (1/1) ... [2024-10-12 21:39:10,792 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:39:09" (1/1) ... [2024-10-12 21:39:10,811 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:39:09" (1/1) ... [2024-10-12 21:39:10,894 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 21:39:10,896 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 21:39:10,896 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 21:39:10,896 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 21:39:10,898 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:39:09" (1/1) ... [2024-10-12 21:39:10,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:39:10,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:39:10,936 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-10-12 21:39:10,939 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-10-12 21:39:10,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 21:39:10,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 21:39:10,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 21:39:10,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 21:39:11,153 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 21:39:11,156 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 21:39:15,549 INFO L? ?]: Removed 759 outVars from TransFormulas that were not future-live. [2024-10-12 21:39:15,549 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 21:39:15,617 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 21:39:15,621 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 21:39:15,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:39:15 BoogieIcfgContainer [2024-10-12 21:39:15,622 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 21:39:15,623 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 21:39:15,624 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 21:39:15,627 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 21:39:15,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 09:39:08" (1/3) ... [2024-10-12 21:39:15,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6378844b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:39:15, skipping insertion in model container [2024-10-12 21:39:15,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:39:09" (2/3) ... [2024-10-12 21:39:15,630 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6378844b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:39:15, skipping insertion in model container [2024-10-12 21:39:15,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:39:15" (3/3) ... [2024-10-12 21:39:15,632 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label03.c [2024-10-12 21:39:15,648 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 21:39:15,648 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 21:39:15,742 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 21:39:15,750 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;@68d26ada, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 21:39:15,750 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 21:39:15,762 INFO L276 IsEmpty]: Start isEmpty. Operand has 884 states, 881 states have (on average 1.9693530079455164) internal successors, (1735), 883 states have internal predecessors, (1735), 0 states have call successors, (0), 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-10-12 21:39:15,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-12 21:39:15,770 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:15,771 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:39:15,771 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:15,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:15,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1712849582, now seen corresponding path program 1 times [2024-10-12 21:39:15,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:15,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507958578] [2024-10-12 21:39:15,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:15,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:16,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:39:16,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:16,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507958578] [2024-10-12 21:39:16,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507958578] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:16,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:16,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 21:39:16,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788193644] [2024-10-12 21:39:16,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:16,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 21:39:16,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:16,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 21:39:16,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 21:39:16,071 INFO L87 Difference]: Start difference. First operand has 884 states, 881 states have (on average 1.9693530079455164) internal successors, (1735), 883 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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-10-12 21:39:16,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:16,187 INFO L93 Difference]: Finished difference Result 1702 states and 3341 transitions. [2024-10-12 21:39:16,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 21:39:16,190 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-10-12 21:39:16,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:16,209 INFO L225 Difference]: With dead ends: 1702 [2024-10-12 21:39:16,209 INFO L226 Difference]: Without dead ends: 880 [2024-10-12 21:39:16,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 21:39:16,221 INFO L432 NwaCegarLoop]: 1663 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1663 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:39:16,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1663 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:39:16,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2024-10-12 21:39:16,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 880. [2024-10-12 21:39:16,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 878 states have (on average 1.8952164009111618) internal successors, (1664), 879 states have internal predecessors, (1664), 0 states have call successors, (0), 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-10-12 21:39:16,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1664 transitions. [2024-10-12 21:39:16,325 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1664 transitions. Word has length 19 [2024-10-12 21:39:16,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:16,326 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 1664 transitions. [2024-10-12 21:39:16,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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-10-12 21:39:16,327 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1664 transitions. [2024-10-12 21:39:16,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-12 21:39:16,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:16,328 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:39:16,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 21:39:16,329 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:16,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:16,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1208531677, now seen corresponding path program 1 times [2024-10-12 21:39:16,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:16,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515524679] [2024-10-12 21:39:16,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:16,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:16,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:39:16,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:16,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515524679] [2024-10-12 21:39:16,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515524679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:16,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:16,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 21:39:16,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831357318] [2024-10-12 21:39:16,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:16,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:39:16,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:16,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:39:16,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:39:16,595 INFO L87 Difference]: Start difference. First operand 880 states and 1664 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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-10-12 21:39:19,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:19,874 INFO L93 Difference]: Finished difference Result 2384 states and 4537 transitions. [2024-10-12 21:39:19,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:39:19,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-10-12 21:39:19,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:19,885 INFO L225 Difference]: With dead ends: 2384 [2024-10-12 21:39:19,886 INFO L226 Difference]: Without dead ends: 1631 [2024-10-12 21:39:19,888 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-10-12 21:39:19,889 INFO L432 NwaCegarLoop]: 643 mSDtfsCounter, 1024 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1024 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 2868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:39:19,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1024 Valid, 650 Invalid, 2868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-12 21:39:19,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2024-10-12 21:39:19,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2024-10-12 21:39:19,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1629 states have (on average 1.6519337016574585) internal successors, (2691), 1630 states have internal predecessors, (2691), 0 states have call successors, (0), 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-10-12 21:39:19,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2691 transitions. [2024-10-12 21:39:19,938 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2691 transitions. Word has length 19 [2024-10-12 21:39:19,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:19,939 INFO L471 AbstractCegarLoop]: Abstraction has 1631 states and 2691 transitions. [2024-10-12 21:39:19,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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-10-12 21:39:19,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2691 transitions. [2024-10-12 21:39:19,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-12 21:39:19,943 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:19,943 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] [2024-10-12 21:39:19,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 21:39:19,943 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:19,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:19,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1038166230, now seen corresponding path program 1 times [2024-10-12 21:39:19,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:19,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544313043] [2024-10-12 21:39:19,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:19,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:20,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:20,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:39:20,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:20,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544313043] [2024-10-12 21:39:20,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544313043] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:20,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:20,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:39:20,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607267397] [2024-10-12 21:39:20,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:20,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:39:20,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:20,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:39:20,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:39:20,175 INFO L87 Difference]: Start difference. First operand 1631 states and 2691 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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-10-12 21:39:20,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:20,291 INFO L93 Difference]: Finished difference Result 1695 states and 2793 transitions. [2024-10-12 21:39:20,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:39:20,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-10-12 21:39:20,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:20,299 INFO L225 Difference]: With dead ends: 1695 [2024-10-12 21:39:20,300 INFO L226 Difference]: Without dead ends: 1631 [2024-10-12 21:39:20,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:39:20,304 INFO L432 NwaCegarLoop]: 1661 mSDtfsCounter, 0 mSDsluCounter, 3257 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4918 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:39:20,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4918 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:39:20,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2024-10-12 21:39:20,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2024-10-12 21:39:20,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1629 states have (on average 1.614487415592388) internal successors, (2630), 1630 states have internal predecessors, (2630), 0 states have call successors, (0), 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-10-12 21:39:20,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2630 transitions. [2024-10-12 21:39:20,345 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2630 transitions. Word has length 27 [2024-10-12 21:39:20,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:20,345 INFO L471 AbstractCegarLoop]: Abstraction has 1631 states and 2630 transitions. [2024-10-12 21:39:20,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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-10-12 21:39:20,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2630 transitions. [2024-10-12 21:39:20,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-12 21:39:20,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:20,352 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, 1, 1, 1, 1] [2024-10-12 21:39:20,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 21:39:20,353 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:20,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:20,353 INFO L85 PathProgramCache]: Analyzing trace with hash 64150534, now seen corresponding path program 1 times [2024-10-12 21:39:20,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:20,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687002241] [2024-10-12 21:39:20,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:20,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:20,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:39:20,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:20,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687002241] [2024-10-12 21:39:20,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687002241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:20,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:20,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 21:39:20,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175478243] [2024-10-12 21:39:20,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:20,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 21:39:20,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:20,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 21:39:20,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-12 21:39:20,767 INFO L87 Difference]: Start difference. First operand 1631 states and 2630 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:21,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:21,443 INFO L93 Difference]: Finished difference Result 2607 states and 4214 transitions. [2024-10-12 21:39:21,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-12 21:39:21,444 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-10-12 21:39:21,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:21,454 INFO L225 Difference]: With dead ends: 2607 [2024-10-12 21:39:21,454 INFO L226 Difference]: Without dead ends: 2546 [2024-10-12 21:39:21,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2024-10-12 21:39:21,459 INFO L432 NwaCegarLoop]: 1594 mSDtfsCounter, 13544 mSDsluCounter, 3889 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13544 SdHoareTripleChecker+Valid, 5483 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:39:21,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13544 Valid, 5483 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 21:39:21,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2024-10-12 21:39:21,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 1690. [2024-10-12 21:39:21,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1690 states, 1688 states have (on average 1.6149289099526067) internal successors, (2726), 1689 states have internal predecessors, (2726), 0 states have call successors, (0), 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-10-12 21:39:21,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 2726 transitions. [2024-10-12 21:39:21,498 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 2726 transitions. Word has length 87 [2024-10-12 21:39:21,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:21,500 INFO L471 AbstractCegarLoop]: Abstraction has 1690 states and 2726 transitions. [2024-10-12 21:39:21,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:21,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 2726 transitions. [2024-10-12 21:39:21,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-12 21:39:21,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:21,505 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, 1, 1, 1, 1, 1, 1] [2024-10-12 21:39:21,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 21:39:21,505 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:21,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:21,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1377992502, now seen corresponding path program 1 times [2024-10-12 21:39:21,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:21,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364731014] [2024-10-12 21:39:21,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:21,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:21,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:39:21,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:21,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364731014] [2024-10-12 21:39:21,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364731014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:21,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:21,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:39:21,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737759022] [2024-10-12 21:39:21,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:21,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:39:21,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:21,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:39:21,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:39:21,639 INFO L87 Difference]: Start difference. First operand 1690 states and 2726 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:21,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:21,686 INFO L93 Difference]: Finished difference Result 1919 states and 3097 transitions. [2024-10-12 21:39:21,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:39:21,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2024-10-12 21:39:21,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:21,695 INFO L225 Difference]: With dead ends: 1919 [2024-10-12 21:39:21,695 INFO L226 Difference]: Without dead ends: 1799 [2024-10-12 21:39:21,696 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-10-12 21:39:21,698 INFO L432 NwaCegarLoop]: 1596 mSDtfsCounter, 1506 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1687 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:39:21,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1687 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:39:21,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2024-10-12 21:39:21,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1795. [2024-10-12 21:39:21,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1793 states have (on average 1.6140546569994423) internal successors, (2894), 1794 states have internal predecessors, (2894), 0 states have call successors, (0), 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-10-12 21:39:21,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2894 transitions. [2024-10-12 21:39:21,736 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2894 transitions. Word has length 89 [2024-10-12 21:39:21,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:21,739 INFO L471 AbstractCegarLoop]: Abstraction has 1795 states and 2894 transitions. [2024-10-12 21:39:21,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:21,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2894 transitions. [2024-10-12 21:39:21,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-12 21:39:21,741 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:21,741 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, 1, 1, 1, 1, 1, 1] [2024-10-12 21:39:21,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 21:39:21,742 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:21,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:21,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1380137454, now seen corresponding path program 1 times [2024-10-12 21:39:21,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:21,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980161693] [2024-10-12 21:39:21,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:21,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:21,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:22,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:39:22,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:22,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980161693] [2024-10-12 21:39:22,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980161693] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:22,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:22,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 21:39:22,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734877856] [2024-10-12 21:39:22,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:22,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 21:39:22,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:22,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 21:39:22,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-12 21:39:22,336 INFO L87 Difference]: Start difference. First operand 1795 states and 2894 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:22,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:22,810 INFO L93 Difference]: Finished difference Result 2022 states and 3258 transitions. [2024-10-12 21:39:22,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:39:22,811 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2024-10-12 21:39:22,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:22,817 INFO L225 Difference]: With dead ends: 2022 [2024-10-12 21:39:22,818 INFO L226 Difference]: Without dead ends: 1797 [2024-10-12 21:39:22,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:39:22,819 INFO L432 NwaCegarLoop]: 1590 mSDtfsCounter, 6112 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6112 SdHoareTripleChecker+Valid, 2264 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:39:22,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6112 Valid, 2264 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:39:22,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1797 states. [2024-10-12 21:39:22,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1797 to 1795. [2024-10-12 21:39:22,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1793 states have (on average 1.6129392080312326) internal successors, (2892), 1794 states have internal predecessors, (2892), 0 states have call successors, (0), 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-10-12 21:39:22,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2892 transitions. [2024-10-12 21:39:22,850 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2892 transitions. Word has length 89 [2024-10-12 21:39:22,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:22,851 INFO L471 AbstractCegarLoop]: Abstraction has 1795 states and 2892 transitions. [2024-10-12 21:39:22,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:22,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2892 transitions. [2024-10-12 21:39:22,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-12 21:39:22,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:22,852 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:39:22,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 21:39:22,853 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:22,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:22,853 INFO L85 PathProgramCache]: Analyzing trace with hash -294342910, now seen corresponding path program 1 times [2024-10-12 21:39:22,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:22,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279710643] [2024-10-12 21:39:22,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:22,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:23,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:39:23,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:23,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279710643] [2024-10-12 21:39:23,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279710643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:23,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:23,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:39:23,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592013888] [2024-10-12 21:39:23,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:23,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:39:23,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:23,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:39:23,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:39:23,068 INFO L87 Difference]: Start difference. First operand 1795 states and 2892 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:23,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:23,112 INFO L93 Difference]: Finished difference Result 1801 states and 2899 transitions. [2024-10-12 21:39:23,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:39:23,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2024-10-12 21:39:23,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:23,119 INFO L225 Difference]: With dead ends: 1801 [2024-10-12 21:39:23,120 INFO L226 Difference]: Without dead ends: 1799 [2024-10-12 21:39:23,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:39:23,121 INFO L432 NwaCegarLoop]: 1599 mSDtfsCounter, 0 mSDsluCounter, 3190 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4789 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:39:23,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4789 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:39:23,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2024-10-12 21:39:23,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1799. [2024-10-12 21:39:23,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1797 states have (on average 1.6110183639398998) internal successors, (2895), 1798 states have internal predecessors, (2895), 0 states have call successors, (0), 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-10-12 21:39:23,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2895 transitions. [2024-10-12 21:39:23,154 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2895 transitions. Word has length 90 [2024-10-12 21:39:23,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:23,154 INFO L471 AbstractCegarLoop]: Abstraction has 1799 states and 2895 transitions. [2024-10-12 21:39:23,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:23,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2895 transitions. [2024-10-12 21:39:23,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-12 21:39:23,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:23,156 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:39:23,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 21:39:23,156 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:23,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:23,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1795733988, now seen corresponding path program 1 times [2024-10-12 21:39:23,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:23,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94339795] [2024-10-12 21:39:23,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:23,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:23,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:23,257 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-12 21:39:23,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:23,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94339795] [2024-10-12 21:39:23,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94339795] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:23,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:23,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 21:39:23,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140835506] [2024-10-12 21:39:23,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:23,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:39:23,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:23,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:39:23,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:39:23,260 INFO L87 Difference]: Start difference. First operand 1799 states and 2895 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:26,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:26,580 INFO L93 Difference]: Finished difference Result 4805 states and 7822 transitions. [2024-10-12 21:39:26,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:39:26,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2024-10-12 21:39:26,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:26,593 INFO L225 Difference]: With dead ends: 4805 [2024-10-12 21:39:26,593 INFO L226 Difference]: Without dead ends: 3301 [2024-10-12 21:39:26,597 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-10-12 21:39:26,598 INFO L432 NwaCegarLoop]: 629 mSDtfsCounter, 890 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2264 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:39:26,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [890 Valid, 636 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2264 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-12 21:39:26,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3301 states. [2024-10-12 21:39:26,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3301 to 3301. [2024-10-12 21:39:26,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3301 states, 3299 states have (on average 1.4292209760533494) internal successors, (4715), 3300 states have internal predecessors, (4715), 0 states have call successors, (0), 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-10-12 21:39:26,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3301 states to 3301 states and 4715 transitions. [2024-10-12 21:39:26,664 INFO L78 Accepts]: Start accepts. Automaton has 3301 states and 4715 transitions. Word has length 90 [2024-10-12 21:39:26,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:26,664 INFO L471 AbstractCegarLoop]: Abstraction has 3301 states and 4715 transitions. [2024-10-12 21:39:26,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:26,664 INFO L276 IsEmpty]: Start isEmpty. Operand 3301 states and 4715 transitions. [2024-10-12 21:39:26,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-12 21:39:26,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:26,666 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:39:26,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 21:39:26,666 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:26,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:26,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1953030514, now seen corresponding path program 1 times [2024-10-12 21:39:26,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:26,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10931375] [2024-10-12 21:39:26,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:26,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:26,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:39:26,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:26,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10931375] [2024-10-12 21:39:26,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10931375] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:26,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:26,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:39:26,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141894908] [2024-10-12 21:39:26,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:26,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:39:26,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:26,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:39:26,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:39:26,796 INFO L87 Difference]: Start difference. First operand 3301 states and 4715 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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-10-12 21:39:26,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:26,836 INFO L93 Difference]: Finished difference Result 3743 states and 5415 transitions. [2024-10-12 21:39:26,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:39:26,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-12 21:39:26,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:26,847 INFO L225 Difference]: With dead ends: 3743 [2024-10-12 21:39:26,848 INFO L226 Difference]: Without dead ends: 3514 [2024-10-12 21:39:26,849 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-10-12 21:39:26,851 INFO L432 NwaCegarLoop]: 1675 mSDtfsCounter, 1525 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1525 SdHoareTripleChecker+Valid, 1778 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-10-12 21:39:26,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1525 Valid, 1778 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:39:26,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3514 states. [2024-10-12 21:39:26,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3514 to 3512. [2024-10-12 21:39:26,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3512 states, 3510 states have (on average 1.4376068376068376) internal successors, (5046), 3511 states have internal predecessors, (5046), 0 states have call successors, (0), 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-10-12 21:39:26,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3512 states to 3512 states and 5046 transitions. [2024-10-12 21:39:26,923 INFO L78 Accepts]: Start accepts. Automaton has 3512 states and 5046 transitions. Word has length 91 [2024-10-12 21:39:26,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:26,924 INFO L471 AbstractCegarLoop]: Abstraction has 3512 states and 5046 transitions. [2024-10-12 21:39:26,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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-10-12 21:39:26,924 INFO L276 IsEmpty]: Start isEmpty. Operand 3512 states and 5046 transitions. [2024-10-12 21:39:26,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-12 21:39:26,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:26,925 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:39:26,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 21:39:26,925 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:26,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:26,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1197646450, now seen corresponding path program 1 times [2024-10-12 21:39:26,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:26,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784155528] [2024-10-12 21:39:26,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:26,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:26,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:27,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:39:27,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:27,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784155528] [2024-10-12 21:39:27,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784155528] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:27,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:27,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:39:27,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767956795] [2024-10-12 21:39:27,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:27,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:39:27,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:27,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:39:27,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:39:27,021 INFO L87 Difference]: Start difference. First operand 3512 states and 5046 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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-10-12 21:39:27,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:27,078 INFO L93 Difference]: Finished difference Result 4360 states and 6380 transitions. [2024-10-12 21:39:27,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:39:27,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-12 21:39:27,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:27,091 INFO L225 Difference]: With dead ends: 4360 [2024-10-12 21:39:27,092 INFO L226 Difference]: Without dead ends: 3920 [2024-10-12 21:39:27,094 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-10-12 21:39:27,095 INFO L432 NwaCegarLoop]: 1673 mSDtfsCounter, 1523 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 1780 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-10-12 21:39:27,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 1780 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:39:27,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2024-10-12 21:39:27,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3918. [2024-10-12 21:39:27,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3918 states, 3916 states have (on average 1.449438202247191) internal successors, (5676), 3917 states have internal predecessors, (5676), 0 states have call successors, (0), 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-10-12 21:39:27,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3918 states to 3918 states and 5676 transitions. [2024-10-12 21:39:27,176 INFO L78 Accepts]: Start accepts. Automaton has 3918 states and 5676 transitions. Word has length 91 [2024-10-12 21:39:27,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:27,176 INFO L471 AbstractCegarLoop]: Abstraction has 3918 states and 5676 transitions. [2024-10-12 21:39:27,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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-10-12 21:39:27,177 INFO L276 IsEmpty]: Start isEmpty. Operand 3918 states and 5676 transitions. [2024-10-12 21:39:27,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-12 21:39:27,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:27,179 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:39:27,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 21:39:27,179 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:27,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:27,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1876616306, now seen corresponding path program 1 times [2024-10-12 21:39:27,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:27,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339043111] [2024-10-12 21:39:27,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:27,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:27,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:27,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:39:27,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:27,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339043111] [2024-10-12 21:39:27,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339043111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:27,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:27,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:39:27,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000471610] [2024-10-12 21:39:27,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:27,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:39:27,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:27,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:39:27,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:39:27,268 INFO L87 Difference]: Start difference. First operand 3918 states and 5676 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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-10-12 21:39:27,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:27,323 INFO L93 Difference]: Finished difference Result 5546 states and 8214 transitions. [2024-10-12 21:39:27,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:39:27,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-12 21:39:27,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:27,352 INFO L225 Difference]: With dead ends: 5546 [2024-10-12 21:39:27,353 INFO L226 Difference]: Without dead ends: 4700 [2024-10-12 21:39:27,357 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-10-12 21:39:27,357 INFO L432 NwaCegarLoop]: 1661 mSDtfsCounter, 1519 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 1776 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-10-12 21:39:27,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1519 Valid, 1776 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:39:27,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4700 states. [2024-10-12 21:39:27,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4700 to 4698. [2024-10-12 21:39:27,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4698 states, 4696 states have (on average 1.463373083475298) internal successors, (6872), 4697 states have internal predecessors, (6872), 0 states have call successors, (0), 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-10-12 21:39:27,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4698 states to 4698 states and 6872 transitions. [2024-10-12 21:39:27,510 INFO L78 Accepts]: Start accepts. Automaton has 4698 states and 6872 transitions. Word has length 91 [2024-10-12 21:39:27,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:27,510 INFO L471 AbstractCegarLoop]: Abstraction has 4698 states and 6872 transitions. [2024-10-12 21:39:27,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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-10-12 21:39:27,511 INFO L276 IsEmpty]: Start isEmpty. Operand 4698 states and 6872 transitions. [2024-10-12 21:39:27,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-12 21:39:27,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:27,512 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:39:27,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 21:39:27,512 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:27,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:27,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1836672370, now seen corresponding path program 1 times [2024-10-12 21:39:27,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:27,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107297058] [2024-10-12 21:39:27,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:27,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:27,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:39:27,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:27,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107297058] [2024-10-12 21:39:27,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107297058] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:27,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:27,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:39:27,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363788024] [2024-10-12 21:39:27,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:27,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:39:27,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:27,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:39:27,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:39:27,598 INFO L87 Difference]: Start difference. First operand 4698 states and 6872 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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-10-12 21:39:27,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:27,679 INFO L93 Difference]: Finished difference Result 7822 states and 11690 transitions. [2024-10-12 21:39:27,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:39:27,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-12 21:39:27,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:27,691 INFO L225 Difference]: With dead ends: 7822 [2024-10-12 21:39:27,692 INFO L226 Difference]: Without dead ends: 6196 [2024-10-12 21:39:27,696 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-10-12 21:39:27,696 INFO L432 NwaCegarLoop]: 1659 mSDtfsCounter, 1517 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 1778 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-10-12 21:39:27,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1517 Valid, 1778 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:39:27,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6196 states. [2024-10-12 21:39:27,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6196 to 6194. [2024-10-12 21:39:27,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6194 states, 6192 states have (on average 1.475452196382429) internal successors, (9136), 6193 states have internal predecessors, (9136), 0 states have call successors, (0), 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-10-12 21:39:27,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6194 states to 6194 states and 9136 transitions. [2024-10-12 21:39:27,837 INFO L78 Accepts]: Start accepts. Automaton has 6194 states and 9136 transitions. Word has length 91 [2024-10-12 21:39:27,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:27,837 INFO L471 AbstractCegarLoop]: Abstraction has 6194 states and 9136 transitions. [2024-10-12 21:39:27,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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-10-12 21:39:27,838 INFO L276 IsEmpty]: Start isEmpty. Operand 6194 states and 9136 transitions. [2024-10-12 21:39:27,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-12 21:39:27,839 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:27,839 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:39:27,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 21:39:27,839 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:27,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:27,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1573594994, now seen corresponding path program 1 times [2024-10-12 21:39:27,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:27,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089521684] [2024-10-12 21:39:27,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:27,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:27,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:27,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:39:27,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:27,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089521684] [2024-10-12 21:39:27,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089521684] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:27,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:27,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:39:27,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028776325] [2024-10-12 21:39:27,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:27,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:39:27,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:27,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:39:27,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:39:27,932 INFO L87 Difference]: Start difference. First operand 6194 states and 9136 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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-10-12 21:39:28,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:28,064 INFO L93 Difference]: Finished difference Result 12182 states and 18258 transitions. [2024-10-12 21:39:28,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:39:28,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-12 21:39:28,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:28,082 INFO L225 Difference]: With dead ends: 12182 [2024-10-12 21:39:28,083 INFO L226 Difference]: Without dead ends: 9060 [2024-10-12 21:39:28,089 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-10-12 21:39:28,090 INFO L432 NwaCegarLoop]: 1647 mSDtfsCounter, 1513 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1513 SdHoareTripleChecker+Valid, 1774 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-10-12 21:39:28,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1513 Valid, 1774 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:39:28,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9060 states. [2024-10-12 21:39:28,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9060 to 9058. [2024-10-12 21:39:28,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9058 states, 9056 states have (on average 1.480565371024735) internal successors, (13408), 9057 states have internal predecessors, (13408), 0 states have call successors, (0), 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-10-12 21:39:28,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9058 states to 9058 states and 13408 transitions. [2024-10-12 21:39:28,306 INFO L78 Accepts]: Start accepts. Automaton has 9058 states and 13408 transitions. Word has length 91 [2024-10-12 21:39:28,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:28,307 INFO L471 AbstractCegarLoop]: Abstraction has 9058 states and 13408 transitions. [2024-10-12 21:39:28,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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-10-12 21:39:28,307 INFO L276 IsEmpty]: Start isEmpty. Operand 9058 states and 13408 transitions. [2024-10-12 21:39:28,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-12 21:39:28,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:28,309 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:39:28,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 21:39:28,309 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:28,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:28,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1832638862, now seen corresponding path program 1 times [2024-10-12 21:39:28,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:28,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048626886] [2024-10-12 21:39:28,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:28,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:28,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:39:28,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:28,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048626886] [2024-10-12 21:39:28,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048626886] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:28,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:28,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:39:28,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271108921] [2024-10-12 21:39:28,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:28,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:39:28,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:28,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:39:28,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:39:28,442 INFO L87 Difference]: Start difference. First operand 9058 states and 13408 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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-10-12 21:39:28,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:28,754 INFO L93 Difference]: Finished difference Result 20518 states and 30626 transitions. [2024-10-12 21:39:28,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:39:28,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-12 21:39:28,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:28,785 INFO L225 Difference]: With dead ends: 20518 [2024-10-12 21:39:28,786 INFO L226 Difference]: Without dead ends: 14532 [2024-10-12 21:39:28,797 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-10-12 21:39:28,798 INFO L432 NwaCegarLoop]: 1657 mSDtfsCounter, 1515 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 1780 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-10-12 21:39:28,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1515 Valid, 1780 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:39:28,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14532 states. [2024-10-12 21:39:29,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14532 to 14530. [2024-10-12 21:39:29,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14530 states, 14528 states have (on average 1.475770925110132) internal successors, (21440), 14529 states have internal predecessors, (21440), 0 states have call successors, (0), 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-10-12 21:39:29,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14530 states to 14530 states and 21440 transitions. [2024-10-12 21:39:29,220 INFO L78 Accepts]: Start accepts. Automaton has 14530 states and 21440 transitions. Word has length 91 [2024-10-12 21:39:29,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:29,220 INFO L471 AbstractCegarLoop]: Abstraction has 14530 states and 21440 transitions. [2024-10-12 21:39:29,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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-10-12 21:39:29,221 INFO L276 IsEmpty]: Start isEmpty. Operand 14530 states and 21440 transitions. [2024-10-12 21:39:29,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-12 21:39:29,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:29,222 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:39:29,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 21:39:29,222 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:29,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:29,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1608033138, now seen corresponding path program 1 times [2024-10-12 21:39:29,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:29,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776255470] [2024-10-12 21:39:29,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:29,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:29,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:29,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:39:29,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:29,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776255470] [2024-10-12 21:39:29,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776255470] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:29,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:29,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:39:29,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878227924] [2024-10-12 21:39:29,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:29,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:39:29,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:29,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:39:29,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:39:29,319 INFO L87 Difference]: Start difference. First operand 14530 states and 21440 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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-10-12 21:39:29,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:29,698 INFO L93 Difference]: Finished difference Result 36422 states and 53826 transitions. [2024-10-12 21:39:29,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:39:29,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-12 21:39:29,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:29,838 INFO L225 Difference]: With dead ends: 36422 [2024-10-12 21:39:29,839 INFO L226 Difference]: Without dead ends: 24964 [2024-10-12 21:39:29,854 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-10-12 21:39:29,855 INFO L432 NwaCegarLoop]: 1671 mSDtfsCounter, 1521 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 1782 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-10-12 21:39:29,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1521 Valid, 1782 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:39:29,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24964 states. [2024-10-12 21:39:30,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24964 to 24962. [2024-10-12 21:39:30,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24962 states, 24960 states have (on average 1.4615384615384615) internal successors, (36480), 24961 states have internal predecessors, (36480), 0 states have call successors, (0), 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-10-12 21:39:30,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24962 states to 24962 states and 36480 transitions. [2024-10-12 21:39:30,517 INFO L78 Accepts]: Start accepts. Automaton has 24962 states and 36480 transitions. Word has length 91 [2024-10-12 21:39:30,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:30,517 INFO L471 AbstractCegarLoop]: Abstraction has 24962 states and 36480 transitions. [2024-10-12 21:39:30,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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-10-12 21:39:30,518 INFO L276 IsEmpty]: Start isEmpty. Operand 24962 states and 36480 transitions. [2024-10-12 21:39:30,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-12 21:39:30,519 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:30,519 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:39:30,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 21:39:30,519 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:30,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:30,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1270174003, now seen corresponding path program 1 times [2024-10-12 21:39:30,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:30,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008023373] [2024-10-12 21:39:30,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:30,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:30,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:39:30,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:30,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008023373] [2024-10-12 21:39:30,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008023373] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:30,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:30,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 21:39:30,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171291995] [2024-10-12 21:39:30,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:30,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:39:30,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:30,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:39:30,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:39:30,615 INFO L87 Difference]: Start difference. First operand 24962 states and 36480 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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-10-12 21:39:31,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:31,244 INFO L93 Difference]: Finished difference Result 47497 states and 70022 transitions. [2024-10-12 21:39:31,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:39:31,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-10-12 21:39:31,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:31,316 INFO L225 Difference]: With dead ends: 47497 [2024-10-12 21:39:31,316 INFO L226 Difference]: Without dead ends: 35462 [2024-10-12 21:39:31,342 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-10-12 21:39:31,342 INFO L432 NwaCegarLoop]: 1680 mSDtfsCounter, 1524 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 1779 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-10-12 21:39:31,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1524 Valid, 1779 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 21:39:31,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35462 states. [2024-10-12 21:39:32,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35462 to 35460. [2024-10-12 21:39:32,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35460 states, 35458 states have (on average 1.4584578938462407) internal successors, (51714), 35459 states have internal predecessors, (51714), 0 states have call successors, (0), 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-10-12 21:39:32,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35460 states to 35460 states and 51714 transitions. [2024-10-12 21:39:32,431 INFO L78 Accepts]: Start accepts. Automaton has 35460 states and 51714 transitions. Word has length 93 [2024-10-12 21:39:32,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:32,431 INFO L471 AbstractCegarLoop]: Abstraction has 35460 states and 51714 transitions. [2024-10-12 21:39:32,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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-10-12 21:39:32,432 INFO L276 IsEmpty]: Start isEmpty. Operand 35460 states and 51714 transitions. [2024-10-12 21:39:32,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 21:39:32,433 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:32,433 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:39:32,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 21:39:32,433 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:32,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:32,434 INFO L85 PathProgramCache]: Analyzing trace with hash 2076472174, now seen corresponding path program 1 times [2024-10-12 21:39:32,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:32,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848958802] [2024-10-12 21:39:32,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:32,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:32,539 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:39:32,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:32,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848958802] [2024-10-12 21:39:32,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848958802] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:32,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:32,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 21:39:32,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160678331] [2024-10-12 21:39:32,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:32,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:39:32,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:32,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:39:32,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:39:32,542 INFO L87 Difference]: Start difference. First operand 35460 states and 51714 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:36,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:36,033 INFO L93 Difference]: Finished difference Result 41470 states and 60281 transitions. [2024-10-12 21:39:36,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:39:36,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-12 21:39:36,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:36,122 INFO L225 Difference]: With dead ends: 41470 [2024-10-12 21:39:36,122 INFO L226 Difference]: Without dead ends: 38464 [2024-10-12 21:39:36,140 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-10-12 21:39:36,141 INFO L432 NwaCegarLoop]: 603 mSDtfsCounter, 938 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1998 mSolverCounterSat, 935 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 938 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 2933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 935 IncrementalHoareTripleChecker+Valid, 1998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:39:36,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [938 Valid, 609 Invalid, 2933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [935 Valid, 1998 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-12 21:39:36,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38464 states. [2024-10-12 21:39:37,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38464 to 38464. [2024-10-12 21:39:37,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38464 states, 38462 states have (on average 1.4354687743747074) internal successors, (55211), 38463 states have internal predecessors, (55211), 0 states have call successors, (0), 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-10-12 21:39:37,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38464 states to 38464 states and 55211 transitions. [2024-10-12 21:39:37,262 INFO L78 Accepts]: Start accepts. Automaton has 38464 states and 55211 transitions. Word has length 94 [2024-10-12 21:39:37,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:37,263 INFO L471 AbstractCegarLoop]: Abstraction has 38464 states and 55211 transitions. [2024-10-12 21:39:37,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 21:39:37,263 INFO L276 IsEmpty]: Start isEmpty. Operand 38464 states and 55211 transitions. [2024-10-12 21:39:37,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-12 21:39:37,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:37,264 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:39:37,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 21:39:37,264 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:37,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:37,265 INFO L85 PathProgramCache]: Analyzing trace with hash -136290371, now seen corresponding path program 1 times [2024-10-12 21:39:37,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:37,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116115672] [2024-10-12 21:39:37,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:37,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:37,370 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:39:37,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:37,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116115672] [2024-10-12 21:39:37,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116115672] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:37,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:37,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 21:39:37,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557989186] [2024-10-12 21:39:37,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:37,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:39:37,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:37,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:39:37,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 21:39:37,373 INFO L87 Difference]: Start difference. First operand 38464 states and 55211 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 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-10-12 21:39:40,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:40,874 INFO L93 Difference]: Finished difference Result 50484 states and 70773 transitions. [2024-10-12 21:39:40,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:39:40,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-10-12 21:39:40,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:40,955 INFO L225 Difference]: With dead ends: 50484 [2024-10-12 21:39:40,955 INFO L226 Difference]: Without dead ends: 44474 [2024-10-12 21:39:40,969 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-10-12 21:39:40,970 INFO L432 NwaCegarLoop]: 506 mSDtfsCounter, 1074 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2312 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1074 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 2862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-12 21:39:40,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1074 Valid, 513 Invalid, 2862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2312 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-12 21:39:41,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44474 states. [2024-10-12 21:39:41,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44474 to 43721. [2024-10-12 21:39:41,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43721 states, 43719 states have (on average 1.4012671836043826) internal successors, (61262), 43720 states have internal predecessors, (61262), 0 states have call successors, (0), 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-10-12 21:39:42,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43721 states to 43721 states and 61262 transitions. [2024-10-12 21:39:42,083 INFO L78 Accepts]: Start accepts. Automaton has 43721 states and 61262 transitions. Word has length 100 [2024-10-12 21:39:42,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:42,084 INFO L471 AbstractCegarLoop]: Abstraction has 43721 states and 61262 transitions. [2024-10-12 21:39:42,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 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-10-12 21:39:42,084 INFO L276 IsEmpty]: Start isEmpty. Operand 43721 states and 61262 transitions. [2024-10-12 21:39:42,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-12 21:39:42,091 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:42,092 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:39:42,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 21:39:42,092 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:42,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:42,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1909067792, now seen corresponding path program 1 times [2024-10-12 21:39:42,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:42,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565132582] [2024-10-12 21:39:42,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:42,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:42,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:42,501 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 21:39:42,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:42,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565132582] [2024-10-12 21:39:42,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565132582] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:42,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:42,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 21:39:42,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981127228] [2024-10-12 21:39:42,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:42,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 21:39:42,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:42,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 21:39:42,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-12 21:39:42,506 INFO L87 Difference]: Start difference. First operand 43721 states and 61262 transitions. Second operand has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 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-10-12 21:39:46,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:46,829 INFO L93 Difference]: Finished difference Result 309211 states and 449239 transitions. [2024-10-12 21:39:46,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:39:46,830 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 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 115 [2024-10-12 21:39:46,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:47,852 INFO L225 Difference]: With dead ends: 309211 [2024-10-12 21:39:47,852 INFO L226 Difference]: Without dead ends: 276825 [2024-10-12 21:39:47,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:39:47,928 INFO L432 NwaCegarLoop]: 1698 mSDtfsCounter, 11808 mSDsluCounter, 3264 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11808 SdHoareTripleChecker+Valid, 4962 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:39:47,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11808 Valid, 4962 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 21:39:48,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276825 states. [2024-10-12 21:39:51,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276825 to 76105. [2024-10-12 21:39:51,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76105 states, 76103 states have (on average 1.422256678448944) internal successors, (108238), 76104 states have internal predecessors, (108238), 0 states have call successors, (0), 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-10-12 21:39:51,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76105 states to 76105 states and 108238 transitions. [2024-10-12 21:39:51,665 INFO L78 Accepts]: Start accepts. Automaton has 76105 states and 108238 transitions. Word has length 115 [2024-10-12 21:39:51,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:39:51,665 INFO L471 AbstractCegarLoop]: Abstraction has 76105 states and 108238 transitions. [2024-10-12 21:39:51,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 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-10-12 21:39:51,666 INFO L276 IsEmpty]: Start isEmpty. Operand 76105 states and 108238 transitions. [2024-10-12 21:39:51,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-12 21:39:51,673 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:39:51,673 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:39:51,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 21:39:51,674 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:39:51,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:39:51,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1630515440, now seen corresponding path program 1 times [2024-10-12 21:39:51,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:39:51,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004003281] [2024-10-12 21:39:51,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:39:51,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:39:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:39:51,994 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 21:39:51,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:39:51,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004003281] [2024-10-12 21:39:51,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004003281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:39:51,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:39:51,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 21:39:51,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77146567] [2024-10-12 21:39:51,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:39:51,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 21:39:51,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:39:51,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 21:39:51,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-12 21:39:51,998 INFO L87 Difference]: Start difference. First operand 76105 states and 108238 transitions. Second operand has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 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-10-12 21:39:57,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:39:57,838 INFO L93 Difference]: Finished difference Result 341595 states and 496215 transitions. [2024-10-12 21:39:57,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:39:57,839 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 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 115 [2024-10-12 21:39:57,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:39:58,400 INFO L225 Difference]: With dead ends: 341595 [2024-10-12 21:39:58,400 INFO L226 Difference]: Without dead ends: 309209 [2024-10-12 21:39:58,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:39:58,490 INFO L432 NwaCegarLoop]: 1695 mSDtfsCounter, 11856 mSDsluCounter, 3074 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11856 SdHoareTripleChecker+Valid, 4769 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:39:58,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11856 Valid, 4769 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 21:39:58,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309209 states. [2024-10-12 21:40:03,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309209 to 124745. [2024-10-12 21:40:03,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124745 states, 124743 states have (on average 1.4299960719238756) internal successors, (178382), 124744 states have internal predecessors, (178382), 0 states have call successors, (0), 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-10-12 21:40:03,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124745 states to 124745 states and 178382 transitions. [2024-10-12 21:40:03,571 INFO L78 Accepts]: Start accepts. Automaton has 124745 states and 178382 transitions. Word has length 115 [2024-10-12 21:40:03,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:40:03,572 INFO L471 AbstractCegarLoop]: Abstraction has 124745 states and 178382 transitions. [2024-10-12 21:40:03,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 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-10-12 21:40:03,572 INFO L276 IsEmpty]: Start isEmpty. Operand 124745 states and 178382 transitions. [2024-10-12 21:40:03,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-12 21:40:03,579 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:40:03,580 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:40:03,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 21:40:03,580 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:40:03,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:40:03,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1985482000, now seen corresponding path program 1 times [2024-10-12 21:40:03,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:40:03,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884980321] [2024-10-12 21:40:03,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:40:03,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:40:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:40:03,847 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 21:40:03,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:40:03,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884980321] [2024-10-12 21:40:03,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884980321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:40:03,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:40:03,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 21:40:03,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117442179] [2024-10-12 21:40:03,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:40:03,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 21:40:03,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:40:03,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 21:40:03,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-12 21:40:03,850 INFO L87 Difference]: Start difference. First operand 124745 states and 178382 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 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-10-12 21:40:11,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:40:11,187 INFO L93 Difference]: Finished difference Result 373979 states and 543191 transitions. [2024-10-12 21:40:11,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:40:11,188 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 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 115 [2024-10-12 21:40:11,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:40:11,736 INFO L225 Difference]: With dead ends: 373979 [2024-10-12 21:40:11,737 INFO L226 Difference]: Without dead ends: 341593 [2024-10-12 21:40:11,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:40:11,835 INFO L432 NwaCegarLoop]: 1692 mSDtfsCounter, 11923 mSDsluCounter, 3105 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11923 SdHoareTripleChecker+Valid, 4797 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:40:11,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11923 Valid, 4797 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 21:40:12,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341593 states. [2024-10-12 21:40:17,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341593 to 157129. [2024-10-12 21:40:17,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157129 states, 157127 states have (on average 1.4342410916010615) internal successors, (225358), 157128 states have internal predecessors, (225358), 0 states have call successors, (0), 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-10-12 21:40:18,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157129 states to 157129 states and 225358 transitions.