/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 23:42:38,224 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 23:42:38,272 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 23:42:38,275 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 23:42:38,275 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 23:42:38,291 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 23:42:38,292 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 23:42:38,292 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 23:42:38,293 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 23:42:38,296 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 23:42:38,296 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 23:42:38,296 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 23:42:38,296 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 23:42:38,297 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 23:42:38,297 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 23:42:38,298 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 23:42:38,298 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 23:42:38,298 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 23:42:38,298 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 23:42:38,298 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 23:42:38,298 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 23:42:38,299 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 23:42:38,299 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 23:42:38,299 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 23:42:38,299 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 23:42:38,299 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 23:42:38,299 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 23:42:38,300 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 23:42:38,300 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 23:42:38,300 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 23:42:38,301 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 23:42:38,301 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 23:42:38,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 23:42:38,301 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 23:42:38,302 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 23:42:38,302 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 23:42:38,302 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 23:42:38,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 23:42:38,302 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 23:42:38,302 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 23:42:38,302 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 23:42:38,303 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 23:42:38,303 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 23:42:38,303 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: Use bitabs translation -> true [2023-12-15 23:42:38,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 23:42:38,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 23:42:38,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 23:42:38,536 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 23:42:38,536 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 23:42:38,537 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2023-12-15 23:42:39,709 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 23:42:39,917 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 23:42:39,917 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2023-12-15 23:42:39,934 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00ae1c791/a2ac43dffd014e2f8dddb23642a8e2c1/FLAG2448520b9 [2023-12-15 23:42:39,947 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00ae1c791/a2ac43dffd014e2f8dddb23642a8e2c1 [2023-12-15 23:42:39,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 23:42:39,950 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 23:42:39,950 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 23:42:39,951 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 23:42:39,960 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 23:42:39,960 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:42:39" (1/1) ... [2023-12-15 23:42:39,961 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59d800a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:42:39, skipping insertion in model container [2023-12-15 23:42:39,961 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:42:39" (1/1) ... [2023-12-15 23:42:40,007 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 23:42:40,234 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[15593,15606] [2023-12-15 23:42:40,253 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16240,16253] [2023-12-15 23:42:40,269 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17624,17637] [2023-12-15 23:42:40,277 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18600,18613] [2023-12-15 23:42:40,345 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[27965,27978] [2023-12-15 23:42:40,403 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 23:42:40,425 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 23:42:40,508 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[15593,15606] [2023-12-15 23:42:40,515 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16240,16253] [2023-12-15 23:42:40,527 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17624,17637] [2023-12-15 23:42:40,533 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18600,18613] [2023-12-15 23:42:40,567 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[27965,27978] [2023-12-15 23:42:40,604 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 23:42:40,622 INFO L206 MainTranslator]: Completed translation [2023-12-15 23:42:40,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:42:40 WrapperNode [2023-12-15 23:42:40,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 23:42:40,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 23:42:40,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 23:42:40,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 23:42:40,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:42:40" (1/1) ... [2023-12-15 23:42:40,676 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:42:40" (1/1) ... [2023-12-15 23:42:40,736 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1783 [2023-12-15 23:42:40,736 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 23:42:40,737 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 23:42:40,737 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 23:42:40,737 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 23:42:40,744 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:42:40" (1/1) ... [2023-12-15 23:42:40,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:42:40" (1/1) ... [2023-12-15 23:42:40,751 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:42:40" (1/1) ... [2023-12-15 23:42:40,785 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]. [2023-12-15 23:42:40,785 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:42:40" (1/1) ... [2023-12-15 23:42:40,785 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:42:40" (1/1) ... [2023-12-15 23:42:40,812 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:42:40" (1/1) ... [2023-12-15 23:42:40,827 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:42:40" (1/1) ... [2023-12-15 23:42:40,834 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:42:40" (1/1) ... [2023-12-15 23:42:40,845 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:42:40" (1/1) ... [2023-12-15 23:42:40,852 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 23:42:40,853 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 23:42:40,853 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 23:42:40,853 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 23:42:40,854 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:42:40" (1/1) ... [2023-12-15 23:42:40,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 23:42:40,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:42:40,879 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) [2023-12-15 23:42:40,913 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 [2023-12-15 23:42:40,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 23:42:40,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 23:42:40,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 23:42:40,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 23:42:41,060 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 23:42:41,061 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 23:42:41,885 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 23:42:41,926 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 23:42:41,926 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-15 23:42:41,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:42:41 BoogieIcfgContainer [2023-12-15 23:42:41,927 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 23:42:41,928 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 23:42:41,929 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 23:42:41,931 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 23:42:41,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 11:42:39" (1/3) ... [2023-12-15 23:42:41,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b7909f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:42:41, skipping insertion in model container [2023-12-15 23:42:41,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:42:40" (2/3) ... [2023-12-15 23:42:41,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b7909f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:42:41, skipping insertion in model container [2023-12-15 23:42:41,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:42:41" (3/3) ... [2023-12-15 23:42:41,934 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2023-12-15 23:42:41,947 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 23:42:41,947 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2023-12-15 23:42:41,997 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 23:42:42,003 INFO L357 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, mHoare=true, 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;@24d7dbe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 23:42:42,004 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-15 23:42:42,012 INFO L276 IsEmpty]: Start isEmpty. Operand has 422 states, 416 states have (on average 1.8076923076923077) internal successors, (752), 421 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:42,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-15 23:42:42,026 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:42:42,027 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:42:42,027 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-15 23:42:42,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:42:42,031 INFO L85 PathProgramCache]: Analyzing trace with hash 54352472, now seen corresponding path program 1 times [2023-12-15 23:42:42,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:42:42,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477172230] [2023-12-15 23:42:42,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:42:42,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:42:42,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:42:42,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:42:42,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:42:42,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477172230] [2023-12-15 23:42:42,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477172230] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:42:42,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:42:42,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 23:42:42,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129855023] [2023-12-15 23:42:42,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:42:42,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 23:42:42,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:42:42,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 23:42:42,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 23:42:42,479 INFO L87 Difference]: Start difference. First operand has 422 states, 416 states have (on average 1.8076923076923077) internal successors, (752), 421 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:42,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:42:42,571 INFO L93 Difference]: Finished difference Result 774 states and 1362 transitions. [2023-12-15 23:42:42,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 23:42:42,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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 149 [2023-12-15 23:42:42,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:42:42,594 INFO L225 Difference]: With dead ends: 774 [2023-12-15 23:42:42,594 INFO L226 Difference]: Without dead ends: 611 [2023-12-15 23:42:42,597 INFO L412 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 [2023-12-15 23:42:42,599 INFO L413 NwaCegarLoop]: 870 mSDtfsCounter, 445 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 23:42:42,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 1357 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 23:42:42,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2023-12-15 23:42:42,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 609. [2023-12-15 23:42:42,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 604 states have (on average 1.4801324503311257) internal successors, (894), 608 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:42,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 894 transitions. [2023-12-15 23:42:42,650 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 894 transitions. Word has length 149 [2023-12-15 23:42:42,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:42:42,651 INFO L495 AbstractCegarLoop]: Abstraction has 609 states and 894 transitions. [2023-12-15 23:42:42,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:42,651 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 894 transitions. [2023-12-15 23:42:42,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-15 23:42:42,654 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:42:42,654 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:42:42,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 23:42:42,655 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-15 23:42:42,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:42:42,655 INFO L85 PathProgramCache]: Analyzing trace with hash -343663272, now seen corresponding path program 1 times [2023-12-15 23:42:42,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:42:42,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019431725] [2023-12-15 23:42:42,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:42:42,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:42:42,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:42:42,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:42:42,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:42:42,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019431725] [2023-12-15 23:42:42,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019431725] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:42:42,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:42:42,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 23:42:42,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137591874] [2023-12-15 23:42:42,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:42:42,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 23:42:42,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:42:42,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 23:42:42,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 23:42:42,824 INFO L87 Difference]: Start difference. First operand 609 states and 894 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:42,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:42:42,910 INFO L93 Difference]: Finished difference Result 1234 states and 1869 transitions. [2023-12-15 23:42:42,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 23:42:42,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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 149 [2023-12-15 23:42:42,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:42:42,914 INFO L225 Difference]: With dead ends: 1234 [2023-12-15 23:42:42,914 INFO L226 Difference]: Without dead ends: 1011 [2023-12-15 23:42:42,915 INFO L412 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 [2023-12-15 23:42:42,916 INFO L413 NwaCegarLoop]: 713 mSDtfsCounter, 369 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 23:42:42,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 1120 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 23:42:42,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2023-12-15 23:42:42,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1009. [2023-12-15 23:42:42,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 1004 states have (on average 1.5) internal successors, (1506), 1008 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:42,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1506 transitions. [2023-12-15 23:42:42,938 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1506 transitions. Word has length 149 [2023-12-15 23:42:42,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:42:42,938 INFO L495 AbstractCegarLoop]: Abstraction has 1009 states and 1506 transitions. [2023-12-15 23:42:42,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:42,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1506 transitions. [2023-12-15 23:42:42,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-15 23:42:42,941 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:42:42,941 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:42:42,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 23:42:42,942 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-15 23:42:42,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:42:42,942 INFO L85 PathProgramCache]: Analyzing trace with hash -344094248, now seen corresponding path program 1 times [2023-12-15 23:42:42,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:42:42,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898695080] [2023-12-15 23:42:42,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:42:42,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:42:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:42:43,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:42:43,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:42:43,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898695080] [2023-12-15 23:42:43,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898695080] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:42:43,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:42:43,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 23:42:43,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330859371] [2023-12-15 23:42:43,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:42:43,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 23:42:43,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:42:43,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 23:42:43,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 23:42:43,342 INFO L87 Difference]: Start difference. First operand 1009 states and 1506 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:43,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:42:43,417 INFO L93 Difference]: Finished difference Result 2959 states and 4403 transitions. [2023-12-15 23:42:43,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 23:42:43,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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 149 [2023-12-15 23:42:43,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:42:43,425 INFO L225 Difference]: With dead ends: 2959 [2023-12-15 23:42:43,425 INFO L226 Difference]: Without dead ends: 1958 [2023-12-15 23:42:43,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:42:43,433 INFO L413 NwaCegarLoop]: 983 mSDtfsCounter, 1291 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1291 SdHoareTripleChecker+Valid, 1532 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:42:43,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1291 Valid, 1532 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 23:42:43,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1958 states. [2023-12-15 23:42:43,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1958 to 1916. [2023-12-15 23:42:43,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1916 states, 1911 states have (on average 1.488226059654631) internal successors, (2844), 1915 states have internal predecessors, (2844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:43,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1916 states and 2844 transitions. [2023-12-15 23:42:43,470 INFO L78 Accepts]: Start accepts. Automaton has 1916 states and 2844 transitions. Word has length 149 [2023-12-15 23:42:43,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:42:43,470 INFO L495 AbstractCegarLoop]: Abstraction has 1916 states and 2844 transitions. [2023-12-15 23:42:43,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:43,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 2844 transitions. [2023-12-15 23:42:43,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-15 23:42:43,473 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:42:43,474 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:42:43,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 23:42:43,474 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-15 23:42:43,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:42:43,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1977508618, now seen corresponding path program 1 times [2023-12-15 23:42:43,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:42:43,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619099240] [2023-12-15 23:42:43,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:42:43,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:42:43,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:42:43,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:42:43,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:42:43,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619099240] [2023-12-15 23:42:43,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619099240] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:42:43,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:42:43,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 23:42:43,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645112993] [2023-12-15 23:42:43,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:42:43,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 23:42:43,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:42:43,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 23:42:43,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 23:42:43,538 INFO L87 Difference]: Start difference. First operand 1916 states and 2844 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:43,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:42:43,604 INFO L93 Difference]: Finished difference Result 5712 states and 8472 transitions. [2023-12-15 23:42:43,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 23:42:43,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2023-12-15 23:42:43,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:42:43,614 INFO L225 Difference]: With dead ends: 5712 [2023-12-15 23:42:43,614 INFO L226 Difference]: Without dead ends: 3823 [2023-12-15 23:42:43,616 INFO L412 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 [2023-12-15 23:42:43,616 INFO L413 NwaCegarLoop]: 799 mSDtfsCounter, 594 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:42:43,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 1394 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 23:42:43,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3823 states. [2023-12-15 23:42:43,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3823 to 1918. [2023-12-15 23:42:43,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1918 states, 1913 states have (on average 1.4877156299006795) internal successors, (2846), 1917 states have internal predecessors, (2846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:43,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1918 states to 1918 states and 2846 transitions. [2023-12-15 23:42:43,655 INFO L78 Accepts]: Start accepts. Automaton has 1918 states and 2846 transitions. Word has length 150 [2023-12-15 23:42:43,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:42:43,656 INFO L495 AbstractCegarLoop]: Abstraction has 1918 states and 2846 transitions. [2023-12-15 23:42:43,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:43,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1918 states and 2846 transitions. [2023-12-15 23:42:43,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-15 23:42:43,658 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:42:43,658 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:42:43,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 23:42:43,658 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-15 23:42:43,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:42:43,659 INFO L85 PathProgramCache]: Analyzing trace with hash -2073680487, now seen corresponding path program 1 times [2023-12-15 23:42:43,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:42:43,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194844489] [2023-12-15 23:42:43,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:42:43,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:42:43,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:42:43,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:42:43,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:42:43,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194844489] [2023-12-15 23:42:43,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194844489] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:42:43,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:42:43,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 23:42:43,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458429363] [2023-12-15 23:42:43,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:42:43,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 23:42:43,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:42:43,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 23:42:43,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 23:42:43,898 INFO L87 Difference]: Start difference. First operand 1918 states and 2846 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:43,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:42:43,976 INFO L93 Difference]: Finished difference Result 5590 states and 8264 transitions. [2023-12-15 23:42:43,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 23:42:43,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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 151 [2023-12-15 23:42:43,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:42:43,987 INFO L225 Difference]: With dead ends: 5590 [2023-12-15 23:42:43,987 INFO L226 Difference]: Without dead ends: 3701 [2023-12-15 23:42:43,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:42:43,992 INFO L413 NwaCegarLoop]: 1048 mSDtfsCounter, 1197 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1197 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:42:43,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1197 Valid, 1601 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 23:42:43,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3701 states. [2023-12-15 23:42:44,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3701 to 3659. [2023-12-15 23:42:44,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3659 states, 3654 states have (on average 1.4723590585659552) internal successors, (5380), 3658 states have internal predecessors, (5380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:44,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3659 states to 3659 states and 5380 transitions. [2023-12-15 23:42:44,053 INFO L78 Accepts]: Start accepts. Automaton has 3659 states and 5380 transitions. Word has length 151 [2023-12-15 23:42:44,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:42:44,054 INFO L495 AbstractCegarLoop]: Abstraction has 3659 states and 5380 transitions. [2023-12-15 23:42:44,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:44,054 INFO L276 IsEmpty]: Start isEmpty. Operand 3659 states and 5380 transitions. [2023-12-15 23:42:44,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-15 23:42:44,058 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:42:44,058 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:42:44,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 23:42:44,058 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-15 23:42:44,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:42:44,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1860118187, now seen corresponding path program 1 times [2023-12-15 23:42:44,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:42:44,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103577499] [2023-12-15 23:42:44,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:42:44,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:42:44,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:42:44,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:42:44,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:42:44,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103577499] [2023-12-15 23:42:44,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103577499] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:42:44,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:42:44,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 23:42:44,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769750349] [2023-12-15 23:42:44,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:42:44,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 23:42:44,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:42:44,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 23:42:44,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 23:42:44,112 INFO L87 Difference]: Start difference. First operand 3659 states and 5380 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:44,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:42:44,154 INFO L93 Difference]: Finished difference Result 10903 states and 16022 transitions. [2023-12-15 23:42:44,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 23:42:44,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 152 [2023-12-15 23:42:44,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:42:44,177 INFO L225 Difference]: With dead ends: 10903 [2023-12-15 23:42:44,178 INFO L226 Difference]: Without dead ends: 7287 [2023-12-15 23:42:44,183 INFO L412 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 [2023-12-15 23:42:44,185 INFO L413 NwaCegarLoop]: 733 mSDtfsCounter, 580 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:42:44,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 1328 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 23:42:44,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7287 states. [2023-12-15 23:42:44,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7287 to 3663. [2023-12-15 23:42:44,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3663 states, 3658 states have (on average 1.471842536905413) internal successors, (5384), 3662 states have internal predecessors, (5384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:44,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3663 states to 3663 states and 5384 transitions. [2023-12-15 23:42:44,312 INFO L78 Accepts]: Start accepts. Automaton has 3663 states and 5384 transitions. Word has length 152 [2023-12-15 23:42:44,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:42:44,312 INFO L495 AbstractCegarLoop]: Abstraction has 3663 states and 5384 transitions. [2023-12-15 23:42:44,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:44,313 INFO L276 IsEmpty]: Start isEmpty. Operand 3663 states and 5384 transitions. [2023-12-15 23:42:44,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-15 23:42:44,316 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:42:44,316 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:42:44,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 23:42:44,316 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-15 23:42:44,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:42:44,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1962949158, now seen corresponding path program 1 times [2023-12-15 23:42:44,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:42:44,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412163579] [2023-12-15 23:42:44,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:42:44,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:42:44,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:42:44,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:42:44,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:42:44,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412163579] [2023-12-15 23:42:44,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412163579] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:42:44,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:42:44,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 23:42:44,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951167456] [2023-12-15 23:42:44,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:42:44,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 23:42:44,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:42:44,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 23:42:44,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 23:42:44,480 INFO L87 Difference]: Start difference. First operand 3663 states and 5384 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:44,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:42:44,591 INFO L93 Difference]: Finished difference Result 9918 states and 14515 transitions. [2023-12-15 23:42:44,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 23:42:44,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 153 [2023-12-15 23:42:44,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:42:44,621 INFO L225 Difference]: With dead ends: 9918 [2023-12-15 23:42:44,621 INFO L226 Difference]: Without dead ends: 6302 [2023-12-15 23:42:44,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:42:44,627 INFO L413 NwaCegarLoop]: 814 mSDtfsCounter, 1418 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1418 SdHoareTripleChecker+Valid, 1367 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 23:42:44,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1418 Valid, 1367 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 23:42:44,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6302 states. [2023-12-15 23:42:44,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6302 to 6260. [2023-12-15 23:42:44,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6260 states, 6255 states have (on average 1.4508393285371703) internal successors, (9075), 6259 states have internal predecessors, (9075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:44,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6260 states to 6260 states and 9075 transitions. [2023-12-15 23:42:44,734 INFO L78 Accepts]: Start accepts. Automaton has 6260 states and 9075 transitions. Word has length 153 [2023-12-15 23:42:44,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:42:44,734 INFO L495 AbstractCegarLoop]: Abstraction has 6260 states and 9075 transitions. [2023-12-15 23:42:44,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:44,734 INFO L276 IsEmpty]: Start isEmpty. Operand 6260 states and 9075 transitions. [2023-12-15 23:42:44,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-15 23:42:44,739 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:42:44,740 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:42:44,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 23:42:44,740 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-15 23:42:44,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:42:44,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1655200052, now seen corresponding path program 1 times [2023-12-15 23:42:44,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:42:44,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727372104] [2023-12-15 23:42:44,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:42:44,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:42:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:42:44,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:42:44,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:42:44,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727372104] [2023-12-15 23:42:44,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727372104] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:42:44,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:42:44,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 23:42:44,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662973896] [2023-12-15 23:42:44,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:42:44,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 23:42:44,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:42:44,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 23:42:44,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 23:42:44,789 INFO L87 Difference]: Start difference. First operand 6260 states and 9075 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:44,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:42:44,872 INFO L93 Difference]: Finished difference Result 18350 states and 26649 transitions. [2023-12-15 23:42:44,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 23:42:44,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2023-12-15 23:42:44,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:42:44,894 INFO L225 Difference]: With dead ends: 18350 [2023-12-15 23:42:44,895 INFO L226 Difference]: Without dead ends: 12429 [2023-12-15 23:42:44,904 INFO L412 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 [2023-12-15 23:42:44,904 INFO L413 NwaCegarLoop]: 1166 mSDtfsCounter, 566 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 1761 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:42:44,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 1761 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 23:42:44,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12429 states. [2023-12-15 23:42:45,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12429 to 6268. [2023-12-15 23:42:45,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6268 states, 6263 states have (on average 1.4502634520197988) internal successors, (9083), 6267 states have internal predecessors, (9083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:45,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6268 states to 6268 states and 9083 transitions. [2023-12-15 23:42:45,049 INFO L78 Accepts]: Start accepts. Automaton has 6268 states and 9083 transitions. Word has length 154 [2023-12-15 23:42:45,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:42:45,049 INFO L495 AbstractCegarLoop]: Abstraction has 6268 states and 9083 transitions. [2023-12-15 23:42:45,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:45,049 INFO L276 IsEmpty]: Start isEmpty. Operand 6268 states and 9083 transitions. [2023-12-15 23:42:45,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-15 23:42:45,055 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:42:45,055 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:42:45,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 23:42:45,055 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-15 23:42:45,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:42:45,056 INFO L85 PathProgramCache]: Analyzing trace with hash 34235371, now seen corresponding path program 1 times [2023-12-15 23:42:45,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:42:45,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325270243] [2023-12-15 23:42:45,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:42:45,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:42:45,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:42:45,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:42:45,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:42:45,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325270243] [2023-12-15 23:42:45,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325270243] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:42:45,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:42:45,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 23:42:45,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017965100] [2023-12-15 23:42:45,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:42:45,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:42:45,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:42:45,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:42:45,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:42:45,250 INFO L87 Difference]: Start difference. First operand 6268 states and 9083 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:45,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:42:45,387 INFO L93 Difference]: Finished difference Result 18286 states and 26408 transitions. [2023-12-15 23:42:45,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 23:42:45,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 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 155 [2023-12-15 23:42:45,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:42:45,404 INFO L225 Difference]: With dead ends: 18286 [2023-12-15 23:42:45,404 INFO L226 Difference]: Without dead ends: 12105 [2023-12-15 23:42:45,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:42:45,411 INFO L413 NwaCegarLoop]: 1034 mSDtfsCounter, 1120 mSDsluCounter, 1098 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1120 SdHoareTripleChecker+Valid, 2132 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:42:45,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1120 Valid, 2132 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 23:42:45,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12105 states. [2023-12-15 23:42:45,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12105 to 12063. [2023-12-15 23:42:45,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12063 states, 12058 states have (on average 1.4318294907944933) internal successors, (17265), 12062 states have internal predecessors, (17265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:45,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12063 states to 12063 states and 17265 transitions. [2023-12-15 23:42:45,608 INFO L78 Accepts]: Start accepts. Automaton has 12063 states and 17265 transitions. Word has length 155 [2023-12-15 23:42:45,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:42:45,608 INFO L495 AbstractCegarLoop]: Abstraction has 12063 states and 17265 transitions. [2023-12-15 23:42:45,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:45,609 INFO L276 IsEmpty]: Start isEmpty. Operand 12063 states and 17265 transitions. [2023-12-15 23:42:45,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-15 23:42:45,620 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:42:45,621 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:42:45,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 23:42:45,621 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-15 23:42:45,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:42:45,625 INFO L85 PathProgramCache]: Analyzing trace with hash -955667813, now seen corresponding path program 1 times [2023-12-15 23:42:45,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:42:45,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026272936] [2023-12-15 23:42:45,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:42:45,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:42:45,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:42:45,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:42:45,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:42:45,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026272936] [2023-12-15 23:42:45,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026272936] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:42:45,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:42:45,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 23:42:45,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664436636] [2023-12-15 23:42:45,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:42:45,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 23:42:45,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:42:45,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 23:42:45,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 23:42:45,839 INFO L87 Difference]: Start difference. First operand 12063 states and 17265 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:45,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:42:45,901 INFO L93 Difference]: Finished difference Result 21240 states and 30374 transitions. [2023-12-15 23:42:45,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 23:42:45,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 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 155 [2023-12-15 23:42:45,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:42:45,914 INFO L225 Difference]: With dead ends: 21240 [2023-12-15 23:42:45,914 INFO L226 Difference]: Without dead ends: 9250 [2023-12-15 23:42:45,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:42:45,930 INFO L413 NwaCegarLoop]: 645 mSDtfsCounter, 65 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 1842 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:42:45,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 1842 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 23:42:45,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9250 states. [2023-12-15 23:42:46,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9250 to 9250. [2023-12-15 23:42:46,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9250 states, 9245 states have (on average 1.4289886425094647) internal successors, (13211), 9249 states have internal predecessors, (13211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:46,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9250 states to 9250 states and 13211 transitions. [2023-12-15 23:42:46,042 INFO L78 Accepts]: Start accepts. Automaton has 9250 states and 13211 transitions. Word has length 155 [2023-12-15 23:42:46,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:42:46,042 INFO L495 AbstractCegarLoop]: Abstraction has 9250 states and 13211 transitions. [2023-12-15 23:42:46,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:46,043 INFO L276 IsEmpty]: Start isEmpty. Operand 9250 states and 13211 transitions. [2023-12-15 23:42:46,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-15 23:42:46,050 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:42:46,050 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:42:46,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 23:42:46,051 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-15 23:42:46,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:42:46,051 INFO L85 PathProgramCache]: Analyzing trace with hash -762023051, now seen corresponding path program 1 times [2023-12-15 23:42:46,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:42:46,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27438841] [2023-12-15 23:42:46,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:42:46,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:42:46,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:42:46,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:42:46,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:42:46,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27438841] [2023-12-15 23:42:46,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27438841] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:42:46,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:42:46,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 23:42:46,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322348663] [2023-12-15 23:42:46,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:42:46,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 23:42:46,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:42:46,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 23:42:46,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 23:42:46,113 INFO L87 Difference]: Start difference. First operand 9250 states and 13211 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:46,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:42:46,214 INFO L93 Difference]: Finished difference Result 22835 states and 33227 transitions. [2023-12-15 23:42:46,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 23:42:46,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 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 157 [2023-12-15 23:42:46,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:42:46,236 INFO L225 Difference]: With dead ends: 22835 [2023-12-15 23:42:46,236 INFO L226 Difference]: Without dead ends: 14196 [2023-12-15 23:42:46,248 INFO L412 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 [2023-12-15 23:42:46,249 INFO L413 NwaCegarLoop]: 804 mSDtfsCounter, 315 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:42:46,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 1275 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 23:42:46,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14196 states. [2023-12-15 23:42:46,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14196 to 12164. [2023-12-15 23:42:46,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12164 states, 12159 states have (on average 1.473476437207007) internal successors, (17916), 12163 states have internal predecessors, (17916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:46,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12164 states to 12164 states and 17916 transitions. [2023-12-15 23:42:46,407 INFO L78 Accepts]: Start accepts. Automaton has 12164 states and 17916 transitions. Word has length 157 [2023-12-15 23:42:46,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:42:46,408 INFO L495 AbstractCegarLoop]: Abstraction has 12164 states and 17916 transitions. [2023-12-15 23:42:46,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:46,408 INFO L276 IsEmpty]: Start isEmpty. Operand 12164 states and 17916 transitions. [2023-12-15 23:42:46,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-15 23:42:46,416 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:42:46,416 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:42:46,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-15 23:42:46,416 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-15 23:42:46,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:42:46,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1109262820, now seen corresponding path program 1 times [2023-12-15 23:42:46,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:42:46,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217955547] [2023-12-15 23:42:46,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:42:46,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:42:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:42:46,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:42:46,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:42:46,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217955547] [2023-12-15 23:42:46,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217955547] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:42:46,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:42:46,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 23:42:46,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502653844] [2023-12-15 23:42:46,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:42:46,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 23:42:46,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:42:46,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 23:42:46,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 23:42:46,477 INFO L87 Difference]: Start difference. First operand 12164 states and 17916 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:46,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:42:46,584 INFO L93 Difference]: Finished difference Result 28248 states and 42326 transitions. [2023-12-15 23:42:46,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 23:42:46,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 159 [2023-12-15 23:42:46,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:42:46,616 INFO L225 Difference]: With dead ends: 28248 [2023-12-15 23:42:46,617 INFO L226 Difference]: Without dead ends: 18498 [2023-12-15 23:42:46,635 INFO L412 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 [2023-12-15 23:42:46,636 INFO L413 NwaCegarLoop]: 831 mSDtfsCounter, 352 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1277 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:42:46,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 1277 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 23:42:46,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18498 states. [2023-12-15 23:42:46,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18498 to 16600. [2023-12-15 23:42:46,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16600 states, 16595 states have (on average 1.5057547454052425) internal successors, (24988), 16599 states have internal predecessors, (24988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:47,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16600 states to 16600 states and 24988 transitions. [2023-12-15 23:42:47,009 INFO L78 Accepts]: Start accepts. Automaton has 16600 states and 24988 transitions. Word has length 159 [2023-12-15 23:42:47,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:42:47,010 INFO L495 AbstractCegarLoop]: Abstraction has 16600 states and 24988 transitions. [2023-12-15 23:42:47,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:47,010 INFO L276 IsEmpty]: Start isEmpty. Operand 16600 states and 24988 transitions. [2023-12-15 23:42:47,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-12-15 23:42:47,017 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:42:47,018 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:42:47,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-15 23:42:47,018 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-15 23:42:47,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:42:47,018 INFO L85 PathProgramCache]: Analyzing trace with hash 517365043, now seen corresponding path program 1 times [2023-12-15 23:42:47,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:42:47,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6195874] [2023-12-15 23:42:47,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:42:47,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:42:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:42:47,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:42:47,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:42:47,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6195874] [2023-12-15 23:42:47,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6195874] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:42:47,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:42:47,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 23:42:47,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128787510] [2023-12-15 23:42:47,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:42:47,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 23:42:47,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:42:47,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 23:42:47,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-15 23:42:47,444 INFO L87 Difference]: Start difference. First operand 16600 states and 24988 transitions. Second operand has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 8 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:48,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:42:48,413 INFO L93 Difference]: Finished difference Result 83310 states and 127733 transitions. [2023-12-15 23:42:48,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-15 23:42:48,414 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 8 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2023-12-15 23:42:48,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:42:48,543 INFO L225 Difference]: With dead ends: 83310 [2023-12-15 23:42:48,543 INFO L226 Difference]: Without dead ends: 67459 [2023-12-15 23:42:48,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2023-12-15 23:42:48,574 INFO L413 NwaCegarLoop]: 465 mSDtfsCounter, 6812 mSDsluCounter, 2328 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6812 SdHoareTripleChecker+Valid, 2793 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-15 23:42:48,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6812 Valid, 2793 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-15 23:42:48,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67459 states. [2023-12-15 23:42:49,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67459 to 44913. [2023-12-15 23:42:49,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44913 states, 44908 states have (on average 1.5069252694397435) internal successors, (67673), 44912 states have internal predecessors, (67673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:49,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44913 states to 44913 states and 67673 transitions. [2023-12-15 23:42:49,657 INFO L78 Accepts]: Start accepts. Automaton has 44913 states and 67673 transitions. Word has length 160 [2023-12-15 23:42:49,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:42:49,657 INFO L495 AbstractCegarLoop]: Abstraction has 44913 states and 67673 transitions. [2023-12-15 23:42:49,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 8 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:49,658 INFO L276 IsEmpty]: Start isEmpty. Operand 44913 states and 67673 transitions. [2023-12-15 23:42:49,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-12-15 23:42:49,675 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:42:49,675 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:42:49,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-15 23:42:49,675 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-15 23:42:49,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:42:49,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1645025275, now seen corresponding path program 1 times [2023-12-15 23:42:49,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:42:49,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94688095] [2023-12-15 23:42:49,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:42:49,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:42:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:42:50,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:42:50,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:42:50,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94688095] [2023-12-15 23:42:50,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94688095] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:42:50,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:42:50,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 23:42:50,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690594142] [2023-12-15 23:42:50,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:42:50,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 23:42:50,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:42:50,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 23:42:50,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-15 23:42:50,125 INFO L87 Difference]: Start difference. First operand 44913 states and 67673 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:50,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:42:50,461 INFO L93 Difference]: Finished difference Result 86496 states and 133602 transitions. [2023-12-15 23:42:50,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 23:42:50,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2023-12-15 23:42:50,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:42:50,540 INFO L225 Difference]: With dead ends: 86496 [2023-12-15 23:42:50,540 INFO L226 Difference]: Without dead ends: 53913 [2023-12-15 23:42:50,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-15 23:42:50,576 INFO L413 NwaCegarLoop]: 559 mSDtfsCounter, 1008 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1008 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 23:42:50,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1008 Valid, 1041 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 23:42:50,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53913 states. [2023-12-15 23:42:51,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53913 to 53911. [2023-12-15 23:42:51,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53911 states, 53906 states have (on average 1.5108336734315289) internal successors, (81443), 53910 states have internal predecessors, (81443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:51,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53911 states to 53911 states and 81443 transitions. [2023-12-15 23:42:51,441 INFO L78 Accepts]: Start accepts. Automaton has 53911 states and 81443 transitions. Word has length 160 [2023-12-15 23:42:51,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:42:51,442 INFO L495 AbstractCegarLoop]: Abstraction has 53911 states and 81443 transitions. [2023-12-15 23:42:51,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:51,442 INFO L276 IsEmpty]: Start isEmpty. Operand 53911 states and 81443 transitions. [2023-12-15 23:42:51,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-12-15 23:42:51,462 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:42:51,463 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:42:51,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-15 23:42:51,463 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-15 23:42:51,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:42:51,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1340825718, now seen corresponding path program 1 times [2023-12-15 23:42:51,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:42:51,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592826154] [2023-12-15 23:42:51,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:42:51,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:42:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:42:51,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:42:51,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:42:51,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592826154] [2023-12-15 23:42:51,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592826154] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:42:51,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:42:51,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 23:42:51,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445652680] [2023-12-15 23:42:51,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:42:51,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 23:42:51,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:42:51,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 23:42:51,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 23:42:51,794 INFO L87 Difference]: Start difference. First operand 53911 states and 81443 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:52,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:42:52,321 INFO L93 Difference]: Finished difference Result 141811 states and 213714 transitions. [2023-12-15 23:42:52,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 23:42:52,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2023-12-15 23:42:52,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:42:52,435 INFO L225 Difference]: With dead ends: 141811 [2023-12-15 23:42:52,436 INFO L226 Difference]: Without dead ends: 88031 [2023-12-15 23:42:52,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:42:52,483 INFO L413 NwaCegarLoop]: 1017 mSDtfsCounter, 1168 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1168 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:42:52,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1168 Valid, 1540 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 23:42:52,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88031 states. [2023-12-15 23:42:53,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88031 to 87997. [2023-12-15 23:42:53,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87997 states, 87992 states have (on average 1.4901695608691699) internal successors, (131123), 87996 states have internal predecessors, (131123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:53,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87997 states to 87997 states and 131123 transitions. [2023-12-15 23:42:53,994 INFO L78 Accepts]: Start accepts. Automaton has 87997 states and 131123 transitions. Word has length 160 [2023-12-15 23:42:53,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:42:53,994 INFO L495 AbstractCegarLoop]: Abstraction has 87997 states and 131123 transitions. [2023-12-15 23:42:53,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:53,994 INFO L276 IsEmpty]: Start isEmpty. Operand 87997 states and 131123 transitions. [2023-12-15 23:42:54,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-12-15 23:42:54,049 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:42:54,052 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:42:54,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-15 23:42:54,054 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-15 23:42:54,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:42:54,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1045853679, now seen corresponding path program 1 times [2023-12-15 23:42:54,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:42:54,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731138686] [2023-12-15 23:42:54,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:42:54,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:42:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:42:54,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:42:54,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:42:54,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731138686] [2023-12-15 23:42:54,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731138686] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:42:54,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:42:54,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 23:42:54,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610535405] [2023-12-15 23:42:54,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:42:54,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 23:42:54,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:42:54,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 23:42:54,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 23:42:54,319 INFO L87 Difference]: Start difference. First operand 87997 states and 131123 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:54,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:42:54,882 INFO L93 Difference]: Finished difference Result 158523 states and 235958 transitions. [2023-12-15 23:42:54,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 23:42:54,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2023-12-15 23:42:54,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:42:55,005 INFO L225 Difference]: With dead ends: 158523 [2023-12-15 23:42:55,005 INFO L226 Difference]: Without dead ends: 87997 [2023-12-15 23:42:55,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:42:55,381 INFO L413 NwaCegarLoop]: 625 mSDtfsCounter, 53 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1797 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:42:55,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1797 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 23:42:55,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87997 states. [2023-12-15 23:42:56,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87997 to 87997. [2023-12-15 23:42:56,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87997 states, 87992 states have (on average 1.4901581961996546) internal successors, (131122), 87996 states have internal predecessors, (131122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:56,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87997 states to 87997 states and 131122 transitions. [2023-12-15 23:42:56,634 INFO L78 Accepts]: Start accepts. Automaton has 87997 states and 131122 transitions. Word has length 162 [2023-12-15 23:42:56,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:42:56,634 INFO L495 AbstractCegarLoop]: Abstraction has 87997 states and 131122 transitions. [2023-12-15 23:42:56,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:56,634 INFO L276 IsEmpty]: Start isEmpty. Operand 87997 states and 131122 transitions. [2023-12-15 23:42:56,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-12-15 23:42:56,654 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:42:56,654 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:42:56,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-15 23:42:56,655 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-15 23:42:56,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:42:56,655 INFO L85 PathProgramCache]: Analyzing trace with hash 528611436, now seen corresponding path program 1 times [2023-12-15 23:42:56,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:42:56,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286815147] [2023-12-15 23:42:56,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:42:56,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:42:56,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:42:56,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:42:56,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:42:56,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286815147] [2023-12-15 23:42:56,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286815147] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:42:56,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:42:56,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 23:42:56,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830151538] [2023-12-15 23:42:56,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:42:56,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 23:42:56,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:42:56,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 23:42:56,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 23:42:56,965 INFO L87 Difference]: Start difference. First operand 87997 states and 131122 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:42:57,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:42:57,574 INFO L93 Difference]: Finished difference Result 224210 states and 334535 transitions. [2023-12-15 23:42:57,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 23:42:57,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2023-12-15 23:42:57,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:42:58,218 INFO L225 Difference]: With dead ends: 224210 [2023-12-15 23:42:58,218 INFO L226 Difference]: Without dead ends: 137774 [2023-12-15 23:42:58,320 INFO L412 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 [2023-12-15 23:42:58,321 INFO L413 NwaCegarLoop]: 681 mSDtfsCounter, 513 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:42:58,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 1207 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 23:42:58,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137774 states. [2023-12-15 23:43:00,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137774 to 137744. [2023-12-15 23:43:00,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137744 states, 137739 states have (on average 1.4761323953273946) internal successors, (203321), 137743 states have internal predecessors, (203321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:43:00,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137744 states to 137744 states and 203321 transitions. [2023-12-15 23:43:00,753 INFO L78 Accepts]: Start accepts. Automaton has 137744 states and 203321 transitions. Word has length 162 [2023-12-15 23:43:00,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:43:00,754 INFO L495 AbstractCegarLoop]: Abstraction has 137744 states and 203321 transitions. [2023-12-15 23:43:00,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:43:00,754 INFO L276 IsEmpty]: Start isEmpty. Operand 137744 states and 203321 transitions. [2023-12-15 23:43:00,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-12-15 23:43:00,829 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:43:00,838 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:43:00,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-15 23:43:00,839 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-15 23:43:00,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:43:00,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1920351603, now seen corresponding path program 1 times [2023-12-15 23:43:00,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:43:00,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197850997] [2023-12-15 23:43:00,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:43:00,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:43:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:43:00,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:43:00,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:43:00,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197850997] [2023-12-15 23:43:00,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197850997] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:43:00,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:43:00,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 23:43:00,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768807637] [2023-12-15 23:43:00,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:43:00,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 23:43:00,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:43:00,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 23:43:00,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 23:43:00,889 INFO L87 Difference]: Start difference. First operand 137744 states and 203321 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:43:02,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:43:02,180 INFO L93 Difference]: Finished difference Result 335051 states and 498270 transitions. [2023-12-15 23:43:02,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 23:43:02,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2023-12-15 23:43:02,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:43:02,728 INFO L225 Difference]: With dead ends: 335051 [2023-12-15 23:43:02,729 INFO L226 Difference]: Without dead ends: 218778 [2023-12-15 23:43:02,854 INFO L412 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 [2023-12-15 23:43:02,857 INFO L413 NwaCegarLoop]: 794 mSDtfsCounter, 308 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:43:02,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 1251 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 23:43:03,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218778 states. [2023-12-15 23:43:06,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218778 to 199610. [2023-12-15 23:43:06,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199610 states, 199605 states have (on average 1.500839157335738) internal successors, (299575), 199609 states have internal predecessors, (299575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:43:06,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199610 states to 199610 states and 299575 transitions. [2023-12-15 23:43:06,732 INFO L78 Accepts]: Start accepts. Automaton has 199610 states and 299575 transitions. Word has length 166 [2023-12-15 23:43:06,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:43:06,732 INFO L495 AbstractCegarLoop]: Abstraction has 199610 states and 299575 transitions. [2023-12-15 23:43:06,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:43:06,733 INFO L276 IsEmpty]: Start isEmpty. Operand 199610 states and 299575 transitions. [2023-12-15 23:43:06,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-15 23:43:06,765 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:43:06,765 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:43:06,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-15 23:43:06,766 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-15 23:43:06,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:43:06,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1757133636, now seen corresponding path program 1 times [2023-12-15 23:43:06,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:43:06,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18319047] [2023-12-15 23:43:06,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:43:06,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:43:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:43:06,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:43:06,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:43:06,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18319047] [2023-12-15 23:43:06,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18319047] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:43:06,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:43:06,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 23:43:06,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413762748] [2023-12-15 23:43:06,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:43:06,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 23:43:06,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:43:06,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 23:43:06,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 23:43:06,816 INFO L87 Difference]: Start difference. First operand 199610 states and 299575 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:43:09,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:43:09,223 INFO L93 Difference]: Finished difference Result 583538 states and 878145 transitions. [2023-12-15 23:43:09,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 23:43:09,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2023-12-15 23:43:09,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:43:10,590 INFO L225 Difference]: With dead ends: 583538 [2023-12-15 23:43:10,591 INFO L226 Difference]: Without dead ends: 392200 [2023-12-15 23:43:10,730 INFO L412 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 [2023-12-15 23:43:10,730 INFO L413 NwaCegarLoop]: 738 mSDtfsCounter, 493 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 23:43:10,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 1202 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 23:43:10,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392200 states. [2023-12-15 23:43:15,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392200 to 392142. [2023-12-15 23:43:16,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392142 states, 392137 states have (on average 1.493883515200045) internal successors, (585807), 392141 states have internal predecessors, (585807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:43:17,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392142 states to 392142 states and 585807 transitions. [2023-12-15 23:43:17,380 INFO L78 Accepts]: Start accepts. Automaton has 392142 states and 585807 transitions. Word has length 167 [2023-12-15 23:43:17,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:43:17,396 INFO L495 AbstractCegarLoop]: Abstraction has 392142 states and 585807 transitions. [2023-12-15 23:43:17,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:43:17,396 INFO L276 IsEmpty]: Start isEmpty. Operand 392142 states and 585807 transitions. [2023-12-15 23:43:17,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-15 23:43:17,467 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:43:17,467 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:43:17,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-15 23:43:17,468 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-15 23:43:17,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:43:17,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1780638007, now seen corresponding path program 1 times [2023-12-15 23:43:17,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:43:17,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290740929] [2023-12-15 23:43:17,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:43:17,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:43:17,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:43:18,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:43:18,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:43:18,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290740929] [2023-12-15 23:43:18,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290740929] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:43:18,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:43:18,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 23:43:18,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433252735] [2023-12-15 23:43:18,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:43:18,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 23:43:18,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:43:18,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 23:43:18,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 23:43:18,091 INFO L87 Difference]: Start difference. First operand 392142 states and 585807 transitions. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:43:20,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:43:20,911 INFO L93 Difference]: Finished difference Result 748897 states and 1119071 transitions. [2023-12-15 23:43:20,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 23:43:20,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2023-12-15 23:43:20,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:43:22,315 INFO L225 Difference]: With dead ends: 748897 [2023-12-15 23:43:22,316 INFO L226 Difference]: Without dead ends: 356812 [2023-12-15 23:43:22,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:43:22,621 INFO L413 NwaCegarLoop]: 615 mSDtfsCounter, 43 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1778 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:43:22,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 1778 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 23:43:22,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356812 states. [2023-12-15 23:43:27,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356812 to 356812. [2023-12-15 23:43:27,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356812 states, 356807 states have (on average 1.4947464595705802) internal successors, (533336), 356811 states have internal predecessors, (533336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:43:29,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356812 states to 356812 states and 533336 transitions. [2023-12-15 23:43:29,178 INFO L78 Accepts]: Start accepts. Automaton has 356812 states and 533336 transitions. Word has length 167 [2023-12-15 23:43:29,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:43:29,178 INFO L495 AbstractCegarLoop]: Abstraction has 356812 states and 533336 transitions. [2023-12-15 23:43:29,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 23:43:29,178 INFO L276 IsEmpty]: Start isEmpty. Operand 356812 states and 533336 transitions. [2023-12-15 23:43:29,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-12-15 23:43:29,223 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:43:29,223 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:43:29,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-15 23:43:29,224 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-15 23:43:29,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:43:29,224 INFO L85 PathProgramCache]: Analyzing trace with hash 245937869, now seen corresponding path program 1 times [2023-12-15 23:43:29,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:43:29,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425084895] [2023-12-15 23:43:29,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:43:29,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:43:29,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:43:29,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:43:29,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:43:29,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425084895] [2023-12-15 23:43:29,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425084895] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:43:29,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:43:29,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 23:43:29,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936215443] [2023-12-15 23:43:29,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:43:29,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 23:43:29,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:43:29,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 23:43:29,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-15 23:43:29,490 INFO L87 Difference]: Start difference. First operand 356812 states and 533336 transitions. Second operand has 9 states, 9 states have (on average 19.11111111111111) internal successors, (172), 8 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2023-12-15 23:43:33,000 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-15 23:43:33,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-15 23:43:33,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2023-12-15 23:43:33,004 INFO L413 NwaCegarLoop]: 473 mSDtfsCounter, 5758 mSDsluCounter, 2235 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5758 SdHoareTripleChecker+Valid, 2708 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-15 23:43:33,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5758 Valid, 2708 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-15 23:43:33,006 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-12-15 23:43:33,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-15 23:43:33,007 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (356812states) and FLOYD_HOARE automaton (currently 13 states, 9 states before enhancement),while ReachableStatesComputation was computing reachable states (779368 states constructed, input type IntersectNwa). [2023-12-15 23:43:33,009 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-12-15 23:43:33,009 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-12-15 23:43:33,009 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-12-15 23:43:33,009 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-12-15 23:43:33,013 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:43:33,019 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 23:43:33,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 11:43:33 BoogieIcfgContainer [2023-12-15 23:43:33,021 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 23:43:33,022 INFO L158 Benchmark]: Toolchain (without parser) took 53072.01ms. Allocated memory was 292.6MB in the beginning and 7.9GB in the end (delta: 7.6GB). Free memory was 239.8MB in the beginning and 5.5GB in the end (delta: -5.2GB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2023-12-15 23:43:33,023 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 200.3MB. Free memory was 149.0MB in the beginning and 148.8MB in the end (delta: 138.7kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 23:43:33,023 INFO L158 Benchmark]: CACSL2BoogieTranslator took 674.29ms. Allocated memory is still 292.6MB. Free memory was 239.3MB in the beginning and 189.5MB in the end (delta: 49.8MB). Peak memory consumption was 49.3MB. Max. memory is 8.0GB. [2023-12-15 23:43:33,026 INFO L158 Benchmark]: Boogie Procedure Inliner took 110.47ms. Allocated memory is still 292.6MB. Free memory was 189.5MB in the beginning and 250.9MB in the end (delta: -61.4MB). Peak memory consumption was 6.2MB. Max. memory is 8.0GB. [2023-12-15 23:43:33,027 INFO L158 Benchmark]: Boogie Preprocessor took 115.48ms. Allocated memory is still 292.6MB. Free memory was 250.9MB in the beginning and 243.1MB in the end (delta: 7.9MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2023-12-15 23:43:33,027 INFO L158 Benchmark]: RCFGBuilder took 1074.41ms. Allocated memory is still 292.6MB. Free memory was 243.1MB in the beginning and 205.4MB in the end (delta: 37.7MB). Peak memory consumption was 95.4MB. Max. memory is 8.0GB. [2023-12-15 23:43:33,028 INFO L158 Benchmark]: TraceAbstraction took 51092.82ms. Allocated memory was 292.6MB in the beginning and 7.9GB in the end (delta: 7.6GB). Free memory was 204.9MB in the beginning and 5.5GB in the end (delta: -5.3GB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2023-12-15 23:43:33,032 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 200.3MB. Free memory was 149.0MB in the beginning and 148.8MB in the end (delta: 138.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 674.29ms. Allocated memory is still 292.6MB. Free memory was 239.3MB in the beginning and 189.5MB in the end (delta: 49.8MB). Peak memory consumption was 49.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 110.47ms. Allocated memory is still 292.6MB. Free memory was 189.5MB in the beginning and 250.9MB in the end (delta: -61.4MB). Peak memory consumption was 6.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 115.48ms. Allocated memory is still 292.6MB. Free memory was 250.9MB in the beginning and 243.1MB in the end (delta: 7.9MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * RCFGBuilder took 1074.41ms. Allocated memory is still 292.6MB. Free memory was 243.1MB in the beginning and 205.4MB in the end (delta: 37.7MB). Peak memory consumption was 95.4MB. Max. memory is 8.0GB. * TraceAbstraction took 51092.82ms. Allocated memory was 292.6MB in the beginning and 7.9GB in the end (delta: 7.6GB). Free memory was 204.9MB in the beginning and 5.5GB in the end (delta: -5.3GB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 1075]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1075). Cancelled while NwaCegarLoop was constructing difference of abstraction (356812states) and FLOYD_HOARE automaton (currently 13 states, 9 states before enhancement),while ReachableStatesComputation was computing reachable states (779368 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 915]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 915). Cancelled while NwaCegarLoop was constructing difference of abstraction (356812states) and FLOYD_HOARE automaton (currently 13 states, 9 states before enhancement),while ReachableStatesComputation was computing reachable states (779368 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 960]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 960). Cancelled while NwaCegarLoop was constructing difference of abstraction (356812states) and FLOYD_HOARE automaton (currently 13 states, 9 states before enhancement),while ReachableStatesComputation was computing reachable states (779368 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1140]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1140). Cancelled while NwaCegarLoop was constructing difference of abstraction (356812states) and FLOYD_HOARE automaton (currently 13 states, 9 states before enhancement),while ReachableStatesComputation was computing reachable states (779368 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1975]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1975). Cancelled while NwaCegarLoop was constructing difference of abstraction (356812states) and FLOYD_HOARE automaton (currently 13 states, 9 states before enhancement),while ReachableStatesComputation was computing reachable states (779368 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 422 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 51.0s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.4s, AutomataDifference: 20.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 24468 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24468 mSDsluCounter, 33303 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16896 mSDsCounter, 371 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2245 IncrementalHoareTripleChecker+Invalid, 2616 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 371 mSolverCounterUnsat, 16407 mSDtfsCounter, 2245 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=392142occurred in iteration=19, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 25.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 57630 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 3309 NumberOfCodeBlocks, 3309 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 3288 ConstructedInterpolants, 0 QuantifiedInterpolants, 8435 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown