/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/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-62.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:30:59,572 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:30:59,642 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 21:30:59,647 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:30:59,648 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:30:59,671 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:30:59,671 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:30:59,671 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:30:59,672 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:30:59,676 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:30:59,676 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:30:59,676 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:30:59,677 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:30:59,678 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:30:59,678 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:30:59,678 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:30:59,678 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:30:59,679 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:30:59,679 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:30:59,679 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:30:59,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:30:59,679 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:30:59,680 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:30:59,680 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:30:59,680 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:30:59,680 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:30:59,680 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:30:59,680 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:30:59,681 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:30:59,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:30:59,682 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:30:59,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:30:59,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:30:59,682 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:30:59,682 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:30:59,682 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:30:59,682 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:30:59,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:30:59,683 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:30:59,683 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:30:59,683 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:30:59,683 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:30:59,683 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:30:59,683 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 21:30:59,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:30:59,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:30:59,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:30:59,897 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:30:59,897 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:30:59,898 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-62.i [2023-12-15 21:31:00,901 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:31:01,057 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:31:01,058 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-62.i [2023-12-15 21:31:01,070 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3225fd932/fdf5480be1c54edb81174164f85bad98/FLAGfa94315fd [2023-12-15 21:31:01,080 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3225fd932/fdf5480be1c54edb81174164f85bad98 [2023-12-15 21:31:01,082 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:31:01,082 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:31:01,083 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:31:01,083 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:31:01,086 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:31:01,087 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:31:01" (1/1) ... [2023-12-15 21:31:01,088 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@777c7b39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:01, skipping insertion in model container [2023-12-15 21:31:01,088 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:31:01" (1/1) ... [2023-12-15 21:31:01,105 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:31:01,197 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-62.i[916,929] [2023-12-15 21:31:01,225 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:31:01,234 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:31:01,241 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-62.i[916,929] [2023-12-15 21:31:01,260 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:31:01,272 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:31:01,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:01 WrapperNode [2023-12-15 21:31:01,272 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:31:01,273 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:31:01,273 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:31:01,274 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:31:01,278 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:01" (1/1) ... [2023-12-15 21:31:01,286 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:01" (1/1) ... [2023-12-15 21:31:01,311 INFO L138 Inliner]: procedures = 26, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 330 [2023-12-15 21:31:01,311 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:31:01,311 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:31:01,312 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:31:01,312 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:31:01,319 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:01" (1/1) ... [2023-12-15 21:31:01,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:01" (1/1) ... [2023-12-15 21:31:01,323 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:01" (1/1) ... [2023-12-15 21:31:01,342 INFO L175 MemorySlicer]: Split 87 memory accesses to 6 slices as follows [2, 10, 29, 26, 4, 16]. 33 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 3, 3, 1, 2]. The 14 writes are split as follows [0, 1, 4, 6, 1, 2]. [2023-12-15 21:31:01,342 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:01" (1/1) ... [2023-12-15 21:31:01,343 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:01" (1/1) ... [2023-12-15 21:31:01,351 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:01" (1/1) ... [2023-12-15 21:31:01,354 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:01" (1/1) ... [2023-12-15 21:31:01,356 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:01" (1/1) ... [2023-12-15 21:31:01,357 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:01" (1/1) ... [2023-12-15 21:31:01,360 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:31:01,368 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:31:01,368 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:31:01,368 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:31:01,369 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:01" (1/1) ... [2023-12-15 21:31:01,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:31:01,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:31:01,423 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 21:31:01,431 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 21:31:01,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:31:01,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-15 21:31:01,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-15 21:31:01,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-15 21:31:01,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-15 21:31:01,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-15 21:31:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-15 21:31:01,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-15 21:31:01,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-15 21:31:01,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-15 21:31:01,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-15 21:31:01,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-15 21:31:01,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-15 21:31:01,451 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 21:31:01,451 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 21:31:01,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:31:01,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 21:31:01,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-15 21:31:01,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-15 21:31:01,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-15 21:31:01,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-15 21:31:01,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:31:01,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:31:01,547 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:31:01,549 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:31:01,846 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:31:01,887 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:31:01,888 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 21:31:01,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:31:01 BoogieIcfgContainer [2023-12-15 21:31:01,888 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:31:01,891 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:31:01,891 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:31:01,893 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:31:01,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:31:01" (1/3) ... [2023-12-15 21:31:01,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c35e30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:31:01, skipping insertion in model container [2023-12-15 21:31:01,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:31:01" (2/3) ... [2023-12-15 21:31:01,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c35e30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:31:01, skipping insertion in model container [2023-12-15 21:31:01,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:31:01" (3/3) ... [2023-12-15 21:31:01,895 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-62.i [2023-12-15 21:31:01,907 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:31:01,907 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:31:01,946 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:31:01,952 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;@30b8ebf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:31:01,952 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:31:01,955 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-15 21:31:01,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-15 21:31:01,972 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:01,972 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:01,972 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:01,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:01,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1944691701, now seen corresponding path program 1 times [2023-12-15 21:31:01,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:01,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660127115] [2023-12-15 21:31:01,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:01,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:02,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:02,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:02,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:02,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,238 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-15 21:31:02,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:02,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660127115] [2023-12-15 21:31:02,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660127115] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:02,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:02,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:31:02,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613831421] [2023-12-15 21:31:02,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:02,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 21:31:02,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:02,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 21:31:02,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:31:02,278 INFO L87 Difference]: Start difference. First operand has 66 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-15 21:31:02,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:02,314 INFO L93 Difference]: Finished difference Result 129 states and 200 transitions. [2023-12-15 21:31:02,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 21:31:02,316 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 68 [2023-12-15 21:31:02,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:02,321 INFO L225 Difference]: With dead ends: 129 [2023-12-15 21:31:02,321 INFO L226 Difference]: Without dead ends: 64 [2023-12-15 21:31:02,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:31:02,325 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:02,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:31:02,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-12-15 21:31:02,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-12-15 21:31:02,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 54 states have internal predecessors, (76), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-15 21:31:02,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 92 transitions. [2023-12-15 21:31:02,354 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 92 transitions. Word has length 68 [2023-12-15 21:31:02,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:02,354 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 92 transitions. [2023-12-15 21:31:02,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-15 21:31:02,355 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 92 transitions. [2023-12-15 21:31:02,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-15 21:31:02,357 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:02,357 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:02,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:31:02,357 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:02,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:02,358 INFO L85 PathProgramCache]: Analyzing trace with hash -2005151749, now seen corresponding path program 1 times [2023-12-15 21:31:02,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:02,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400158681] [2023-12-15 21:31:02,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:02,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:02,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:02,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:02,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,572 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-15 21:31:02,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:02,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400158681] [2023-12-15 21:31:02,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400158681] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:02,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:02,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:31:02,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772117394] [2023-12-15 21:31:02,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:02,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:31:02,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:02,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:31:02,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:31:02,579 INFO L87 Difference]: Start difference. First operand 64 states and 92 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 21:31:02,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:02,646 INFO L93 Difference]: Finished difference Result 135 states and 194 transitions. [2023-12-15 21:31:02,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:31:02,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2023-12-15 21:31:02,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:02,647 INFO L225 Difference]: With dead ends: 135 [2023-12-15 21:31:02,648 INFO L226 Difference]: Without dead ends: 72 [2023-12-15 21:31:02,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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 21:31:02,649 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 12 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:02,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 252 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:31:02,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-12-15 21:31:02,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2023-12-15 21:31:02,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-15 21:31:02,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 94 transitions. [2023-12-15 21:31:02,657 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 94 transitions. Word has length 68 [2023-12-15 21:31:02,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:02,658 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 94 transitions. [2023-12-15 21:31:02,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 21:31:02,658 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 94 transitions. [2023-12-15 21:31:02,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-15 21:31:02,660 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:02,660 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:02,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:31:02,660 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:02,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:02,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1947893447, now seen corresponding path program 1 times [2023-12-15 21:31:02,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:02,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874613426] [2023-12-15 21:31:02,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:02,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:02,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:02,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:02,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:02,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:02,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:02,825 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-15 21:31:02,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:02,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874613426] [2023-12-15 21:31:02,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874613426] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:02,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:02,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:31:02,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585284279] [2023-12-15 21:31:02,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:02,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:31:02,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:02,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:31:02,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:31:02,829 INFO L87 Difference]: Start difference. First operand 66 states and 94 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 21:31:02,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:02,871 INFO L93 Difference]: Finished difference Result 135 states and 192 transitions. [2023-12-15 21:31:02,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:31:02,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2023-12-15 21:31:02,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:02,872 INFO L225 Difference]: With dead ends: 135 [2023-12-15 21:31:02,873 INFO L226 Difference]: Without dead ends: 70 [2023-12-15 21:31:02,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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 21:31:02,874 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 3 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:02,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 253 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:31:02,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-15 21:31:02,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2023-12-15 21:31:02,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 58 states have internal predecessors, (80), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-15 21:31:02,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2023-12-15 21:31:02,882 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 96 transitions. Word has length 68 [2023-12-15 21:31:02,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:02,883 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 96 transitions. [2023-12-15 21:31:02,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 21:31:02,883 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 96 transitions. [2023-12-15 21:31:02,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-15 21:31:02,884 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:02,884 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:02,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 21:31:02,884 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:02,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:02,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1947833865, now seen corresponding path program 1 times [2023-12-15 21:31:02,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:02,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931362069] [2023-12-15 21:31:02,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:02,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:03,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:03,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:03,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:03,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,100 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-15 21:31:03,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:03,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931362069] [2023-12-15 21:31:03,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931362069] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:03,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:03,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:31:03,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886920316] [2023-12-15 21:31:03,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:03,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:31:03,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:03,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:31:03,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:31:03,103 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 21:31:03,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:03,176 INFO L93 Difference]: Finished difference Result 160 states and 226 transitions. [2023-12-15 21:31:03,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 21:31:03,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2023-12-15 21:31:03,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:03,178 INFO L225 Difference]: With dead ends: 160 [2023-12-15 21:31:03,178 INFO L226 Difference]: Without dead ends: 93 [2023-12-15 21:31:03,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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 21:31:03,186 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 90 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:03,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 224 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:31:03,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-12-15 21:31:03,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 68. [2023-12-15 21:31:03,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 58 states have (on average 1.3620689655172413) internal successors, (79), 58 states have internal predecessors, (79), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-15 21:31:03,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 95 transitions. [2023-12-15 21:31:03,197 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 95 transitions. Word has length 68 [2023-12-15 21:31:03,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:03,198 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 95 transitions. [2023-12-15 21:31:03,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 21:31:03,198 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 95 transitions. [2023-12-15 21:31:03,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-15 21:31:03,199 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:03,199 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:03,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 21:31:03,199 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:03,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:03,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1661631908, now seen corresponding path program 1 times [2023-12-15 21:31:03,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:03,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143236401] [2023-12-15 21:31:03,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:03,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:03,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:03,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,416 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-15 21:31:03,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:03,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143236401] [2023-12-15 21:31:03,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143236401] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:03,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:03,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:31:03,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575078251] [2023-12-15 21:31:03,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:03,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:31:03,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:03,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:31:03,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:31:03,418 INFO L87 Difference]: Start difference. First operand 68 states and 95 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 21:31:03,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:03,548 INFO L93 Difference]: Finished difference Result 228 states and 319 transitions. [2023-12-15 21:31:03,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 21:31:03,549 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 70 [2023-12-15 21:31:03,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:03,551 INFO L225 Difference]: With dead ends: 228 [2023-12-15 21:31:03,551 INFO L226 Difference]: Without dead ends: 161 [2023-12-15 21:31:03,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:31:03,552 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 199 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:03,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 578 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:31:03,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-12-15 21:31:03,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 78. [2023-12-15 21:31:03,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 68 states have internal predecessors, (93), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-15 21:31:03,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 109 transitions. [2023-12-15 21:31:03,567 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 109 transitions. Word has length 70 [2023-12-15 21:31:03,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:03,567 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 109 transitions. [2023-12-15 21:31:03,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 21:31:03,567 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 109 transitions. [2023-12-15 21:31:03,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-15 21:31:03,571 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:03,572 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:03,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 21:31:03,572 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:03,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:03,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1362359734, now seen corresponding path program 1 times [2023-12-15 21:31:03,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:03,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193245831] [2023-12-15 21:31:03,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:03,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:03,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:03,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:03,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:03,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:03,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:03,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:03,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:03,919 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-15 21:31:03,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:03,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193245831] [2023-12-15 21:31:03,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193245831] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:03,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:03,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:31:03,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390008578] [2023-12-15 21:31:03,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:03,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:31:03,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:03,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:31:03,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:31:03,921 INFO L87 Difference]: Start difference. First operand 78 states and 109 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-15 21:31:03,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:03,988 INFO L93 Difference]: Finished difference Result 211 states and 293 transitions. [2023-12-15 21:31:03,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:31:03,988 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 72 [2023-12-15 21:31:03,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:03,990 INFO L225 Difference]: With dead ends: 211 [2023-12-15 21:31:03,990 INFO L226 Difference]: Without dead ends: 134 [2023-12-15 21:31:03,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:31:03,992 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 81 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:03,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 592 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:31:03,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-12-15 21:31:04,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 78. [2023-12-15 21:31:04,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 68 states have internal predecessors, (92), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-15 21:31:04,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 108 transitions. [2023-12-15 21:31:04,005 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 108 transitions. Word has length 72 [2023-12-15 21:31:04,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:04,005 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 108 transitions. [2023-12-15 21:31:04,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-15 21:31:04,006 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 108 transitions. [2023-12-15 21:31:04,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-15 21:31:04,007 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:04,007 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:04,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 21:31:04,008 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:04,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:04,010 INFO L85 PathProgramCache]: Analyzing trace with hash -686157583, now seen corresponding path program 1 times [2023-12-15 21:31:04,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:04,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301395089] [2023-12-15 21:31:04,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:04,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:04,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,129 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-15 21:31:04,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:04,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301395089] [2023-12-15 21:31:04,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301395089] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:04,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:04,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:31:04,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200694017] [2023-12-15 21:31:04,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:04,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:31:04,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:04,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:31:04,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:31:04,131 INFO L87 Difference]: Start difference. First operand 78 states and 108 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 21:31:04,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:04,169 INFO L93 Difference]: Finished difference Result 171 states and 237 transitions. [2023-12-15 21:31:04,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:31:04,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2023-12-15 21:31:04,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:04,170 INFO L225 Difference]: With dead ends: 171 [2023-12-15 21:31:04,170 INFO L226 Difference]: Without dead ends: 94 [2023-12-15 21:31:04,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:31:04,170 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 60 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:04,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 319 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:31:04,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-12-15 21:31:04,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 81. [2023-12-15 21:31:04,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 71 states have internal predecessors, (95), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-15 21:31:04,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 111 transitions. [2023-12-15 21:31:04,174 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 111 transitions. Word has length 72 [2023-12-15 21:31:04,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:04,175 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 111 transitions. [2023-12-15 21:31:04,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 21:31:04,175 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2023-12-15 21:31:04,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-15 21:31:04,176 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:04,176 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:04,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 21:31:04,177 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:04,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:04,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1885600574, now seen corresponding path program 1 times [2023-12-15 21:31:04,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:04,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016623480] [2023-12-15 21:31:04,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:04,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,426 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-15 21:31:04,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:04,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016623480] [2023-12-15 21:31:04,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016623480] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:04,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:04,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:31:04,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912124495] [2023-12-15 21:31:04,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:04,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:31:04,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:04,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:31:04,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:31:04,429 INFO L87 Difference]: Start difference. First operand 81 states and 111 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-15 21:31:04,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:04,487 INFO L93 Difference]: Finished difference Result 192 states and 261 transitions. [2023-12-15 21:31:04,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:31:04,488 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 72 [2023-12-15 21:31:04,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:04,488 INFO L225 Difference]: With dead ends: 192 [2023-12-15 21:31:04,488 INFO L226 Difference]: Without dead ends: 112 [2023-12-15 21:31:04,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:31:04,491 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 73 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:04,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 414 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:31:04,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-12-15 21:31:04,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 81. [2023-12-15 21:31:04,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 71 states have (on average 1.323943661971831) internal successors, (94), 71 states have internal predecessors, (94), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-15 21:31:04,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 110 transitions. [2023-12-15 21:31:04,495 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 110 transitions. Word has length 72 [2023-12-15 21:31:04,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:04,495 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 110 transitions. [2023-12-15 21:31:04,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-15 21:31:04,495 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 110 transitions. [2023-12-15 21:31:04,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-15 21:31:04,497 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:04,497 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:04,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 21:31:04,498 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:04,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:04,498 INFO L85 PathProgramCache]: Analyzing trace with hash 772475292, now seen corresponding path program 1 times [2023-12-15 21:31:04,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:04,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952804992] [2023-12-15 21:31:04,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:04,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:04,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:04,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:04,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:04,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:04,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,841 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-15 21:31:04,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:04,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952804992] [2023-12-15 21:31:04,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952804992] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:31:04,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215569450] [2023-12-15 21:31:04,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:04,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:31:04,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:31:04,848 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:31:04,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 21:31:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:04,978 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-15 21:31:04,986 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:31:05,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 53 [2023-12-15 21:31:05,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:31:05,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 42 [2023-12-15 21:31:05,374 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-15 21:31:05,374 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:31:05,570 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-15 21:31:05,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215569450] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-15 21:31:05,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-15 21:31:05,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 11] total 19 [2023-12-15 21:31:05,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895388413] [2023-12-15 21:31:05,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:05,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 21:31:05,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:05,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 21:31:05,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2023-12-15 21:31:05,572 INFO L87 Difference]: Start difference. First operand 81 states and 110 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 21:31:05,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:05,953 INFO L93 Difference]: Finished difference Result 243 states and 326 transitions. [2023-12-15 21:31:05,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-15 21:31:05,953 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 74 [2023-12-15 21:31:05,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:05,954 INFO L225 Difference]: With dead ends: 243 [2023-12-15 21:31:05,954 INFO L226 Difference]: Without dead ends: 163 [2023-12-15 21:31:05,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 154 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2023-12-15 21:31:05,955 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 222 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:05,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 830 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:31:05,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-12-15 21:31:05,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 134. [2023-12-15 21:31:05,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 121 states have (on average 1.3140495867768596) internal successors, (159), 122 states have internal predecessors, (159), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-15 21:31:05,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 179 transitions. [2023-12-15 21:31:05,960 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 179 transitions. Word has length 74 [2023-12-15 21:31:05,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:05,960 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 179 transitions. [2023-12-15 21:31:05,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 21:31:05,960 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 179 transitions. [2023-12-15 21:31:05,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-15 21:31:05,961 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:05,961 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:05,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-15 21:31:06,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:31:06,167 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:06,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:06,167 INFO L85 PathProgramCache]: Analyzing trace with hash -238641958, now seen corresponding path program 1 times [2023-12-15 21:31:06,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:06,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207586508] [2023-12-15 21:31:06,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:06,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:06,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:06,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:06,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:06,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:06,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:06,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:06,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:06,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:06,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:06,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:06,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:06,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:06,356 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-15 21:31:06,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:06,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207586508] [2023-12-15 21:31:06,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207586508] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:06,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:06,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:31:06,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511198420] [2023-12-15 21:31:06,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:06,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:31:06,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:06,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:31:06,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:31:06,357 INFO L87 Difference]: Start difference. First operand 134 states and 179 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 21:31:06,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:06,439 INFO L93 Difference]: Finished difference Result 304 states and 403 transitions. [2023-12-15 21:31:06,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:31:06,439 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 74 [2023-12-15 21:31:06,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:06,442 INFO L225 Difference]: With dead ends: 304 [2023-12-15 21:31:06,442 INFO L226 Difference]: Without dead ends: 171 [2023-12-15 21:31:06,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:31:06,443 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 100 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:06,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 450 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:31:06,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-12-15 21:31:06,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 130. [2023-12-15 21:31:06,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 117 states have (on average 1.3076923076923077) internal successors, (153), 118 states have internal predecessors, (153), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-15 21:31:06,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 173 transitions. [2023-12-15 21:31:06,450 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 173 transitions. Word has length 74 [2023-12-15 21:31:06,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:06,450 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 173 transitions. [2023-12-15 21:31:06,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 21:31:06,450 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 173 transitions. [2023-12-15 21:31:06,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-15 21:31:06,451 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:06,451 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:06,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 21:31:06,451 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:06,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:06,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1195177118, now seen corresponding path program 1 times [2023-12-15 21:31:06,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:06,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979806566] [2023-12-15 21:31:06,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:06,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:06,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:06,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:06,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:06,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:06,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:06,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:06,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:06,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:06,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:06,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:06,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:06,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:06,712 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-15 21:31:06,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:06,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979806566] [2023-12-15 21:31:06,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979806566] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:06,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:06,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 21:31:06,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248196169] [2023-12-15 21:31:06,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:06,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 21:31:06,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:06,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 21:31:06,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:31:06,714 INFO L87 Difference]: Start difference. First operand 130 states and 173 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-15 21:31:06,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:06,800 INFO L93 Difference]: Finished difference Result 298 states and 394 transitions. [2023-12-15 21:31:06,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:31:06,800 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2023-12-15 21:31:06,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:06,802 INFO L225 Difference]: With dead ends: 298 [2023-12-15 21:31:06,802 INFO L226 Difference]: Without dead ends: 169 [2023-12-15 21:31:06,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:31:06,803 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 88 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:06,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 500 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:31:06,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2023-12-15 21:31:06,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 130. [2023-12-15 21:31:06,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 117 states have (on average 1.2991452991452992) internal successors, (152), 118 states have internal predecessors, (152), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-15 21:31:06,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 172 transitions. [2023-12-15 21:31:06,809 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 172 transitions. Word has length 74 [2023-12-15 21:31:06,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:06,810 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 172 transitions. [2023-12-15 21:31:06,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-15 21:31:06,810 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 172 transitions. [2023-12-15 21:31:06,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-15 21:31:06,810 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:06,810 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:06,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-15 21:31:06,810 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:06,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:06,811 INFO L85 PathProgramCache]: Analyzing trace with hash 184059868, now seen corresponding path program 1 times [2023-12-15 21:31:06,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:06,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579098341] [2023-12-15 21:31:06,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:06,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:06,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:07,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:07,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:07,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:07,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:07,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:07,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:07,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:07,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:07,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:07,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:07,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:07,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:07,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:07,284 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-15 21:31:07,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:07,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579098341] [2023-12-15 21:31:07,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579098341] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:31:07,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134652009] [2023-12-15 21:31:07,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:07,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:31:07,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:31:07,286 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:31:07,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-15 21:31:07,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:07,397 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-15 21:31:07,402 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:31:07,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 45 [2023-12-15 21:31:07,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:31:07,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 32 [2023-12-15 21:31:07,625 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-15 21:31:07,625 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:31:07,792 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-15 21:31:07,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134652009] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-15 21:31:07,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-15 21:31:07,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 11] total 21 [2023-12-15 21:31:07,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117617919] [2023-12-15 21:31:07,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:07,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 21:31:07,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:07,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 21:31:07,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2023-12-15 21:31:07,824 INFO L87 Difference]: Start difference. First operand 130 states and 172 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 21:31:08,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:08,127 INFO L93 Difference]: Finished difference Result 298 states and 392 transitions. [2023-12-15 21:31:08,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 21:31:08,128 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 74 [2023-12-15 21:31:08,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:08,128 INFO L225 Difference]: With dead ends: 298 [2023-12-15 21:31:08,129 INFO L226 Difference]: Without dead ends: 169 [2023-12-15 21:31:08,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 155 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2023-12-15 21:31:08,129 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 187 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:08,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 773 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:31:08,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2023-12-15 21:31:08,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 126. [2023-12-15 21:31:08,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 113 states have (on average 1.3008849557522124) internal successors, (147), 114 states have internal predecessors, (147), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-15 21:31:08,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 167 transitions. [2023-12-15 21:31:08,135 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 167 transitions. Word has length 74 [2023-12-15 21:31:08,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:08,135 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 167 transitions. [2023-12-15 21:31:08,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 21:31:08,136 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 167 transitions. [2023-12-15 21:31:08,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-15 21:31:08,136 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:08,136 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:08,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-15 21:31:08,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-15 21:31:08,341 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:08,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:08,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1960346621, now seen corresponding path program 1 times [2023-12-15 21:31:08,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:08,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838949906] [2023-12-15 21:31:08,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:08,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:08,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:08,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:08,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:08,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:08,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:08,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:08,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:08,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:08,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:08,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:08,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:08,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:08,446 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-15 21:31:08,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:08,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838949906] [2023-12-15 21:31:08,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838949906] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:08,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:08,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:31:08,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571844896] [2023-12-15 21:31:08,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:08,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:31:08,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:08,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:31:08,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:31:08,448 INFO L87 Difference]: Start difference. First operand 126 states and 167 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 21:31:08,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:08,503 INFO L93 Difference]: Finished difference Result 311 states and 415 transitions. [2023-12-15 21:31:08,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 21:31:08,503 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 74 [2023-12-15 21:31:08,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:08,504 INFO L225 Difference]: With dead ends: 311 [2023-12-15 21:31:08,504 INFO L226 Difference]: Without dead ends: 186 [2023-12-15 21:31:08,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-15 21:31:08,505 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 80 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:08,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 406 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:31:08,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-12-15 21:31:08,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 128. [2023-12-15 21:31:08,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 115 states have (on average 1.2956521739130435) internal successors, (149), 116 states have internal predecessors, (149), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-15 21:31:08,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 169 transitions. [2023-12-15 21:31:08,512 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 169 transitions. Word has length 74 [2023-12-15 21:31:08,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:08,512 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 169 transitions. [2023-12-15 21:31:08,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 21:31:08,512 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 169 transitions. [2023-12-15 21:31:08,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-15 21:31:08,512 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:08,513 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:08,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-15 21:31:08,513 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:08,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:08,513 INFO L85 PathProgramCache]: Analyzing trace with hash -513931126, now seen corresponding path program 1 times [2023-12-15 21:31:08,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:08,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407164513] [2023-12-15 21:31:08,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:08,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:08,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:08,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:08,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:08,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:08,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:08,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:08,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:08,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:08,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:08,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:08,927 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-15 21:31:08,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:08,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407164513] [2023-12-15 21:31:08,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407164513] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:31:08,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634138992] [2023-12-15 21:31:08,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:08,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:31:08,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:31:08,929 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:31:08,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-15 21:31:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:09,042 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-15 21:31:09,050 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:31:09,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-15 21:31:09,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:31:09,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 59 [2023-12-15 21:31:09,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:31:09,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 74 [2023-12-15 21:31:09,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 55 [2023-12-15 21:31:09,439 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-15 21:31:09,440 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:31:09,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634138992] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:09,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 21:31:09,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2023-12-15 21:31:09,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440551474] [2023-12-15 21:31:09,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:09,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 21:31:09,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:09,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 21:31:09,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2023-12-15 21:31:09,441 INFO L87 Difference]: Start difference. First operand 128 states and 169 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 21:31:09,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:09,695 INFO L93 Difference]: Finished difference Result 202 states and 262 transitions. [2023-12-15 21:31:09,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 21:31:09,695 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 74 [2023-12-15 21:31:09,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:09,696 INFO L225 Difference]: With dead ends: 202 [2023-12-15 21:31:09,696 INFO L226 Difference]: Without dead ends: 200 [2023-12-15 21:31:09,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2023-12-15 21:31:09,697 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 130 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:09,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 502 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:31:09,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-12-15 21:31:09,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 160. [2023-12-15 21:31:09,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 136 states have (on average 1.25) internal successors, (170), 138 states have internal predecessors, (170), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-15 21:31:09,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 206 transitions. [2023-12-15 21:31:09,706 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 206 transitions. Word has length 74 [2023-12-15 21:31:09,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:09,706 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 206 transitions. [2023-12-15 21:31:09,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 21:31:09,707 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 206 transitions. [2023-12-15 21:31:09,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-15 21:31:09,707 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:09,707 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:09,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-15 21:31:09,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:31:09,913 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:09,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:09,913 INFO L85 PathProgramCache]: Analyzing trace with hash -513871544, now seen corresponding path program 1 times [2023-12-15 21:31:09,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:09,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826533285] [2023-12-15 21:31:09,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:09,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:10,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:10,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,013 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-15 21:31:10,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:10,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826533285] [2023-12-15 21:31:10,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826533285] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:10,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:10,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:31:10,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930899012] [2023-12-15 21:31:10,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:10,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:31:10,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:10,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:31:10,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:31:10,039 INFO L87 Difference]: Start difference. First operand 160 states and 206 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 21:31:10,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:10,087 INFO L93 Difference]: Finished difference Result 295 states and 381 transitions. [2023-12-15 21:31:10,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:31:10,087 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 74 [2023-12-15 21:31:10,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:10,089 INFO L225 Difference]: With dead ends: 295 [2023-12-15 21:31:10,089 INFO L226 Difference]: Without dead ends: 160 [2023-12-15 21:31:10,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:31:10,090 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 53 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:10,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 302 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:31:10,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-12-15 21:31:10,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2023-12-15 21:31:10,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 136 states have (on average 1.2352941176470589) internal successors, (168), 138 states have internal predecessors, (168), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-15 21:31:10,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 204 transitions. [2023-12-15 21:31:10,100 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 204 transitions. Word has length 74 [2023-12-15 21:31:10,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:10,101 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 204 transitions. [2023-12-15 21:31:10,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 21:31:10,101 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 204 transitions. [2023-12-15 21:31:10,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-15 21:31:10,102 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:10,102 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:10,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-15 21:31:10,102 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:10,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:10,102 INFO L85 PathProgramCache]: Analyzing trace with hash -456613242, now seen corresponding path program 1 times [2023-12-15 21:31:10,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:10,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044826012] [2023-12-15 21:31:10,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:10,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:10,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:10,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:10,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:10,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,396 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-15 21:31:10,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:10,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044826012] [2023-12-15 21:31:10,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044826012] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:10,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:10,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 21:31:10,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667641975] [2023-12-15 21:31:10,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:10,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 21:31:10,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:10,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 21:31:10,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:31:10,398 INFO L87 Difference]: Start difference. First operand 160 states and 204 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 21:31:10,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:10,515 INFO L93 Difference]: Finished difference Result 408 states and 520 transitions. [2023-12-15 21:31:10,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:31:10,516 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 74 [2023-12-15 21:31:10,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:10,517 INFO L225 Difference]: With dead ends: 408 [2023-12-15 21:31:10,517 INFO L226 Difference]: Without dead ends: 273 [2023-12-15 21:31:10,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:31:10,517 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 71 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:10,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 377 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:31:10,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2023-12-15 21:31:10,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 227. [2023-12-15 21:31:10,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 203 states have (on average 1.2610837438423645) internal successors, (256), 205 states have internal predecessors, (256), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-15 21:31:10,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 292 transitions. [2023-12-15 21:31:10,533 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 292 transitions. Word has length 74 [2023-12-15 21:31:10,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:10,533 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 292 transitions. [2023-12-15 21:31:10,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 21:31:10,533 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 292 transitions. [2023-12-15 21:31:10,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-15 21:31:10,534 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:10,534 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:10,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-15 21:31:10,534 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:10,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:10,535 INFO L85 PathProgramCache]: Analyzing trace with hash -445694648, now seen corresponding path program 1 times [2023-12-15 21:31:10,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:10,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110839395] [2023-12-15 21:31:10,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:10,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:10,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:10,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:10,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,625 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-15 21:31:10,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:10,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110839395] [2023-12-15 21:31:10,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110839395] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:10,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:10,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:31:10,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081001865] [2023-12-15 21:31:10,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:10,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:31:10,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:10,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:31:10,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:31:10,626 INFO L87 Difference]: Start difference. First operand 227 states and 292 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 21:31:10,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:10,709 INFO L93 Difference]: Finished difference Result 590 states and 741 transitions. [2023-12-15 21:31:10,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:31:10,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 76 [2023-12-15 21:31:10,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:10,711 INFO L225 Difference]: With dead ends: 590 [2023-12-15 21:31:10,711 INFO L226 Difference]: Without dead ends: 388 [2023-12-15 21:31:10,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:31:10,712 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 75 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:10,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 270 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:31:10,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2023-12-15 21:31:10,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 259. [2023-12-15 21:31:10,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 235 states have (on average 1.225531914893617) internal successors, (288), 237 states have internal predecessors, (288), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-15 21:31:10,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 324 transitions. [2023-12-15 21:31:10,745 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 324 transitions. Word has length 76 [2023-12-15 21:31:10,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:10,747 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 324 transitions. [2023-12-15 21:31:10,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 21:31:10,747 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 324 transitions. [2023-12-15 21:31:10,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-15 21:31:10,748 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:10,748 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:10,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-15 21:31:10,748 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:10,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:10,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1821417921, now seen corresponding path program 1 times [2023-12-15 21:31:10,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:10,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767139855] [2023-12-15 21:31:10,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:10,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:10,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:10,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:10,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:10,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:10,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:10,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:10,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:10,912 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-15 21:31:10,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:10,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767139855] [2023-12-15 21:31:10,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767139855] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:10,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:10,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:31:10,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768049454] [2023-12-15 21:31:10,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:10,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:31:10,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:10,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:31:10,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:31:10,913 INFO L87 Difference]: Start difference. First operand 259 states and 324 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 21:31:11,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:11,021 INFO L93 Difference]: Finished difference Result 620 states and 768 transitions. [2023-12-15 21:31:11,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:31:11,022 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 76 [2023-12-15 21:31:11,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:11,023 INFO L225 Difference]: With dead ends: 620 [2023-12-15 21:31:11,023 INFO L226 Difference]: Without dead ends: 386 [2023-12-15 21:31:11,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:31:11,024 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 76 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:11,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 312 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:31:11,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2023-12-15 21:31:11,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 336. [2023-12-15 21:31:11,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 312 states have (on average 1.2307692307692308) internal successors, (384), 314 states have internal predecessors, (384), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-15 21:31:11,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 420 transitions. [2023-12-15 21:31:11,035 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 420 transitions. Word has length 76 [2023-12-15 21:31:11,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:11,035 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 420 transitions. [2023-12-15 21:31:11,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 21:31:11,035 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 420 transitions. [2023-12-15 21:31:11,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-15 21:31:11,036 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:11,036 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:11,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-15 21:31:11,036 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:11,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:11,036 INFO L85 PathProgramCache]: Analyzing trace with hash -2058710480, now seen corresponding path program 1 times [2023-12-15 21:31:11,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:11,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813496422] [2023-12-15 21:31:11,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:11,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:11,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:11,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,122 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-15 21:31:11,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:11,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813496422] [2023-12-15 21:31:11,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813496422] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:11,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:11,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:31:11,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587772224] [2023-12-15 21:31:11,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:11,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:31:11,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:11,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:31:11,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:31:11,124 INFO L87 Difference]: Start difference. First operand 336 states and 420 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 21:31:11,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:11,171 INFO L93 Difference]: Finished difference Result 569 states and 709 transitions. [2023-12-15 21:31:11,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 21:31:11,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 76 [2023-12-15 21:31:11,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:11,172 INFO L225 Difference]: With dead ends: 569 [2023-12-15 21:31:11,172 INFO L226 Difference]: Without dead ends: 258 [2023-12-15 21:31:11,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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 21:31:11,173 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 13 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:11,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 194 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:31:11,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2023-12-15 21:31:11,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2023-12-15 21:31:11,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 234 states have (on average 1.2094017094017093) internal successors, (283), 236 states have internal predecessors, (283), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-15 21:31:11,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 319 transitions. [2023-12-15 21:31:11,182 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 319 transitions. Word has length 76 [2023-12-15 21:31:11,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:11,182 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 319 transitions. [2023-12-15 21:31:11,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 21:31:11,182 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 319 transitions. [2023-12-15 21:31:11,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-15 21:31:11,183 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:11,183 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:11,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-15 21:31:11,183 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:11,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:11,184 INFO L85 PathProgramCache]: Analyzing trace with hash 561566617, now seen corresponding path program 1 times [2023-12-15 21:31:11,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:11,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472560756] [2023-12-15 21:31:11,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:11,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:11,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:11,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,310 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-15 21:31:11,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:11,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472560756] [2023-12-15 21:31:11,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472560756] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:11,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:11,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:31:11,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538218705] [2023-12-15 21:31:11,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:11,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:31:11,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:11,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:31:11,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:31:11,312 INFO L87 Difference]: Start difference. First operand 258 states and 319 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-15 21:31:11,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:11,380 INFO L93 Difference]: Finished difference Result 529 states and 649 transitions. [2023-12-15 21:31:11,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:31:11,381 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 77 [2023-12-15 21:31:11,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:11,382 INFO L225 Difference]: With dead ends: 529 [2023-12-15 21:31:11,382 INFO L226 Difference]: Without dead ends: 296 [2023-12-15 21:31:11,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:31:11,382 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 43 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:11,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 364 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:31:11,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2023-12-15 21:31:11,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 258. [2023-12-15 21:31:11,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 234 states have (on average 1.2008547008547008) internal successors, (281), 236 states have internal predecessors, (281), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-15 21:31:11,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 317 transitions. [2023-12-15 21:31:11,394 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 317 transitions. Word has length 77 [2023-12-15 21:31:11,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:11,394 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 317 transitions. [2023-12-15 21:31:11,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-15 21:31:11,394 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 317 transitions. [2023-12-15 21:31:11,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-15 21:31:11,395 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:11,395 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:11,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-15 21:31:11,395 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:11,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:11,396 INFO L85 PathProgramCache]: Analyzing trace with hash -39398829, now seen corresponding path program 1 times [2023-12-15 21:31:11,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:11,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845460420] [2023-12-15 21:31:11,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:11,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:11,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:11,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:11,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,657 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-15 21:31:11,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:11,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845460420] [2023-12-15 21:31:11,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845460420] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:31:11,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487060249] [2023-12-15 21:31:11,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:11,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:31:11,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:31:11,658 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:31:11,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-15 21:31:11,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:11,777 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-15 21:31:11,779 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:31:11,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-15 21:31:11,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-15 21:31:11,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-15 21:31:12,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-15 21:31:12,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-15 21:31:12,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-15 21:31:12,029 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 81 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-15 21:31:12,029 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:31:12,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-15 21:31:12,160 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-15 21:31:12,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487060249] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:31:12,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:31:12,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2023-12-15 21:31:12,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648517981] [2023-12-15 21:31:12,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:31:12,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-15 21:31:12,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:12,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-15 21:31:12,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2023-12-15 21:31:12,162 INFO L87 Difference]: Start difference. First operand 258 states and 317 transitions. Second operand has 21 states, 18 states have (on average 4.833333333333333) internal successors, (87), 21 states have internal predecessors, (87), 11 states have call successors, (22), 4 states have call predecessors, (22), 7 states have return successors, (22), 8 states have call predecessors, (22), 11 states have call successors, (22) [2023-12-15 21:31:12,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:12,406 INFO L93 Difference]: Finished difference Result 477 states and 587 transitions. [2023-12-15 21:31:12,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 21:31:12,407 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 4.833333333333333) internal successors, (87), 21 states have internal predecessors, (87), 11 states have call successors, (22), 4 states have call predecessors, (22), 7 states have return successors, (22), 8 states have call predecessors, (22), 11 states have call successors, (22) Word has length 77 [2023-12-15 21:31:12,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:12,408 INFO L225 Difference]: With dead ends: 477 [2023-12-15 21:31:12,408 INFO L226 Difference]: Without dead ends: 244 [2023-12-15 21:31:12,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2023-12-15 21:31:12,409 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 122 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:12,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 257 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:31:12,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2023-12-15 21:31:12,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 234. [2023-12-15 21:31:12,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 208 states have (on average 1.1971153846153846) internal successors, (249), 210 states have internal predecessors, (249), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-15 21:31:12,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 285 transitions. [2023-12-15 21:31:12,418 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 285 transitions. Word has length 77 [2023-12-15 21:31:12,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:12,419 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 285 transitions. [2023-12-15 21:31:12,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 4.833333333333333) internal successors, (87), 21 states have internal predecessors, (87), 11 states have call successors, (22), 4 states have call predecessors, (22), 7 states have return successors, (22), 8 states have call predecessors, (22), 11 states have call successors, (22) [2023-12-15 21:31:12,419 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 285 transitions. [2023-12-15 21:31:12,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-15 21:31:12,419 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:12,419 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:12,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-15 21:31:12,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:31:12,624 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:12,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:12,625 INFO L85 PathProgramCache]: Analyzing trace with hash -2094073389, now seen corresponding path program 1 times [2023-12-15 21:31:12,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:12,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317545597] [2023-12-15 21:31:12,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:12,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:12,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:12,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:12,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:12,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:12,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:12,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:12,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:12,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:12,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:12,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:12,847 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-15 21:31:12,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:12,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317545597] [2023-12-15 21:31:12,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317545597] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:12,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:12,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 21:31:12,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164500725] [2023-12-15 21:31:12,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:12,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:31:12,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:12,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:31:12,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:31:12,849 INFO L87 Difference]: Start difference. First operand 234 states and 285 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 21:31:13,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:13,094 INFO L93 Difference]: Finished difference Result 828 states and 997 transitions. [2023-12-15 21:31:13,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-15 21:31:13,094 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 78 [2023-12-15 21:31:13,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:13,096 INFO L225 Difference]: With dead ends: 828 [2023-12-15 21:31:13,096 INFO L226 Difference]: Without dead ends: 623 [2023-12-15 21:31:13,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=202, Invalid=500, Unknown=0, NotChecked=0, Total=702 [2023-12-15 21:31:13,097 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 245 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:13,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 603 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:31:13,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2023-12-15 21:31:13,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 384. [2023-12-15 21:31:13,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 345 states have (on average 1.182608695652174) internal successors, (408), 349 states have internal predecessors, (408), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-15 21:31:13,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 460 transitions. [2023-12-15 21:31:13,113 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 460 transitions. Word has length 78 [2023-12-15 21:31:13,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:13,113 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 460 transitions. [2023-12-15 21:31:13,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 21:31:13,113 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 460 transitions. [2023-12-15 21:31:13,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-15 21:31:13,114 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:13,114 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:13,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-15 21:31:13,114 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:13,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:13,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1875218671, now seen corresponding path program 1 times [2023-12-15 21:31:13,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:13,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340287937] [2023-12-15 21:31:13,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:13,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:13,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:13,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:13,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:13,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:13,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,167 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-15 21:31:13,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:13,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340287937] [2023-12-15 21:31:13,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340287937] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:13,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:13,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:31:13,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368938164] [2023-12-15 21:31:13,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:13,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:31:13,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:13,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:31:13,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:31:13,168 INFO L87 Difference]: Start difference. First operand 384 states and 460 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 21:31:13,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:13,250 INFO L93 Difference]: Finished difference Result 933 states and 1109 transitions. [2023-12-15 21:31:13,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:31:13,251 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 78 [2023-12-15 21:31:13,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:13,252 INFO L225 Difference]: With dead ends: 933 [2023-12-15 21:31:13,253 INFO L226 Difference]: Without dead ends: 582 [2023-12-15 21:31:13,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:31:13,253 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 62 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:13,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 472 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:31:13,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2023-12-15 21:31:13,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 355. [2023-12-15 21:31:13,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 318 states have (on average 1.169811320754717) internal successors, (372), 321 states have internal predecessors, (372), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-15 21:31:13,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 420 transitions. [2023-12-15 21:31:13,268 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 420 transitions. Word has length 78 [2023-12-15 21:31:13,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:13,269 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 420 transitions. [2023-12-15 21:31:13,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 21:31:13,269 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 420 transitions. [2023-12-15 21:31:13,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-15 21:31:13,269 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:13,270 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:13,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-15 21:31:13,270 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:13,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:13,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1365462434, now seen corresponding path program 1 times [2023-12-15 21:31:13,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:13,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679152019] [2023-12-15 21:31:13,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:13,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:13,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:13,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:13,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:13,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:13,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,348 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-15 21:31:13,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:13,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679152019] [2023-12-15 21:31:13,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679152019] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:13,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:13,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:31:13,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401521992] [2023-12-15 21:31:13,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:13,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:31:13,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:13,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:31:13,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:31:13,350 INFO L87 Difference]: Start difference. First operand 355 states and 420 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 21:31:13,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:13,412 INFO L93 Difference]: Finished difference Result 681 states and 806 transitions. [2023-12-15 21:31:13,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:31:13,413 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 79 [2023-12-15 21:31:13,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:13,414 INFO L225 Difference]: With dead ends: 681 [2023-12-15 21:31:13,414 INFO L226 Difference]: Without dead ends: 359 [2023-12-15 21:31:13,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:31:13,415 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 73 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:13,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 170 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:31:13,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2023-12-15 21:31:13,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 308. [2023-12-15 21:31:13,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 273 states have (on average 1.1355311355311355) internal successors, (310), 275 states have internal predecessors, (310), 22 states have call successors, (22), 12 states have call predecessors, (22), 12 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-15 21:31:13,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 354 transitions. [2023-12-15 21:31:13,429 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 354 transitions. Word has length 79 [2023-12-15 21:31:13,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:13,429 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 354 transitions. [2023-12-15 21:31:13,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-15 21:31:13,429 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 354 transitions. [2023-12-15 21:31:13,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-12-15 21:31:13,430 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:13,430 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:13,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-15 21:31:13,430 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:13,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:13,431 INFO L85 PathProgramCache]: Analyzing trace with hash 847893285, now seen corresponding path program 1 times [2023-12-15 21:31:13,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:13,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933905019] [2023-12-15 21:31:13,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:13,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:13,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:13,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:13,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,601 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-15 21:31:13,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:13,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933905019] [2023-12-15 21:31:13,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933905019] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:13,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:13,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:31:13,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236190446] [2023-12-15 21:31:13,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:13,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:31:13,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:13,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:31:13,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:31:13,603 INFO L87 Difference]: Start difference. First operand 308 states and 354 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-15 21:31:13,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:13,667 INFO L93 Difference]: Finished difference Result 703 states and 808 transitions. [2023-12-15 21:31:13,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:31:13,668 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 81 [2023-12-15 21:31:13,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:13,669 INFO L225 Difference]: With dead ends: 703 [2023-12-15 21:31:13,669 INFO L226 Difference]: Without dead ends: 428 [2023-12-15 21:31:13,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:31:13,670 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 81 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:13,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 353 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:31:13,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2023-12-15 21:31:13,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 286. [2023-12-15 21:31:13,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 251 states have (on average 1.1235059760956174) internal successors, (282), 253 states have internal predecessors, (282), 22 states have call successors, (22), 12 states have call predecessors, (22), 12 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-15 21:31:13,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 326 transitions. [2023-12-15 21:31:13,685 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 326 transitions. Word has length 81 [2023-12-15 21:31:13,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:13,685 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 326 transitions. [2023-12-15 21:31:13,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-15 21:31:13,685 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 326 transitions. [2023-12-15 21:31:13,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-12-15 21:31:13,686 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:13,686 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:13,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-15 21:31:13,686 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:13,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:13,686 INFO L85 PathProgramCache]: Analyzing trace with hash 641241392, now seen corresponding path program 1 times [2023-12-15 21:31:13,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:13,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130952435] [2023-12-15 21:31:13,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:13,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:13,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:31:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:31:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:31:13,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:31:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:31:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:31:13,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:31:13,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:31:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:31:13,820 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-15 21:31:13,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:31:13,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130952435] [2023-12-15 21:31:13,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130952435] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:31:13,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:31:13,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:31:13,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759700683] [2023-12-15 21:31:13,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:31:13,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:31:13,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:31:13,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:31:13,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:31:13,824 INFO L87 Difference]: Start difference. First operand 286 states and 326 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-15 21:31:13,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:31:13,879 INFO L93 Difference]: Finished difference Result 601 states and 686 transitions. [2023-12-15 21:31:13,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:31:13,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 81 [2023-12-15 21:31:13,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:31:13,880 INFO L225 Difference]: With dead ends: 601 [2023-12-15 21:31:13,880 INFO L226 Difference]: Without dead ends: 348 [2023-12-15 21:31:13,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:31:13,883 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 53 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:31:13,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 343 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:31:13,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2023-12-15 21:31:13,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 286. [2023-12-15 21:31:13,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 251 states have (on average 1.1075697211155378) internal successors, (278), 253 states have internal predecessors, (278), 22 states have call successors, (22), 12 states have call predecessors, (22), 12 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-15 21:31:13,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 322 transitions. [2023-12-15 21:31:13,896 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 322 transitions. Word has length 81 [2023-12-15 21:31:13,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:31:13,896 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 322 transitions. [2023-12-15 21:31:13,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-15 21:31:13,896 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 322 transitions. [2023-12-15 21:31:13,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-12-15 21:31:13,897 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:31:13,897 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:31:13,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-15 21:31:13,897 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:31:13,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:31:13,898 INFO L85 PathProgramCache]: Analyzing trace with hash -10337099, now seen corresponding path program 1 times [2023-12-15 21:31:13,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:31:13,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065325409] [2023-12-15 21:31:13,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:31:13,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:31:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2023-12-15 21:31:58,651 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-15 21:31:58,653 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 21:31:58,702 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-15 21:31:58,719 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-15 21:31:58,734 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-15 21:31:58,750 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-15 21:31:58,766 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-15 21:31:58,781 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-15 21:31:58,797 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-15 21:31:58,815 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-15 21:31:58,831 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-15 21:31:58,846 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-15 21:31:58,861 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-15 21:31:58,875 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-15 21:31:58,890 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-15 21:31:58,905 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-15 21:31:58,912 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-15 21:31:58,913 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-15 21:31:58,913 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-15 21:31:58,913 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-15 21:31:58,913 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-15 21:31:58,913 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-15 21:31:58,913 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-15 21:31:58,913 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-15 21:31:58,914 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-15 21:31:58,914 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-15 21:31:58,916 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 21:31:58,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-15 21:31:58,916 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 84 with TraceHistMax 8,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 82 interpolants. [2023-12-15 21:31:58,919 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, 1, 1, 1, 1, 1, 1] [2023-12-15 21:31:58,921 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:31:58,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:31:58 BoogieIcfgContainer [2023-12-15 21:31:58,922 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:31:58,922 INFO L158 Benchmark]: Toolchain (without parser) took 57840.15ms. Allocated memory was 226.5MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 168.8MB in the beginning and 1.1GB in the end (delta: -925.2MB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2023-12-15 21:31:58,923 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 226.5MB. Free memory is still 176.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:31:58,923 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.59ms. Allocated memory is still 226.5MB. Free memory was 168.8MB in the beginning and 155.1MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-15 21:31:58,923 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.65ms. Allocated memory is still 226.5MB. Free memory was 155.1MB in the beginning and 152.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 21:31:58,923 INFO L158 Benchmark]: Boogie Preprocessor took 48.21ms. Allocated memory is still 226.5MB. Free memory was 152.0MB in the beginning and 148.2MB in the end (delta: 3.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 21:31:58,923 INFO L158 Benchmark]: RCFGBuilder took 520.77ms. Allocated memory was 226.5MB in the beginning and 272.6MB in the end (delta: 46.1MB). Free memory was 148.2MB in the beginning and 223.1MB in the end (delta: -74.9MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-15 21:31:58,923 INFO L158 Benchmark]: TraceAbstraction took 57031.54ms. Allocated memory was 272.6MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 222.6MB in the beginning and 1.1GB in the end (delta: -871.4MB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2023-12-15 21:31:58,924 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 226.5MB. Free memory is still 176.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 189.59ms. Allocated memory is still 226.5MB. Free memory was 168.8MB in the beginning and 155.1MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.65ms. Allocated memory is still 226.5MB. Free memory was 155.1MB in the beginning and 152.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.21ms. Allocated memory is still 226.5MB. Free memory was 152.0MB in the beginning and 148.2MB in the end (delta: 3.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 520.77ms. Allocated memory was 226.5MB in the beginning and 272.6MB in the end (delta: 46.1MB). Free memory was 148.2MB in the beginning and 223.1MB in the end (delta: -74.9MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 57031.54ms. Allocated memory was 272.6MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 222.6MB in the beginning and 1.1GB in the end (delta: -871.4MB). Peak memory consumption was 1.0GB. 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: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was analyzing trace of length 84 with TraceHistMax 8,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 82 interpolants. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 57.0s, OverallIterations: 27, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2303 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2292 mSDsluCounter, 10198 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7682 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2760 IncrementalHoareTripleChecker+Invalid, 2839 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 2516 mSDtfsCounter, 2760 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1206 GetRequests, 981 SyntacticMatches, 3 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=384occurred in iteration=22, InterpolantAutomatonStates: 201, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 26 MinimizatonAttempts, 1460 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 2228 NumberOfCodeBlocks, 2228 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2420 ConstructedInterpolants, 0 QuantifiedInterpolants, 9180 SizeOfPredicates, 49 NumberOfNonLiveVariables, 1166 ConjunctsInSsa, 107 ConjunctsInUnsatCore, 33 InterpolantComputations, 25 PerfectInterpolantSequences, 3600/3696 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