/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-sp_file-90.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:47:07,173 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:47:07,215 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:47:07,218 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:47:07,218 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:47:07,231 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:47:07,232 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:47:07,232 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:47:07,232 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:47:07,233 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:47:07,233 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:47:07,233 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:47:07,233 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:47:07,234 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:47:07,234 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:47:07,234 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:47:07,234 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:47:07,235 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:47:07,235 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:47:07,235 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:47:07,235 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:47:07,239 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:47:07,239 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:47:07,240 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:47:07,240 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:47:07,240 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:47:07,240 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:47:07,240 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:47:07,241 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:47:07,241 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:47:07,241 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:47:07,241 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:47:07,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:47:07,242 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:47:07,242 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:47:07,242 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:47:07,243 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:47:07,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:47:07,243 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:47:07,243 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:47:07,243 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:47:07,248 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:47:07,248 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:47:07,248 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:47:07,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:47:07,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:47:07,471 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:47:07,472 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:47:07,472 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:47:07,473 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-90.i [2023-12-15 21:47:08,429 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:47:08,612 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:47:08,613 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-90.i [2023-12-15 21:47:08,618 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d85cf112/7d9eb53681f642829119f91ccf481b69/FLAG9e2ee8a5a [2023-12-15 21:47:08,634 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d85cf112/7d9eb53681f642829119f91ccf481b69 [2023-12-15 21:47:08,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:47:08,638 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:47:08,641 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:47:08,641 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:47:08,644 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:47:08,645 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:47:08" (1/1) ... [2023-12-15 21:47:08,646 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d181c40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:47:08, skipping insertion in model container [2023-12-15 21:47:08,646 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:47:08" (1/1) ... [2023-12-15 21:47:08,676 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:47:08,769 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-sp_file-90.i[917,930] [2023-12-15 21:47:08,809 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:47:08,822 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:47:08,829 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-sp_file-90.i[917,930] [2023-12-15 21:47:08,850 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:47:08,863 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:47:08,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:47:08 WrapperNode [2023-12-15 21:47:08,863 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:47:08,864 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:47:08,864 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:47:08,864 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:47:08,869 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:47:08" (1/1) ... [2023-12-15 21:47:08,884 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:47:08" (1/1) ... [2023-12-15 21:47:08,917 INFO L138 Inliner]: procedures = 26, calls = 162, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 478 [2023-12-15 21:47:08,917 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:47:08,918 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:47:08,918 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:47:08,918 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:47:08,926 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:47:08" (1/1) ... [2023-12-15 21:47:08,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:47:08" (1/1) ... [2023-12-15 21:47:08,929 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:47:08" (1/1) ... [2023-12-15 21:47:08,958 INFO L175 MemorySlicer]: Split 130 memory accesses to 2 slices as follows [2, 128]. 98 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 15]. The 19 writes are split as follows [0, 19]. [2023-12-15 21:47:08,958 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:47:08" (1/1) ... [2023-12-15 21:47:08,958 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:47:08" (1/1) ... [2023-12-15 21:47:08,967 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:47:08" (1/1) ... [2023-12-15 21:47:08,969 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:47:08" (1/1) ... [2023-12-15 21:47:08,971 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:47:08" (1/1) ... [2023-12-15 21:47:08,972 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:47:08" (1/1) ... [2023-12-15 21:47:08,975 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:47:08,975 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:47:08,975 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:47:08,975 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:47:08,976 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:47:08" (1/1) ... [2023-12-15 21:47:08,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:47:09,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:47:09,015 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:47:09,040 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:47:09,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:47:09,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-15 21:47:09,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-15 21:47:09,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-15 21:47:09,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-15 21:47:09,045 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 21:47:09,046 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 21:47:09,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:47:09,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 21:47:09,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:47:09,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:47:09,157 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:47:09,158 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:47:09,458 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:47:09,489 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:47:09,489 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 21:47:09,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:47:09 BoogieIcfgContainer [2023-12-15 21:47:09,489 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:47:09,491 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:47:09,491 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:47:09,493 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:47:09,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:47:08" (1/3) ... [2023-12-15 21:47:09,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31fe7770 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:47:09, skipping insertion in model container [2023-12-15 21:47:09,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:47:08" (2/3) ... [2023-12-15 21:47:09,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31fe7770 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:47:09, skipping insertion in model container [2023-12-15 21:47:09,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:47:09" (3/3) ... [2023-12-15 21:47:09,496 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-90.i [2023-12-15 21:47:09,508 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:47:09,508 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:47:09,537 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:47:09,541 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;@75c47234, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:47:09,541 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:47:09,544 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 81 states have (on average 1.4074074074074074) internal successors, (114), 82 states have internal predecessors, (114), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-15 21:47:09,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-15 21:47:09,563 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:47:09,563 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:09,564 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:47:09,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:47:09,567 INFO L85 PathProgramCache]: Analyzing trace with hash 584961870, now seen corresponding path program 1 times [2023-12-15 21:47:09,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:47:09,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257159846] [2023-12-15 21:47:09,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:47:09,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:47:09,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:09,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:47:09,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:09,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:47:09,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:09,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:47:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:09,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:47:09,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:09,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:47:09,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:09,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:47:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:09,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:47:09,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:09,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:47:09,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:09,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:47:09,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:09,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:47:09,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:09,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:47:09,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:09,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:47:09,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:09,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:47:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:09,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:47:09,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:09,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:47:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:09,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:47:09,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:09,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:47:09,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:09,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:47:09,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:09,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:47:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:09,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-15 21:47:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:09,890 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 21:47:09,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:47:09,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257159846] [2023-12-15 21:47:09,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257159846] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:47:09,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:47:09,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:47:09,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678509110] [2023-12-15 21:47:09,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:47:09,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 21:47:09,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:47:09,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 21:47:09,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:47:09,929 INFO L87 Difference]: Start difference. First operand has 104 states, 81 states have (on average 1.4074074074074074) internal successors, (114), 82 states have internal predecessors, (114), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-15 21:47:09,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:47:09,984 INFO L93 Difference]: Finished difference Result 205 states and 326 transitions. [2023-12-15 21:47:09,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 21:47:09,987 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 148 [2023-12-15 21:47:09,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:47:09,994 INFO L225 Difference]: With dead ends: 205 [2023-12-15 21:47:09,995 INFO L226 Difference]: Without dead ends: 102 [2023-12-15 21:47:09,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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:47:10,001 INFO L413 NwaCegarLoop]: 145 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, 145 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:47:10,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:47:10,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-12-15 21:47:10,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-12-15 21:47:10,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-15 21:47:10,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 149 transitions. [2023-12-15 21:47:10,041 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 149 transitions. Word has length 148 [2023-12-15 21:47:10,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:47:10,042 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 149 transitions. [2023-12-15 21:47:10,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-15 21:47:10,042 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 149 transitions. [2023-12-15 21:47:10,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-15 21:47:10,046 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:47:10,047 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:10,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:47:10,047 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:47:10,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:47:10,047 INFO L85 PathProgramCache]: Analyzing trace with hash 2029456678, now seen corresponding path program 1 times [2023-12-15 21:47:10,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:47:10,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523567709] [2023-12-15 21:47:10,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:47:10,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:47:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:10,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:47:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:10,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:47:10,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:10,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:47:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:10,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:47:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:10,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:47:10,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:10,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:47:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:10,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:47:10,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:10,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:47:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:10,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:47:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:10,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:47:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:10,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:47:10,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:10,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:47:10,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:10,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:47:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:10,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:47:10,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:10,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:47:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:10,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:47:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:10,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:47:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:10,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:47:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:10,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:47:10,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:10,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-15 21:47:10,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:10,355 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 21:47:10,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:47:10,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523567709] [2023-12-15 21:47:10,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523567709] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:47:10,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:47:10,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:47:10,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595828932] [2023-12-15 21:47:10,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:47:10,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:47:10,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:47:10,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:47:10,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:47:10,358 INFO L87 Difference]: Start difference. First operand 102 states and 149 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 21:47:10,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:47:10,434 INFO L93 Difference]: Finished difference Result 231 states and 339 transitions. [2023-12-15 21:47:10,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:47:10,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 148 [2023-12-15 21:47:10,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:47:10,438 INFO L225 Difference]: With dead ends: 231 [2023-12-15 21:47:10,438 INFO L226 Difference]: Without dead ends: 130 [2023-12-15 21:47:10,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 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:47:10,440 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 61 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:47:10,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 466 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:47:10,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-12-15 21:47:10,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 104. [2023-12-15 21:47:10,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 82 states have (on average 1.353658536585366) internal successors, (111), 82 states have internal predecessors, (111), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-15 21:47:10,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 151 transitions. [2023-12-15 21:47:10,447 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 151 transitions. Word has length 148 [2023-12-15 21:47:10,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:47:10,451 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 151 transitions. [2023-12-15 21:47:10,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 21:47:10,452 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 151 transitions. [2023-12-15 21:47:10,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-15 21:47:10,453 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:47:10,453 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:10,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:47:10,454 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:47:10,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:47:10,454 INFO L85 PathProgramCache]: Analyzing trace with hash 737193547, now seen corresponding path program 1 times [2023-12-15 21:47:10,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:47:10,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22556827] [2023-12-15 21:47:10,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:47:10,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:47:10,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:10,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:47:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:11,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:47:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:11,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:47:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:11,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:47:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:11,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:47:11,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:11,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:47:11,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:11,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:47:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:11,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:47:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:11,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:47:11,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:11,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:47:11,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:11,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:47:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:11,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:47:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:11,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:47:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:11,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:47:11,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:11,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:47:11,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:11,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:47:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:11,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:47:11,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:11,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:47:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:11,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:47:11,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:11,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-15 21:47:11,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:11,087 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 21:47:11,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:47:11,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22556827] [2023-12-15 21:47:11,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22556827] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:47:11,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:47:11,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:47:11,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971383639] [2023-12-15 21:47:11,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:47:11,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:47:11,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:47:11,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:47:11,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:47:11,089 INFO L87 Difference]: Start difference. First operand 104 states and 151 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 21:47:11,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:47:11,311 INFO L93 Difference]: Finished difference Result 214 states and 311 transitions. [2023-12-15 21:47:11,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:47:11,312 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2023-12-15 21:47:11,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:47:11,316 INFO L225 Difference]: With dead ends: 214 [2023-12-15 21:47:11,316 INFO L226 Difference]: Without dead ends: 111 [2023-12-15 21:47:11,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:47:11,322 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 109 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:47:11,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 388 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:47:11,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-12-15 21:47:11,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2023-12-15 21:47:11,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 87 states have (on average 1.3448275862068966) internal successors, (117), 87 states have internal predecessors, (117), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-15 21:47:11,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2023-12-15 21:47:11,330 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 150 [2023-12-15 21:47:11,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:47:11,330 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2023-12-15 21:47:11,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 21:47:11,331 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2023-12-15 21:47:11,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-15 21:47:11,332 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:47:11,332 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:11,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 21:47:11,332 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:47:11,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:47:11,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1159895373, now seen corresponding path program 1 times [2023-12-15 21:47:11,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:47:11,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242391812] [2023-12-15 21:47:11,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:47:11,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:47:11,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:11,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:47:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:11,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:47:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:11,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:47:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:11,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:47:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:11,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:47:11,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:11,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:47:11,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:11,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:47:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:11,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:47:11,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:11,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:47:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:11,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:47:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:11,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:47:11,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:11,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:47:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:11,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:47:11,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:11,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:47:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:11,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:47:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:11,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:47:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:11,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:47:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:11,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:47:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:11,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:47:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:11,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-15 21:47:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:11,957 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 21:47:11,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:47:11,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242391812] [2023-12-15 21:47:11,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242391812] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:47:11,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:47:11,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 21:47:11,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759167573] [2023-12-15 21:47:11,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:47:11,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 21:47:11,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:47:11,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 21:47:11,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:47:11,959 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 21:47:12,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:47:12,244 INFO L93 Difference]: Finished difference Result 252 states and 362 transitions. [2023-12-15 21:47:12,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:47:12,244 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2023-12-15 21:47:12,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:47:12,245 INFO L225 Difference]: With dead ends: 252 [2023-12-15 21:47:12,245 INFO L226 Difference]: Without dead ends: 144 [2023-12-15 21:47:12,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:47:12,247 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 229 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:47:12,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 354 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:47:12,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-12-15 21:47:12,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 111. [2023-12-15 21:47:12,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 89 states have (on average 1.3370786516853932) internal successors, (119), 89 states have internal predecessors, (119), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-15 21:47:12,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2023-12-15 21:47:12,253 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 150 [2023-12-15 21:47:12,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:47:12,254 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2023-12-15 21:47:12,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 21:47:12,254 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2023-12-15 21:47:12,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-15 21:47:12,261 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:47:12,261 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:12,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 21:47:12,262 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:47:12,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:47:12,262 INFO L85 PathProgramCache]: Analyzing trace with hash -685099385, now seen corresponding path program 1 times [2023-12-15 21:47:12,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:47:12,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733907967] [2023-12-15 21:47:12,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:47:12,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:47:12,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:12,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:47:12,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:12,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:47:12,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:12,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:47:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:12,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:47:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:13,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:47:13,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:13,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:47:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:13,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:47:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:13,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:47:13,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:13,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:47:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:13,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:47:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:13,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:47:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:13,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:47:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:13,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:47:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:13,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:47:13,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:13,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:47:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:13,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:47:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:13,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:47:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:13,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:47:13,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:13,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:47:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:13,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-15 21:47:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:13,091 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 21:47:13,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:47:13,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733907967] [2023-12-15 21:47:13,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733907967] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:47:13,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:47:13,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 21:47:13,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339847797] [2023-12-15 21:47:13,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:47:13,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 21:47:13,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:47:13,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 21:47:13,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:47:13,095 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 21:47:13,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:47:13,605 INFO L93 Difference]: Finished difference Result 343 states and 492 transitions. [2023-12-15 21:47:13,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 21:47:13,606 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 151 [2023-12-15 21:47:13,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:47:13,608 INFO L225 Difference]: With dead ends: 343 [2023-12-15 21:47:13,608 INFO L226 Difference]: Without dead ends: 233 [2023-12-15 21:47:13,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2023-12-15 21:47:13,610 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 379 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-15 21:47:13,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 429 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-15 21:47:13,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2023-12-15 21:47:13,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 132. [2023-12-15 21:47:13,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 110 states have (on average 1.3545454545454545) internal successors, (149), 110 states have internal predecessors, (149), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-15 21:47:13,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 189 transitions. [2023-12-15 21:47:13,636 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 189 transitions. Word has length 151 [2023-12-15 21:47:13,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:47:13,637 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 189 transitions. [2023-12-15 21:47:13,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 21:47:13,637 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 189 transitions. [2023-12-15 21:47:13,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-15 21:47:13,639 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:47:13,639 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:13,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 21:47:13,640 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:47:13,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:47:13,640 INFO L85 PathProgramCache]: Analyzing trace with hash -943264823, now seen corresponding path program 1 times [2023-12-15 21:47:13,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:47:13,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606218966] [2023-12-15 21:47:13,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:47:13,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:47:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:14,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:47:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:14,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:47:14,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:14,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:47:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:14,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:47:14,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:14,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:47:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:14,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:47:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:14,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:47:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:14,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:47:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:14,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:47:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:14,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:47:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:14,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:47:14,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:14,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:47:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:14,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:47:14,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:14,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:47:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:14,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:47:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:14,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:47:14,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:14,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:47:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:14,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:47:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:14,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:47:14,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:14,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-15 21:47:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:14,635 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 21:47:14,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:47:14,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606218966] [2023-12-15 21:47:14,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606218966] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:47:14,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:47:14,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 21:47:14,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573728241] [2023-12-15 21:47:14,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:47:14,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:47:14,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:47:14,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:47:14,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:47:14,637 INFO L87 Difference]: Start difference. First operand 132 states and 189 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 21:47:15,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:47:15,054 INFO L93 Difference]: Finished difference Result 335 states and 478 transitions. [2023-12-15 21:47:15,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 21:47:15,054 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 151 [2023-12-15 21:47:15,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:47:15,055 INFO L225 Difference]: With dead ends: 335 [2023-12-15 21:47:15,055 INFO L226 Difference]: Without dead ends: 204 [2023-12-15 21:47:15,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2023-12-15 21:47:15,058 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 258 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 21:47:15,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 566 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 21:47:15,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-12-15 21:47:15,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 151. [2023-12-15 21:47:15,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 129 states have (on average 1.3565891472868217) internal successors, (175), 129 states have internal predecessors, (175), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-15 21:47:15,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 215 transitions. [2023-12-15 21:47:15,068 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 215 transitions. Word has length 151 [2023-12-15 21:47:15,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:47:15,069 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 215 transitions. [2023-12-15 21:47:15,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 21:47:15,069 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 215 transitions. [2023-12-15 21:47:15,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-15 21:47:15,070 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:47:15,070 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:15,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 21:47:15,070 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:47:15,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:47:15,070 INFO L85 PathProgramCache]: Analyzing trace with hash 370204746, now seen corresponding path program 1 times [2023-12-15 21:47:15,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:47:15,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978118860] [2023-12-15 21:47:15,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:47:15,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:47:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:15,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:47:15,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:15,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:47:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:15,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:47:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:15,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:47:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:15,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:47:15,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:15,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:47:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:15,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:47:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:15,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:47:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:15,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:47:15,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:15,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:47:15,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:15,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:47:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:15,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:47:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:15,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:47:15,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:15,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:47:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:15,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:47:15,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:15,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:47:15,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:15,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:47:15,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:15,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:47:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:15,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:47:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:15,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-15 21:47:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:15,907 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 21:47:15,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:47:15,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978118860] [2023-12-15 21:47:15,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978118860] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:47:15,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:47:15,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-15 21:47:15,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590989666] [2023-12-15 21:47:15,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:47:15,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-15 21:47:15,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:47:15,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-15 21:47:15,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-15 21:47:15,908 INFO L87 Difference]: Start difference. First operand 151 states and 215 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-15 21:47:16,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:47:16,620 INFO L93 Difference]: Finished difference Result 433 states and 617 transitions. [2023-12-15 21:47:16,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 21:47:16,620 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 152 [2023-12-15 21:47:16,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:47:16,622 INFO L225 Difference]: With dead ends: 433 [2023-12-15 21:47:16,622 INFO L226 Difference]: Without dead ends: 283 [2023-12-15 21:47:16,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2023-12-15 21:47:16,623 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 361 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-15 21:47:16,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 450 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-15 21:47:16,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2023-12-15 21:47:16,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 166. [2023-12-15 21:47:16,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 144 states have (on average 1.3611111111111112) internal successors, (196), 144 states have internal predecessors, (196), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-15 21:47:16,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 236 transitions. [2023-12-15 21:47:16,638 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 236 transitions. Word has length 152 [2023-12-15 21:47:16,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:47:16,638 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 236 transitions. [2023-12-15 21:47:16,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-15 21:47:16,639 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 236 transitions. [2023-12-15 21:47:16,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-15 21:47:16,640 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:47:16,641 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:16,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 21:47:16,641 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:47:16,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:47:16,641 INFO L85 PathProgramCache]: Analyzing trace with hash 112039308, now seen corresponding path program 1 times [2023-12-15 21:47:16,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:47:16,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840352070] [2023-12-15 21:47:16,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:47:16,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:47:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:17,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:47:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:17,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:47:17,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:17,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:47:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:17,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:47:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:17,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:47:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:17,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:47:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:18,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:47:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:18,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:47:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:18,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:47:18,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:18,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:47:18,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:18,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:47:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:18,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:47:18,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:18,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:47:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:18,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:47:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:18,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:47:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:18,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:47:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:18,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:47:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:18,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:47:18,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:18,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:47:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:18,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-15 21:47:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:18,066 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 21:47:18,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:47:18,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840352070] [2023-12-15 21:47:18,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840352070] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:47:18,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:47:18,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-15 21:47:18,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572116983] [2023-12-15 21:47:18,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:47:18,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-15 21:47:18,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:47:18,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-15 21:47:18,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-12-15 21:47:18,068 INFO L87 Difference]: Start difference. First operand 166 states and 236 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 21:47:19,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:47:19,094 INFO L93 Difference]: Finished difference Result 438 states and 621 transitions. [2023-12-15 21:47:19,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-15 21:47:19,094 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 152 [2023-12-15 21:47:19,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:47:19,095 INFO L225 Difference]: With dead ends: 438 [2023-12-15 21:47:19,095 INFO L226 Difference]: Without dead ends: 273 [2023-12-15 21:47:19,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2023-12-15 21:47:19,096 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 312 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-15 21:47:19,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 932 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-15 21:47:19,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2023-12-15 21:47:19,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 139. [2023-12-15 21:47:19,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 117 states have (on average 1.3504273504273505) internal successors, (158), 117 states have internal predecessors, (158), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-15 21:47:19,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 198 transitions. [2023-12-15 21:47:19,108 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 198 transitions. Word has length 152 [2023-12-15 21:47:19,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:47:19,108 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 198 transitions. [2023-12-15 21:47:19,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 21:47:19,108 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 198 transitions. [2023-12-15 21:47:19,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-15 21:47:19,109 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:47:19,109 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:19,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 21:47:19,109 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:47:19,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:47:19,110 INFO L85 PathProgramCache]: Analyzing trace with hash 372292528, now seen corresponding path program 1 times [2023-12-15 21:47:19,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:47:19,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564699083] [2023-12-15 21:47:19,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:47:19,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:47:19,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:21,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:47:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:21,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:47:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:21,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:47:21,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:21,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:47:21,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:21,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:47:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:21,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:47:21,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:21,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:47:21,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:21,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:47:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:21,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:47:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:21,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:47:21,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:21,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:47:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:21,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:47:21,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:21,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:47:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:21,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:47:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:21,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:47:21,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:21,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:47:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:21,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:47:21,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:21,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:47:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:21,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:47:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:21,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-15 21:47:21,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:21,262 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 21:47:21,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:47:21,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564699083] [2023-12-15 21:47:21,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564699083] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:47:21,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:47:21,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-12-15 21:47:21,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842167288] [2023-12-15 21:47:21,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:47:21,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-15 21:47:21,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:47:21,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-15 21:47:21,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2023-12-15 21:47:21,265 INFO L87 Difference]: Start difference. First operand 139 states and 198 transitions. Second operand has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 19 states have internal predecessors, (55), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2023-12-15 21:47:23,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:47:23,489 INFO L93 Difference]: Finished difference Result 398 states and 572 transitions. [2023-12-15 21:47:23,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-15 21:47:23,489 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 19 states have internal predecessors, (55), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 152 [2023-12-15 21:47:23,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:47:23,490 INFO L225 Difference]: With dead ends: 398 [2023-12-15 21:47:23,490 INFO L226 Difference]: Without dead ends: 260 [2023-12-15 21:47:23,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=278, Invalid=778, Unknown=0, NotChecked=0, Total=1056 [2023-12-15 21:47:23,491 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 795 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 1262 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-15 21:47:23,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 895 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1262 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-15 21:47:23,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-12-15 21:47:23,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 144. [2023-12-15 21:47:23,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 122 states have (on average 1.3524590163934427) internal successors, (165), 122 states have internal predecessors, (165), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-15 21:47:23,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 205 transitions. [2023-12-15 21:47:23,504 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 205 transitions. Word has length 152 [2023-12-15 21:47:23,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:47:23,504 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 205 transitions. [2023-12-15 21:47:23,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 19 states have internal predecessors, (55), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2023-12-15 21:47:23,504 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 205 transitions. [2023-12-15 21:47:23,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-15 21:47:23,505 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:47:23,505 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:23,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 21:47:23,505 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:47:23,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:47:23,506 INFO L85 PathProgramCache]: Analyzing trace with hash -214513486, now seen corresponding path program 1 times [2023-12-15 21:47:23,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:47:23,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130373228] [2023-12-15 21:47:23,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:47:23,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:47:23,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:25,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:47:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:25,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:47:25,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:25,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:47:25,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:25,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:47:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:25,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:47:25,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:25,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:47:25,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:25,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:47:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:25,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:47:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:25,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:47:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:25,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:47:25,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:25,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:47:25,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:25,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:47:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:25,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:47:25,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:25,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:47:25,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:25,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:47:25,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:25,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:47:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:25,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:47:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:25,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:47:25,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:25,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:47:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:25,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-15 21:47:25,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:25,890 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 21:47:25,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:47:25,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130373228] [2023-12-15 21:47:25,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130373228] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:47:25,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:47:25,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-12-15 21:47:25,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475170493] [2023-12-15 21:47:25,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:47:25,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-15 21:47:25,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:47:25,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-15 21:47:25,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2023-12-15 21:47:25,892 INFO L87 Difference]: Start difference. First operand 144 states and 205 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-15 21:47:26,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:47:26,916 INFO L93 Difference]: Finished difference Result 377 states and 539 transitions. [2023-12-15 21:47:26,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 21:47:26,916 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 152 [2023-12-15 21:47:26,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:47:26,918 INFO L225 Difference]: With dead ends: 377 [2023-12-15 21:47:26,918 INFO L226 Difference]: Without dead ends: 234 [2023-12-15 21:47:26,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2023-12-15 21:47:26,918 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 356 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-15 21:47:26,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 639 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-15 21:47:26,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2023-12-15 21:47:26,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 144. [2023-12-15 21:47:26,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 122 states have (on average 1.3442622950819672) internal successors, (164), 122 states have internal predecessors, (164), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-15 21:47:26,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 204 transitions. [2023-12-15 21:47:26,931 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 204 transitions. Word has length 152 [2023-12-15 21:47:26,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:47:26,931 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 204 transitions. [2023-12-15 21:47:26,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-15 21:47:26,931 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 204 transitions. [2023-12-15 21:47:26,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-15 21:47:26,932 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:47:26,932 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:26,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 21:47:26,932 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:47:26,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:47:26,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1216055374, now seen corresponding path program 1 times [2023-12-15 21:47:26,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:47:26,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402100911] [2023-12-15 21:47:26,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:47:26,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:47:26,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:28,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:47:28,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:28,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:47:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:28,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:47:28,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:28,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:47:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:28,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:47:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:28,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:47:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:28,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:47:28,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:28,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:47:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:28,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:47:28,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:28,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:47:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:28,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:47:28,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:28,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:47:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:28,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:47:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:28,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:47:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:28,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:47:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:28,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:47:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:28,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:47:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:28,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:47:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:28,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:47:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:28,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-15 21:47:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:28,645 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 21:47:28,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:47:28,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402100911] [2023-12-15 21:47:28,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402100911] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:47:28,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:47:28,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-12-15 21:47:28,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751181736] [2023-12-15 21:47:28,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:47:28,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-15 21:47:28,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:47:28,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-15 21:47:28,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2023-12-15 21:47:28,647 INFO L87 Difference]: Start difference. First operand 144 states and 204 transitions. Second operand has 16 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 16 states have internal predecessors, (55), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2023-12-15 21:47:29,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:47:29,411 INFO L93 Difference]: Finished difference Result 346 states and 492 transitions. [2023-12-15 21:47:29,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 21:47:29,412 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 16 states have internal predecessors, (55), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 152 [2023-12-15 21:47:29,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:47:29,412 INFO L225 Difference]: With dead ends: 346 [2023-12-15 21:47:29,412 INFO L226 Difference]: Without dead ends: 203 [2023-12-15 21:47:29,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2023-12-15 21:47:29,413 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 579 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-15 21:47:29,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 464 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-15 21:47:29,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-12-15 21:47:29,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 144. [2023-12-15 21:47:29,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 122 states have (on average 1.3360655737704918) internal successors, (163), 122 states have internal predecessors, (163), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-15 21:47:29,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 203 transitions. [2023-12-15 21:47:29,425 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 203 transitions. Word has length 152 [2023-12-15 21:47:29,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:47:29,425 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 203 transitions. [2023-12-15 21:47:29,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 16 states have internal predecessors, (55), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2023-12-15 21:47:29,425 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 203 transitions. [2023-12-15 21:47:29,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-15 21:47:29,427 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:47:29,427 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:29,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-15 21:47:29,427 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:47:29,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:47:29,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1802861388, now seen corresponding path program 1 times [2023-12-15 21:47:29,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:47:29,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566816263] [2023-12-15 21:47:29,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:47:29,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:47:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:33,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:47:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:33,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:47:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:33,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:47:33,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:33,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:47:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:33,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:47:33,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:33,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:47:33,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:33,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:47:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:33,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:47:33,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:33,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:47:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:33,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:47:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:33,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:47:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:33,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:47:33,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:33,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:47:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:33,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:47:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:33,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:47:33,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:33,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:47:33,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:33,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:47:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:33,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:47:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:33,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:47:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:33,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-15 21:47:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:33,831 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 15 proven. 42 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-12-15 21:47:33,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:47:33,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566816263] [2023-12-15 21:47:33,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566816263] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:47:33,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139175059] [2023-12-15 21:47:33,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:47:33,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:47:33,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:47:33,834 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:47:33,842 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:47:34,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:34,042 INFO L262 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 50 conjunts are in the unsatisfiable core [2023-12-15 21:47:34,061 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:47:34,644 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:47:34,980 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 25 treesize of output 13 [2023-12-15 21:47:35,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-12-15 21:47:35,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-12-15 21:47:35,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-12-15 21:47:36,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-12-15 21:47:36,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:47:36,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:47:36,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2023-12-15 21:47:36,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:47:36,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:47:36,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:47:36,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 20 [2023-12-15 21:47:36,433 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 384 proven. 186 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-12-15 21:47:36,433 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:47:36,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139175059] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:47:36,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-15 21:47:36,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 13] total 42 [2023-12-15 21:47:36,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730639422] [2023-12-15 21:47:36,712 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-15 21:47:36,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-12-15 21:47:36,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:47:36,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-12-15 21:47:36,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1935, Unknown=0, NotChecked=0, Total=2070 [2023-12-15 21:47:36,714 INFO L87 Difference]: Start difference. First operand 144 states and 203 transitions. Second operand has 42 states, 38 states have (on average 3.1315789473684212) internal successors, (119), 40 states have internal predecessors, (119), 12 states have call successors, (40), 5 states have call predecessors, (40), 8 states have return successors, (40), 10 states have call predecessors, (40), 12 states have call successors, (40) [2023-12-15 21:47:48,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:47:48,819 INFO L93 Difference]: Finished difference Result 801 states and 1111 transitions. [2023-12-15 21:47:48,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2023-12-15 21:47:48,820 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 38 states have (on average 3.1315789473684212) internal successors, (119), 40 states have internal predecessors, (119), 12 states have call successors, (40), 5 states have call predecessors, (40), 8 states have return successors, (40), 10 states have call predecessors, (40), 12 states have call successors, (40) Word has length 152 [2023-12-15 21:47:48,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:47:48,822 INFO L225 Difference]: With dead ends: 801 [2023-12-15 21:47:48,822 INFO L226 Difference]: Without dead ends: 658 [2023-12-15 21:47:48,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3108 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=1388, Invalid=11268, Unknown=0, NotChecked=0, Total=12656 [2023-12-15 21:47:48,825 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 1932 mSDsluCounter, 3714 mSDsCounter, 0 mSdLazyCounter, 6030 mSolverCounterSat, 453 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1936 SdHoareTripleChecker+Valid, 3889 SdHoareTripleChecker+Invalid, 6483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 453 IncrementalHoareTripleChecker+Valid, 6030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-12-15 21:47:48,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1936 Valid, 3889 Invalid, 6483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [453 Valid, 6030 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2023-12-15 21:47:48,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2023-12-15 21:47:48,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 235. [2023-12-15 21:47:48,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 187 states have (on average 1.267379679144385) internal successors, (237), 187 states have internal predecessors, (237), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-15 21:47:48,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 317 transitions. [2023-12-15 21:47:48,861 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 317 transitions. Word has length 152 [2023-12-15 21:47:48,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:47:48,861 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 317 transitions. [2023-12-15 21:47:48,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 38 states have (on average 3.1315789473684212) internal successors, (119), 40 states have internal predecessors, (119), 12 states have call successors, (40), 5 states have call predecessors, (40), 8 states have return successors, (40), 10 states have call predecessors, (40), 12 states have call successors, (40) [2023-12-15 21:47:48,861 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 317 transitions. [2023-12-15 21:47:48,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-15 21:47:48,862 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:47:48,862 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:48,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-15 21:47:49,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-15 21:47:49,071 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:47:49,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:47:49,071 INFO L85 PathProgramCache]: Analyzing trace with hash 846795601, now seen corresponding path program 1 times [2023-12-15 21:47:49,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:47:49,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099340492] [2023-12-15 21:47:49,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:47:49,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:47:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:54,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:47:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:54,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:47:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:54,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:47:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:54,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:47:54,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:54,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:47:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:54,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:47:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:54,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:47:54,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:54,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:47:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:54,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:47:54,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:54,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:47:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:54,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:47:54,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:54,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:47:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:54,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:47:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:54,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:47:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:54,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:47:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:54,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:47:54,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:54,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:47:54,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:54,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:47:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:54,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:47:54,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:54,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-15 21:47:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:54,476 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 21 proven. 36 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-12-15 21:47:54,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:47:54,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099340492] [2023-12-15 21:47:54,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099340492] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:47:54,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38284119] [2023-12-15 21:47:54,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:47:54,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:47:54,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:47:54,478 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:47:54,489 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:47:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:54,651 INFO L262 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-15 21:47:54,662 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:47:55,341 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 64 treesize of output 43 [2023-12-15 21:47:55,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:47:55,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 24 [2023-12-15 21:47:55,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:47:55,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 22 [2023-12-15 21:47:55,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:47:55,550 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 81 treesize of output 69 [2023-12-15 21:47:55,687 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-12-15 21:47:55,687 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:47:55,987 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 21:47:55,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38284119] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-15 21:47:55,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-15 21:47:55,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [31, 10] total 42 [2023-12-15 21:47:55,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157014532] [2023-12-15 21:47:55,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:47:55,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:47:55,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:47:55,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:47:55,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1600, Unknown=0, NotChecked=0, Total=1722 [2023-12-15 21:47:55,989 INFO L87 Difference]: Start difference. First operand 235 states and 317 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 21:47:56,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:47:56,604 INFO L93 Difference]: Finished difference Result 476 states and 652 transitions. [2023-12-15 21:47:56,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-15 21:47:56,605 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2023-12-15 21:47:56,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:47:56,606 INFO L225 Difference]: With dead ends: 476 [2023-12-15 21:47:56,607 INFO L226 Difference]: Without dead ends: 325 [2023-12-15 21:47:56,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 339 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=169, Invalid=2183, Unknown=0, NotChecked=0, Total=2352 [2023-12-15 21:47:56,608 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 193 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 21:47:56,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 947 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 21:47:56,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2023-12-15 21:47:56,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 205. [2023-12-15 21:47:56,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 157 states have (on average 1.2420382165605095) internal successors, (195), 158 states have internal predecessors, (195), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-15 21:47:56,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 275 transitions. [2023-12-15 21:47:56,641 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 275 transitions. Word has length 153 [2023-12-15 21:47:56,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:47:56,642 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 275 transitions. [2023-12-15 21:47:56,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 21:47:56,642 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 275 transitions. [2023-12-15 21:47:56,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-15 21:47:56,643 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:47:56,643 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:56,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-15 21:47:56,848 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,SelfDestructingSolverStorable12 [2023-12-15 21:47:56,849 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:47:56,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:47:56,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1204004231, now seen corresponding path program 1 times [2023-12-15 21:47:56,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:47:56,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60273083] [2023-12-15 21:47:56,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:47:56,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:47:56,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:57,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:47:57,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:57,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:47:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:57,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:47:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:57,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:47:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:57,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:47:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:57,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:47:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:57,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:47:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:57,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:47:57,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:57,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:47:57,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:57,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:47:57,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:57,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:47:57,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:57,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:47:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:57,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:47:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:57,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:47:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:57,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:47:57,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:57,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:47:57,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:57,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:47:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:57,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:47:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:57,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:47:57,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:57,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-15 21:47:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:57,619 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 21:47:57,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:47:57,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60273083] [2023-12-15 21:47:57,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60273083] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:47:57,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:47:57,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-15 21:47:57,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792877421] [2023-12-15 21:47:57,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:47:57,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-15 21:47:57,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:47:57,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-15 21:47:57,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-12-15 21:47:57,620 INFO L87 Difference]: Start difference. First operand 205 states and 275 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 21:47:58,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:47:58,294 INFO L93 Difference]: Finished difference Result 472 states and 643 transitions. [2023-12-15 21:47:58,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 21:47:58,294 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 154 [2023-12-15 21:47:58,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:47:58,296 INFO L225 Difference]: With dead ends: 472 [2023-12-15 21:47:58,296 INFO L226 Difference]: Without dead ends: 324 [2023-12-15 21:47:58,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2023-12-15 21:47:58,297 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 417 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-15 21:47:58,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 526 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-15 21:47:58,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2023-12-15 21:47:58,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 223. [2023-12-15 21:47:58,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 175 states have (on average 1.2457142857142858) internal successors, (218), 176 states have internal predecessors, (218), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-15 21:47:58,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 298 transitions. [2023-12-15 21:47:58,335 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 298 transitions. Word has length 154 [2023-12-15 21:47:58,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:47:58,338 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 298 transitions. [2023-12-15 21:47:58,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 21:47:58,338 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 298 transitions. [2023-12-15 21:47:58,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-15 21:47:58,339 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:47:58,339 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:58,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-15 21:47:58,339 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:47:58,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:47:58,339 INFO L85 PathProgramCache]: Analyzing trace with hash 945838793, now seen corresponding path program 1 times [2023-12-15 21:47:58,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:47:58,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753250019] [2023-12-15 21:47:58,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:47:58,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:47:58,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:58,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:47:58,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:58,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:47:58,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:58,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:47:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:58,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:47:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:58,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:47:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:58,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:47:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:58,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:47:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:58,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:47:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:58,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:47:58,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:58,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:47:58,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:58,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:47:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:58,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:47:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:58,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:47:58,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:58,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:47:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:58,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:47:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:58,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:47:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:58,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:47:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:58,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:47:58,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:58,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:47:58,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:58,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-15 21:47:58,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:58,655 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 21:47:58,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:47:58,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753250019] [2023-12-15 21:47:58,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753250019] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:47:58,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:47:58,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 21:47:58,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819313613] [2023-12-15 21:47:58,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:47:58,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:47:58,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:47:58,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:47:58,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:47:58,656 INFO L87 Difference]: Start difference. First operand 223 states and 298 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 21:47:58,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:47:58,921 INFO L93 Difference]: Finished difference Result 446 states and 600 transitions. [2023-12-15 21:47:58,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:47:58,921 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 154 [2023-12-15 21:47:58,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:47:58,922 INFO L225 Difference]: With dead ends: 446 [2023-12-15 21:47:58,922 INFO L226 Difference]: Without dead ends: 280 [2023-12-15 21:47:58,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:47:58,923 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 204 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:47:58,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 464 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:47:58,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2023-12-15 21:47:58,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 237. [2023-12-15 21:47:58,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 189 states have (on average 1.2380952380952381) internal successors, (234), 190 states have internal predecessors, (234), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-15 21:47:58,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 314 transitions. [2023-12-15 21:47:58,956 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 314 transitions. Word has length 154 [2023-12-15 21:47:58,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:47:58,957 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 314 transitions. [2023-12-15 21:47:58,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-15 21:47:58,957 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 314 transitions. [2023-12-15 21:47:58,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-15 21:47:58,958 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:47:58,958 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:58,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-15 21:47:58,958 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:47:58,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:47:58,958 INFO L85 PathProgramCache]: Analyzing trace with hash -2079403652, now seen corresponding path program 1 times [2023-12-15 21:47:58,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:47:58,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273860464] [2023-12-15 21:47:58,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:47:58,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:47:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:59,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:47:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:59,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:47:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:59,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:47:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:59,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:47:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:59,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:47:59,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:59,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:47:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:59,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:47:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:59,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:47:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:59,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:47:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:59,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:47:59,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:59,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:47:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:59,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:47:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:59,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:47:59,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:59,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:47:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:59,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:47:59,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:59,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:47:59,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:59,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:47:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:59,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:47:59,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:59,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:47:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:59,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-15 21:47:59,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:47:59,946 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 21:47:59,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:47:59,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273860464] [2023-12-15 21:47:59,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273860464] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:47:59,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:47:59,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-15 21:47:59,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619521668] [2023-12-15 21:47:59,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:47:59,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-15 21:47:59,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:47:59,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-15 21:47:59,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-12-15 21:47:59,947 INFO L87 Difference]: Start difference. First operand 237 states and 314 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-15 21:48:00,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:48:00,593 INFO L93 Difference]: Finished difference Result 510 states and 685 transitions. [2023-12-15 21:48:00,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 21:48:00,596 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 154 [2023-12-15 21:48:00,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:48:00,598 INFO L225 Difference]: With dead ends: 510 [2023-12-15 21:48:00,598 INFO L226 Difference]: Without dead ends: 330 [2023-12-15 21:48:00,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2023-12-15 21:48:00,599 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 501 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-15 21:48:00,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 369 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-15 21:48:00,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2023-12-15 21:48:00,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 252. [2023-12-15 21:48:00,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 204 states have (on average 1.2549019607843137) internal successors, (256), 205 states have internal predecessors, (256), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-15 21:48:00,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 336 transitions. [2023-12-15 21:48:00,635 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 336 transitions. Word has length 154 [2023-12-15 21:48:00,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:48:00,635 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 336 transitions. [2023-12-15 21:48:00,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-15 21:48:00,635 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 336 transitions. [2023-12-15 21:48:00,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-15 21:48:00,636 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:48:00,636 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:00,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-15 21:48:00,636 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:48:00,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:48:00,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1068286402, now seen corresponding path program 1 times [2023-12-15 21:48:00,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:48:00,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899346275] [2023-12-15 21:48:00,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:48:00,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:48:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:01,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:48:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:01,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:48:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:01,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:48:01,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:01,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:48:01,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:01,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:48:01,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:01,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:48:01,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:01,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:48:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:01,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:48:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:01,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:48:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:01,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:48:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:01,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:48:01,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:01,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:48:01,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:01,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:48:01,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:01,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:48:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:01,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:48:01,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:01,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:48:01,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:01,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:48:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:01,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:48:01,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:01,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:48:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:01,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-15 21:48:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:01,190 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-15 21:48:01,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:48:01,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899346275] [2023-12-15 21:48:01,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899346275] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:48:01,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:48:01,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-15 21:48:01,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469264526] [2023-12-15 21:48:01,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:48:01,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-15 21:48:01,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:48:01,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-15 21:48:01,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-12-15 21:48:01,191 INFO L87 Difference]: Start difference. First operand 252 states and 336 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-15 21:48:01,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:48:01,716 INFO L93 Difference]: Finished difference Result 509 states and 682 transitions. [2023-12-15 21:48:01,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 21:48:01,716 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 154 [2023-12-15 21:48:01,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:48:01,717 INFO L225 Difference]: With dead ends: 509 [2023-12-15 21:48:01,717 INFO L226 Difference]: Without dead ends: 314 [2023-12-15 21:48:01,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2023-12-15 21:48:01,718 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 412 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-15 21:48:01,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 352 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-15 21:48:01,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2023-12-15 21:48:01,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 258. [2023-12-15 21:48:01,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 210 states have (on average 1.2476190476190476) internal successors, (262), 211 states have internal predecessors, (262), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-15 21:48:01,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 342 transitions. [2023-12-15 21:48:01,754 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 342 transitions. Word has length 154 [2023-12-15 21:48:01,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:48:01,754 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 342 transitions. [2023-12-15 21:48:01,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-15 21:48:01,754 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 342 transitions. [2023-12-15 21:48:01,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-15 21:48:01,755 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:48:01,755 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:01,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-15 21:48:01,755 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:48:01,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:48:01,756 INFO L85 PathProgramCache]: Analyzing trace with hash 811825287, now seen corresponding path program 1 times [2023-12-15 21:48:01,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:48:01,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381934111] [2023-12-15 21:48:01,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:48:01,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:48:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2023-12-15 21:48:01,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-15 21:48:01,989 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Termination requested (timeout or resource limit) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:304) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:154) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:260) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:237) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:869) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:793) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:352) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:283) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-15 21:48:01,991 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:48:01,993 INFO L158 Benchmark]: Toolchain (without parser) took 53354.55ms. Allocated memory was 235.9MB in the beginning and 760.2MB in the end (delta: 524.3MB). Free memory was 182.8MB in the beginning and 473.2MB in the end (delta: -290.4MB). Peak memory consumption was 235.0MB. Max. memory is 8.0GB. [2023-12-15 21:48:01,993 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 235.9MB. Free memory is still 184.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:48:01,993 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.26ms. Allocated memory is still 235.9MB. Free memory was 182.5MB in the beginning and 166.9MB in the end (delta: 15.6MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-15 21:48:01,993 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.21ms. Allocated memory is still 235.9MB. Free memory was 166.9MB in the beginning and 163.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-15 21:48:01,993 INFO L158 Benchmark]: Boogie Preprocessor took 57.09ms. Allocated memory is still 235.9MB. Free memory was 163.2MB in the beginning and 159.3MB in the end (delta: 3.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 21:48:01,993 INFO L158 Benchmark]: RCFGBuilder took 513.98ms. Allocated memory is still 235.9MB. Free memory was 159.3MB in the beginning and 178.3MB in the end (delta: -19.0MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. [2023-12-15 21:48:01,994 INFO L158 Benchmark]: TraceAbstraction took 52501.29ms. Allocated memory was 235.9MB in the beginning and 760.2MB in the end (delta: 524.3MB). Free memory was 177.7MB in the beginning and 473.2MB in the end (delta: -295.5MB). Peak memory consumption was 228.8MB. Max. memory is 8.0GB. [2023-12-15 21:48:01,994 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.10ms. Allocated memory is still 235.9MB. Free memory is still 184.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 222.26ms. Allocated memory is still 235.9MB. Free memory was 182.5MB in the beginning and 166.9MB in the end (delta: 15.6MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.21ms. Allocated memory is still 235.9MB. Free memory was 166.9MB in the beginning and 163.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 57.09ms. Allocated memory is still 235.9MB. Free memory was 163.2MB in the beginning and 159.3MB in the end (delta: 3.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 513.98ms. Allocated memory is still 235.9MB. Free memory was 159.3MB in the beginning and 178.3MB in the end (delta: -19.0MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. * TraceAbstraction took 52501.29ms. Allocated memory was 235.9MB in the beginning and 760.2MB in the end (delta: 524.3MB). Free memory was 177.7MB in the beginning and 473.2MB in the end (delta: -295.5MB). Peak memory consumption was 228.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Termination requested (timeout or resource limit) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Termination requested (timeout or resource limit): de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:304) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown