/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-64bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d32_e0.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 19:19:02,431 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 19:19:02,494 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2023-12-16 19:19:02,498 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 19:19:02,498 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 19:19:02,511 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 19:19:02,512 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 19:19:02,512 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 19:19:02,513 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 19:19:02,513 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 19:19:02,513 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 19:19:02,513 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 19:19:02,514 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 19:19:02,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 19:19:02,514 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 19:19:02,515 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 19:19:02,515 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 19:19:02,515 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 19:19:02,515 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 19:19:02,516 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 19:19:02,516 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 19:19:02,516 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 19:19:02,516 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 19:19:02,517 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 19:19:02,517 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 19:19:02,517 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 19:19:02,518 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 19:19:02,518 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 19:19:02,518 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 19:19:02,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 19:19:02,519 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 19:19:02,519 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 19:19:02,519 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 19:19:02,519 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 19:19:02,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 19:19:02,520 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 19:19:02,520 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 19:19:02,520 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 19:19:02,520 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 19:19:02,521 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 19:19:02,521 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-16 19:19:02,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 19:19:02,702 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 19:19:02,704 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 19:19:02,706 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 19:19:02,706 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 19:19:02,707 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d32_e0.c [2023-12-16 19:19:03,882 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 19:19:04,128 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 19:19:04,129 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d32_e0.c [2023-12-16 19:19:04,154 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a2174fbb/a8e1f0e464594542aeb37e61b41c8321/FLAG2bd10df33 [2023-12-16 19:19:04,168 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a2174fbb/a8e1f0e464594542aeb37e61b41c8321 [2023-12-16 19:19:04,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 19:19:04,173 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 19:19:04,174 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 19:19:04,174 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 19:19:04,178 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 19:19:04,179 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:19:04" (1/1) ... [2023-12-16 19:19:04,179 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5203073e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:04, skipping insertion in model container [2023-12-16 19:19:04,180 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:19:04" (1/1) ... [2023-12-16 19:19:04,235 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 19:19:04,364 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d32_e0.c[1280,1293] [2023-12-16 19:19:04,587 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 19:19:04,593 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 19:19:04,601 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d32_e0.c[1280,1293] [2023-12-16 19:19:04,756 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 19:19:04,766 INFO L206 MainTranslator]: Completed translation [2023-12-16 19:19:04,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:04 WrapperNode [2023-12-16 19:19:04,768 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 19:19:04,770 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 19:19:04,770 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 19:19:04,770 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 19:19:04,775 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:04" (1/1) ... [2023-12-16 19:19:04,811 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:04" (1/1) ... [2023-12-16 19:19:04,995 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3483 [2023-12-16 19:19:04,996 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 19:19:04,996 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 19:19:04,996 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 19:19:04,997 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 19:19:05,005 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:04" (1/1) ... [2023-12-16 19:19:05,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:04" (1/1) ... [2023-12-16 19:19:05,107 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:04" (1/1) ... [2023-12-16 19:19:05,190 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 19:19:05,191 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:04" (1/1) ... [2023-12-16 19:19:05,191 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:04" (1/1) ... [2023-12-16 19:19:05,249 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:04" (1/1) ... [2023-12-16 19:19:05,270 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:04" (1/1) ... [2023-12-16 19:19:05,285 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:04" (1/1) ... [2023-12-16 19:19:05,300 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:04" (1/1) ... [2023-12-16 19:19:05,388 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 19:19:05,389 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 19:19:05,389 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 19:19:05,389 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 19:19:05,390 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:04" (1/1) ... [2023-12-16 19:19:05,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 19:19:05,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 19:19:05,414 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-16 19:19:05,432 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-16 19:19:05,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 19:19:05,445 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 19:19:05,445 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 19:19:05,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 19:19:05,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 19:19:05,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 19:19:05,766 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 19:19:05,768 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 19:19:07,494 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 19:19:07,554 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 19:19:07,555 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 19:19:07,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:19:07 BoogieIcfgContainer [2023-12-16 19:19:07,555 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 19:19:07,557 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 19:19:07,557 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 19:19:07,559 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 19:19:07,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 07:19:04" (1/3) ... [2023-12-16 19:19:07,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2be64065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:19:07, skipping insertion in model container [2023-12-16 19:19:07,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:19:04" (2/3) ... [2023-12-16 19:19:07,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2be64065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:19:07, skipping insertion in model container [2023-12-16 19:19:07,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:19:07" (3/3) ... [2023-12-16 19:19:07,561 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w32_d32_e0.c [2023-12-16 19:19:07,574 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 19:19:07,575 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 19:19:07,616 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 19:19:07,621 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;@6f5b3d18, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 19:19:07,621 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 19:19:07,626 INFO L276 IsEmpty]: Start isEmpty. Operand has 657 states, 651 states have (on average 1.662058371735791) internal successors, (1082), 652 states have internal predecessors, (1082), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:07,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2023-12-16 19:19:07,641 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:07,642 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:07,642 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:07,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:07,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1087534194, now seen corresponding path program 1 times [2023-12-16 19:19:07,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:07,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853238674] [2023-12-16 19:19:07,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:07,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:08,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:08,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:08,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:08,019 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:08,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:08,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853238674] [2023-12-16 19:19:08,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853238674] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:08,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:08,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 19:19:08,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083650395] [2023-12-16 19:19:08,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:08,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 19:19:08,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:08,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 19:19:08,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 19:19:08,049 INFO L87 Difference]: Start difference. First operand has 657 states, 651 states have (on average 1.662058371735791) internal successors, (1082), 652 states have internal predecessors, (1082), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 100.0) internal successors, (200), 2 states have internal predecessors, (200), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 19:19:08,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:08,098 INFO L93 Difference]: Finished difference Result 1188 states and 1972 transitions. [2023-12-16 19:19:08,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 19:19:08,100 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 100.0) internal successors, (200), 2 states have internal predecessors, (200), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 212 [2023-12-16 19:19:08,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:08,110 INFO L225 Difference]: With dead ends: 1188 [2023-12-16 19:19:08,110 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:08,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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-16 19:19:08,117 INFO L413 NwaCegarLoop]: 1082 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:08,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1082 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:19:08,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:08,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:08,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.656923076923077) internal successors, (1077), 650 states have internal predecessors, (1077), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:08,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1083 transitions. [2023-12-16 19:19:08,178 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1083 transitions. Word has length 212 [2023-12-16 19:19:08,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:08,179 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1083 transitions. [2023-12-16 19:19:08,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 100.0) internal successors, (200), 2 states have internal predecessors, (200), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 19:19:08,179 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1083 transitions. [2023-12-16 19:19:08,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2023-12-16 19:19:08,187 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:08,188 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:08,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 19:19:08,188 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:08,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:08,189 INFO L85 PathProgramCache]: Analyzing trace with hash -127458616, now seen corresponding path program 1 times [2023-12-16 19:19:08,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:08,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024117284] [2023-12-16 19:19:08,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:08,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:09,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:09,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:09,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:09,239 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:09,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:09,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024117284] [2023-12-16 19:19:09,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024117284] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:09,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:09,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:19:09,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404793359] [2023-12-16 19:19:09,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:09,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:19:09,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:09,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:19:09,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:09,247 INFO L87 Difference]: Start difference. First operand 655 states and 1083 transitions. Second operand has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:09,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:09,495 INFO L93 Difference]: Finished difference Result 1186 states and 1960 transitions. [2023-12-16 19:19:09,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:09,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 212 [2023-12-16 19:19:09,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:09,498 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:09,498 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:09,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-16 19:19:09,501 INFO L413 NwaCegarLoop]: 952 mSDtfsCounter, 922 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:09,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 1906 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:19:09,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:09,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:09,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.6553846153846155) internal successors, (1076), 650 states have internal predecessors, (1076), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:09,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1082 transitions. [2023-12-16 19:19:09,527 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1082 transitions. Word has length 212 [2023-12-16 19:19:09,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:09,528 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1082 transitions. [2023-12-16 19:19:09,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:09,529 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1082 transitions. [2023-12-16 19:19:09,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2023-12-16 19:19:09,530 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:09,530 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:09,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 19:19:09,531 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:09,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:09,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1809141912, now seen corresponding path program 1 times [2023-12-16 19:19:09,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:09,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846294056] [2023-12-16 19:19:09,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:09,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:09,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:09,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:09,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:09,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:09,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:09,925 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:09,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:09,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846294056] [2023-12-16 19:19:09,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846294056] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:09,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:09,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:09,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576752382] [2023-12-16 19:19:09,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:09,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:09,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:09,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:09,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:09,933 INFO L87 Difference]: Start difference. First operand 655 states and 1082 transitions. Second operand has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:10,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:10,174 INFO L93 Difference]: Finished difference Result 1186 states and 1958 transitions. [2023-12-16 19:19:10,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:10,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 213 [2023-12-16 19:19:10,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:10,178 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:10,178 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:10,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:10,182 INFO L413 NwaCegarLoop]: 952 mSDtfsCounter, 1987 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1990 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:10,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1990 Valid, 1906 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:19:10,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:10,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:10,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.6538461538461537) internal successors, (1075), 650 states have internal predecessors, (1075), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:10,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1081 transitions. [2023-12-16 19:19:10,196 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1081 transitions. Word has length 213 [2023-12-16 19:19:10,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:10,197 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1081 transitions. [2023-12-16 19:19:10,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:10,197 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1081 transitions. [2023-12-16 19:19:10,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2023-12-16 19:19:10,199 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:10,199 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:10,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 19:19:10,199 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:10,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:10,199 INFO L85 PathProgramCache]: Analyzing trace with hash 737500962, now seen corresponding path program 1 times [2023-12-16 19:19:10,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:10,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196752340] [2023-12-16 19:19:10,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:10,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:10,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:10,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:10,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:10,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:10,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:10,602 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:10,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:10,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196752340] [2023-12-16 19:19:10,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196752340] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:10,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:10,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:10,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936446505] [2023-12-16 19:19:10,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:10,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:10,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:10,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:10,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:10,603 INFO L87 Difference]: Start difference. First operand 655 states and 1081 transitions. Second operand has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:10,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:10,811 INFO L93 Difference]: Finished difference Result 1186 states and 1956 transitions. [2023-12-16 19:19:10,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:10,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 214 [2023-12-16 19:19:10,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:10,814 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:10,814 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:10,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:10,815 INFO L413 NwaCegarLoop]: 952 mSDtfsCounter, 1979 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1982 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:10,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1982 Valid, 1906 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:19:10,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:10,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:10,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.6523076923076923) internal successors, (1074), 650 states have internal predecessors, (1074), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:10,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1080 transitions. [2023-12-16 19:19:10,825 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1080 transitions. Word has length 214 [2023-12-16 19:19:10,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:10,826 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1080 transitions. [2023-12-16 19:19:10,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:10,826 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1080 transitions. [2023-12-16 19:19:10,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2023-12-16 19:19:10,827 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:10,827 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:10,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 19:19:10,828 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:10,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:10,828 INFO L85 PathProgramCache]: Analyzing trace with hash -2035256654, now seen corresponding path program 1 times [2023-12-16 19:19:10,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:10,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925645622] [2023-12-16 19:19:10,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:10,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:11,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:11,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:11,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:11,202 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:11,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:11,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925645622] [2023-12-16 19:19:11,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925645622] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:11,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:11,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:11,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094960869] [2023-12-16 19:19:11,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:11,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:11,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:11,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:11,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:11,204 INFO L87 Difference]: Start difference. First operand 655 states and 1080 transitions. Second operand has 5 states, 5 states have (on average 40.6) internal successors, (203), 5 states have internal predecessors, (203), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:11,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:11,408 INFO L93 Difference]: Finished difference Result 1186 states and 1954 transitions. [2023-12-16 19:19:11,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:11,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.6) internal successors, (203), 5 states have internal predecessors, (203), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 215 [2023-12-16 19:19:11,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:11,411 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:11,411 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:11,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:11,412 INFO L413 NwaCegarLoop]: 952 mSDtfsCounter, 1971 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1974 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:11,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1974 Valid, 1906 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:19:11,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:11,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:11,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.6507692307692308) internal successors, (1073), 650 states have internal predecessors, (1073), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:11,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1079 transitions. [2023-12-16 19:19:11,423 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1079 transitions. Word has length 215 [2023-12-16 19:19:11,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:11,423 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1079 transitions. [2023-12-16 19:19:11,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.6) internal successors, (203), 5 states have internal predecessors, (203), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:11,423 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1079 transitions. [2023-12-16 19:19:11,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2023-12-16 19:19:11,425 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:11,425 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:11,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 19:19:11,425 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:11,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:11,425 INFO L85 PathProgramCache]: Analyzing trace with hash 505647228, now seen corresponding path program 1 times [2023-12-16 19:19:11,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:11,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140140101] [2023-12-16 19:19:11,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:11,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:11,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:11,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:11,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:11,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:11,835 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:11,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:11,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140140101] [2023-12-16 19:19:11,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140140101] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:11,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:11,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:11,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373478433] [2023-12-16 19:19:11,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:11,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:11,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:11,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:11,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:11,837 INFO L87 Difference]: Start difference. First operand 655 states and 1079 transitions. Second operand has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:12,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:12,044 INFO L93 Difference]: Finished difference Result 1186 states and 1952 transitions. [2023-12-16 19:19:12,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:12,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 216 [2023-12-16 19:19:12,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:12,047 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:12,047 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:12,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:12,049 INFO L413 NwaCegarLoop]: 952 mSDtfsCounter, 1060 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1063 SdHoareTripleChecker+Valid, 1912 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:12,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1063 Valid, 1912 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:19:12,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:12,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:12,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.6492307692307693) internal successors, (1072), 650 states have internal predecessors, (1072), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:12,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1078 transitions. [2023-12-16 19:19:12,060 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1078 transitions. Word has length 216 [2023-12-16 19:19:12,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:12,060 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1078 transitions. [2023-12-16 19:19:12,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:12,060 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1078 transitions. [2023-12-16 19:19:12,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2023-12-16 19:19:12,062 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:12,062 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:12,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 19:19:12,062 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:12,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:12,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1385953740, now seen corresponding path program 1 times [2023-12-16 19:19:12,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:12,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043952307] [2023-12-16 19:19:12,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:12,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:12,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:12,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:12,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:12,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:12,467 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:12,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:12,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043952307] [2023-12-16 19:19:12,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043952307] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:12,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:12,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:12,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296545575] [2023-12-16 19:19:12,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:12,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:12,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:12,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:12,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:12,469 INFO L87 Difference]: Start difference. First operand 655 states and 1078 transitions. Second operand has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:12,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:12,669 INFO L93 Difference]: Finished difference Result 1186 states and 1950 transitions. [2023-12-16 19:19:12,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:12,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 217 [2023-12-16 19:19:12,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:12,672 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:12,672 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:12,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:12,673 INFO L413 NwaCegarLoop]: 952 mSDtfsCounter, 1955 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1958 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:12,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1958 Valid, 1906 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:19:12,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:12,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:12,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.6476923076923078) internal successors, (1071), 650 states have internal predecessors, (1071), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:12,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1077 transitions. [2023-12-16 19:19:12,683 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1077 transitions. Word has length 217 [2023-12-16 19:19:12,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:12,683 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1077 transitions. [2023-12-16 19:19:12,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:12,684 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1077 transitions. [2023-12-16 19:19:12,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2023-12-16 19:19:12,685 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:12,685 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:12,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 19:19:12,685 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:12,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:12,686 INFO L85 PathProgramCache]: Analyzing trace with hash -232376618, now seen corresponding path program 1 times [2023-12-16 19:19:12,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:12,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585956968] [2023-12-16 19:19:12,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:12,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:12,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:13,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:13,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:13,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:13,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:13,105 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:13,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:13,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585956968] [2023-12-16 19:19:13,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585956968] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:13,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:13,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:13,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153325754] [2023-12-16 19:19:13,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:13,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:13,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:13,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:13,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:13,108 INFO L87 Difference]: Start difference. First operand 655 states and 1077 transitions. Second operand has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:13,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:13,319 INFO L93 Difference]: Finished difference Result 1186 states and 1948 transitions. [2023-12-16 19:19:13,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:13,320 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 218 [2023-12-16 19:19:13,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:13,323 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:13,323 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:13,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:13,325 INFO L413 NwaCegarLoop]: 952 mSDtfsCounter, 1947 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1950 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:13,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1950 Valid, 1906 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:19:13,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:13,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:13,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.646153846153846) internal successors, (1070), 650 states have internal predecessors, (1070), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:13,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1076 transitions. [2023-12-16 19:19:13,337 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1076 transitions. Word has length 218 [2023-12-16 19:19:13,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:13,338 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1076 transitions. [2023-12-16 19:19:13,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:13,338 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1076 transitions. [2023-12-16 19:19:13,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2023-12-16 19:19:13,341 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:13,341 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:13,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 19:19:13,341 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:13,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:13,342 INFO L85 PathProgramCache]: Analyzing trace with hash -723491354, now seen corresponding path program 1 times [2023-12-16 19:19:13,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:13,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585324231] [2023-12-16 19:19:13,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:13,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:13,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:13,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:13,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:13,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:13,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:13,734 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:13,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:13,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585324231] [2023-12-16 19:19:13,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585324231] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:13,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:13,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:13,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325074103] [2023-12-16 19:19:13,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:13,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:13,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:13,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:13,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:13,736 INFO L87 Difference]: Start difference. First operand 655 states and 1076 transitions. Second operand has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:13,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:13,933 INFO L93 Difference]: Finished difference Result 1186 states and 1946 transitions. [2023-12-16 19:19:13,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:13,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 219 [2023-12-16 19:19:13,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:13,938 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:13,938 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:13,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:13,940 INFO L413 NwaCegarLoop]: 952 mSDtfsCounter, 1939 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1942 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:13,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1942 Valid, 1906 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:19:13,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:13,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:13,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.6446153846153846) internal successors, (1069), 650 states have internal predecessors, (1069), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:13,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1075 transitions. [2023-12-16 19:19:13,952 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1075 transitions. Word has length 219 [2023-12-16 19:19:13,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:13,953 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1075 transitions. [2023-12-16 19:19:13,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:13,953 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1075 transitions. [2023-12-16 19:19:13,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2023-12-16 19:19:13,954 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:13,954 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:13,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 19:19:13,954 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:13,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:13,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1527655888, now seen corresponding path program 1 times [2023-12-16 19:19:13,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:13,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692497009] [2023-12-16 19:19:13,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:13,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:14,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:14,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:14,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:14,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:14,326 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:14,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:14,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692497009] [2023-12-16 19:19:14,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692497009] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:14,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:14,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:14,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805075346] [2023-12-16 19:19:14,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:14,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:14,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:14,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:14,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:14,328 INFO L87 Difference]: Start difference. First operand 655 states and 1075 transitions. Second operand has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:14,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:14,524 INFO L93 Difference]: Finished difference Result 1186 states and 1944 transitions. [2023-12-16 19:19:14,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:14,525 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 220 [2023-12-16 19:19:14,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:14,527 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:14,527 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:14,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:14,528 INFO L413 NwaCegarLoop]: 952 mSDtfsCounter, 1044 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1047 SdHoareTripleChecker+Valid, 1912 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:14,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1047 Valid, 1912 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:19:14,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:14,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:14,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.643076923076923) internal successors, (1068), 650 states have internal predecessors, (1068), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:14,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1074 transitions. [2023-12-16 19:19:14,539 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1074 transitions. Word has length 220 [2023-12-16 19:19:14,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:14,539 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1074 transitions. [2023-12-16 19:19:14,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:14,539 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1074 transitions. [2023-12-16 19:19:14,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2023-12-16 19:19:14,541 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:14,541 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:14,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 19:19:14,541 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:14,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:14,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1871066880, now seen corresponding path program 1 times [2023-12-16 19:19:14,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:14,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029836356] [2023-12-16 19:19:14,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:14,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:14,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:14,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:14,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:14,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:14,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:14,871 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:14,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:14,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029836356] [2023-12-16 19:19:14,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029836356] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:14,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:14,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:14,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660979187] [2023-12-16 19:19:14,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:14,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:14,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:14,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:14,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:14,873 INFO L87 Difference]: Start difference. First operand 655 states and 1074 transitions. Second operand has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:15,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:15,065 INFO L93 Difference]: Finished difference Result 1186 states and 1942 transitions. [2023-12-16 19:19:15,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:15,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 221 [2023-12-16 19:19:15,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:15,070 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:15,070 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:15,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:15,071 INFO L413 NwaCegarLoop]: 952 mSDtfsCounter, 1923 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1926 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:15,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1926 Valid, 1906 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:19:15,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:15,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:15,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.6415384615384616) internal successors, (1067), 650 states have internal predecessors, (1067), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:15,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1073 transitions. [2023-12-16 19:19:15,082 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1073 transitions. Word has length 221 [2023-12-16 19:19:15,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:15,082 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1073 transitions. [2023-12-16 19:19:15,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:15,082 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1073 transitions. [2023-12-16 19:19:15,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2023-12-16 19:19:15,084 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:15,084 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:15,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-16 19:19:15,084 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:15,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:15,084 INFO L85 PathProgramCache]: Analyzing trace with hash 221962890, now seen corresponding path program 1 times [2023-12-16 19:19:15,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:15,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526905338] [2023-12-16 19:19:15,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:15,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:15,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:15,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:15,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:15,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:15,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:15,414 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:15,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:15,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526905338] [2023-12-16 19:19:15,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526905338] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:15,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:15,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:15,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22194342] [2023-12-16 19:19:15,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:15,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:15,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:15,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:15,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:15,415 INFO L87 Difference]: Start difference. First operand 655 states and 1073 transitions. Second operand has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:15,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:15,605 INFO L93 Difference]: Finished difference Result 1186 states and 1940 transitions. [2023-12-16 19:19:15,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:15,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 222 [2023-12-16 19:19:15,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:15,608 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:15,608 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:15,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:15,610 INFO L413 NwaCegarLoop]: 952 mSDtfsCounter, 1915 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1918 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:15,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1918 Valid, 1906 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:19:15,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:15,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:15,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.64) internal successors, (1066), 650 states have internal predecessors, (1066), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:15,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1072 transitions. [2023-12-16 19:19:15,621 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1072 transitions. Word has length 222 [2023-12-16 19:19:15,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:15,621 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1072 transitions. [2023-12-16 19:19:15,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:15,621 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1072 transitions. [2023-12-16 19:19:15,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2023-12-16 19:19:15,623 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:15,623 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:15,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-16 19:19:15,623 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:15,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:15,623 INFO L85 PathProgramCache]: Analyzing trace with hash 559279386, now seen corresponding path program 1 times [2023-12-16 19:19:15,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:15,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160315012] [2023-12-16 19:19:15,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:15,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:15,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:15,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:15,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:15,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:15,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:15,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:15,966 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:15,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:15,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160315012] [2023-12-16 19:19:15,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160315012] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:15,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:15,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:15,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395194281] [2023-12-16 19:19:15,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:15,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:15,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:15,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:15,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:15,968 INFO L87 Difference]: Start difference. First operand 655 states and 1072 transitions. Second operand has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:16,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:16,156 INFO L93 Difference]: Finished difference Result 1186 states and 1938 transitions. [2023-12-16 19:19:16,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:16,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 223 [2023-12-16 19:19:16,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:16,158 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:16,158 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:16,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:16,160 INFO L413 NwaCegarLoop]: 952 mSDtfsCounter, 1032 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 1912 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:16,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 1912 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:19:16,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:16,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:16,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.6384615384615384) internal successors, (1065), 650 states have internal predecessors, (1065), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:16,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1071 transitions. [2023-12-16 19:19:16,170 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1071 transitions. Word has length 223 [2023-12-16 19:19:16,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:16,171 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1071 transitions. [2023-12-16 19:19:16,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:16,171 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1071 transitions. [2023-12-16 19:19:16,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2023-12-16 19:19:16,172 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:16,172 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:16,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-16 19:19:16,172 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:16,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:16,173 INFO L85 PathProgramCache]: Analyzing trace with hash -613029916, now seen corresponding path program 1 times [2023-12-16 19:19:16,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:16,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046816880] [2023-12-16 19:19:16,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:16,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:16,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:16,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:16,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:16,527 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:16,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:16,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046816880] [2023-12-16 19:19:16,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046816880] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:16,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:16,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:16,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267189319] [2023-12-16 19:19:16,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:16,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:16,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:16,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:16,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:16,529 INFO L87 Difference]: Start difference. First operand 655 states and 1071 transitions. Second operand has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:16,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:16,716 INFO L93 Difference]: Finished difference Result 1186 states and 1936 transitions. [2023-12-16 19:19:16,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:16,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 224 [2023-12-16 19:19:16,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:16,719 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:16,719 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:16,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:16,720 INFO L413 NwaCegarLoop]: 952 mSDtfsCounter, 1028 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1031 SdHoareTripleChecker+Valid, 1912 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:16,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1031 Valid, 1912 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:19:16,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:16,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:16,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.636923076923077) internal successors, (1064), 650 states have internal predecessors, (1064), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:16,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1070 transitions. [2023-12-16 19:19:16,733 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1070 transitions. Word has length 224 [2023-12-16 19:19:16,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:16,733 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1070 transitions. [2023-12-16 19:19:16,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:16,733 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1070 transitions. [2023-12-16 19:19:16,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2023-12-16 19:19:16,735 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:16,735 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:16,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-16 19:19:16,735 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:16,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:16,735 INFO L85 PathProgramCache]: Analyzing trace with hash -975697868, now seen corresponding path program 1 times [2023-12-16 19:19:16,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:16,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007397172] [2023-12-16 19:19:16,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:16,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:17,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:17,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:17,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:17,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:17,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:17,062 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:17,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:17,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007397172] [2023-12-16 19:19:17,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007397172] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:17,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:17,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:17,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826648281] [2023-12-16 19:19:17,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:17,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:17,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:17,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:17,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:17,064 INFO L87 Difference]: Start difference. First operand 655 states and 1070 transitions. Second operand has 5 states, 5 states have (on average 42.6) internal successors, (213), 5 states have internal predecessors, (213), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:17,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:17,260 INFO L93 Difference]: Finished difference Result 1186 states and 1934 transitions. [2023-12-16 19:19:17,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:17,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.6) internal successors, (213), 5 states have internal predecessors, (213), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 225 [2023-12-16 19:19:17,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:17,263 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:17,263 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:17,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:17,266 INFO L413 NwaCegarLoop]: 952 mSDtfsCounter, 1024 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1027 SdHoareTripleChecker+Valid, 1912 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:17,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1027 Valid, 1912 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:19:17,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:17,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:17,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.6353846153846154) internal successors, (1063), 650 states have internal predecessors, (1063), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:17,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1069 transitions. [2023-12-16 19:19:17,280 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1069 transitions. Word has length 225 [2023-12-16 19:19:17,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:17,281 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1069 transitions. [2023-12-16 19:19:17,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.6) internal successors, (213), 5 states have internal predecessors, (213), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:17,281 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1069 transitions. [2023-12-16 19:19:17,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2023-12-16 19:19:17,283 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:17,283 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:17,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-16 19:19:17,284 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:17,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:17,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1713937858, now seen corresponding path program 1 times [2023-12-16 19:19:17,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:17,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853098885] [2023-12-16 19:19:17,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:17,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:17,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:17,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:17,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:17,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:17,716 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:17,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:17,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853098885] [2023-12-16 19:19:17,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853098885] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:17,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:17,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:17,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038137061] [2023-12-16 19:19:17,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:17,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:17,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:17,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:17,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:17,721 INFO L87 Difference]: Start difference. First operand 655 states and 1069 transitions. Second operand has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:17,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:17,972 INFO L93 Difference]: Finished difference Result 1186 states and 1932 transitions. [2023-12-16 19:19:17,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:17,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 226 [2023-12-16 19:19:17,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:17,975 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:17,975 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:17,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:17,976 INFO L413 NwaCegarLoop]: 952 mSDtfsCounter, 1883 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1886 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:17,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1886 Valid, 1906 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:19:17,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:17,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:17,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.633846153846154) internal successors, (1062), 650 states have internal predecessors, (1062), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:17,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1068 transitions. [2023-12-16 19:19:17,994 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1068 transitions. Word has length 226 [2023-12-16 19:19:17,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:17,995 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1068 transitions. [2023-12-16 19:19:17,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:17,995 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1068 transitions. [2023-12-16 19:19:17,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2023-12-16 19:19:17,997 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:17,997 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:17,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-16 19:19:17,998 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:17,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:17,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1431636046, now seen corresponding path program 1 times [2023-12-16 19:19:17,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:17,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866406040] [2023-12-16 19:19:17,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:17,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:18,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:18,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:18,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:18,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:18,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:18,318 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:18,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:18,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866406040] [2023-12-16 19:19:18,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866406040] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:18,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:18,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:18,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323870933] [2023-12-16 19:19:18,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:18,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:18,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:18,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:18,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:18,320 INFO L87 Difference]: Start difference. First operand 655 states and 1068 transitions. Second operand has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:18,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:18,549 INFO L93 Difference]: Finished difference Result 1186 states and 1930 transitions. [2023-12-16 19:19:18,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:18,564 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 227 [2023-12-16 19:19:18,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:18,567 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:18,567 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:18,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:18,568 INFO L413 NwaCegarLoop]: 952 mSDtfsCounter, 1875 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1878 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:18,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1878 Valid, 1906 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:19:18,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:18,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:18,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.6323076923076922) internal successors, (1061), 650 states have internal predecessors, (1061), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:18,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1067 transitions. [2023-12-16 19:19:18,578 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1067 transitions. Word has length 227 [2023-12-16 19:19:18,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:18,578 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1067 transitions. [2023-12-16 19:19:18,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:18,579 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1067 transitions. [2023-12-16 19:19:18,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2023-12-16 19:19:18,580 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:18,580 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:18,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-16 19:19:18,580 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:18,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:18,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1403793000, now seen corresponding path program 1 times [2023-12-16 19:19:18,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:18,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184972080] [2023-12-16 19:19:18,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:18,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:19,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:19,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:19,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:19,039 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:19,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:19,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184972080] [2023-12-16 19:19:19,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184972080] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:19,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:19,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:19:19,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921820734] [2023-12-16 19:19:19,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:19,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:19:19,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:19,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:19:19,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:19,041 INFO L87 Difference]: Start difference. First operand 655 states and 1067 transitions. Second operand has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:19,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:19,090 INFO L93 Difference]: Finished difference Result 1186 states and 1928 transitions. [2023-12-16 19:19:19,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:19,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 228 [2023-12-16 19:19:19,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:19,092 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:19,092 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:19,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-16 19:19:19,093 INFO L413 NwaCegarLoop]: 1048 mSDtfsCounter, 932 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 2098 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:19,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [932 Valid, 2098 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:19:19,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:19,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:19,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.6307692307692307) internal successors, (1060), 650 states have internal predecessors, (1060), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:19,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1066 transitions. [2023-12-16 19:19:19,104 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1066 transitions. Word has length 228 [2023-12-16 19:19:19,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:19,104 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1066 transitions. [2023-12-16 19:19:19,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:19,104 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1066 transitions. [2023-12-16 19:19:19,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-12-16 19:19:19,106 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:19,106 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:19,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-16 19:19:19,107 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:19,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:19,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1074801750, now seen corresponding path program 1 times [2023-12-16 19:19:19,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:19,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202501362] [2023-12-16 19:19:19,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:19,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:19,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:19,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:19,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:19,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:19,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:19,429 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:19,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:19,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202501362] [2023-12-16 19:19:19,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202501362] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:19,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:19,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:19,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844600908] [2023-12-16 19:19:19,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:19,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:19,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:19,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:19,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:19,432 INFO L87 Difference]: Start difference. First operand 655 states and 1066 transitions. Second operand has 5 states, 5 states have (on average 43.4) internal successors, (217), 5 states have internal predecessors, (217), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:19,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:19,481 INFO L93 Difference]: Finished difference Result 1188 states and 1928 transitions. [2023-12-16 19:19:19,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:19:19,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.4) internal successors, (217), 5 states have internal predecessors, (217), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 229 [2023-12-16 19:19:19,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:19,484 INFO L225 Difference]: With dead ends: 1188 [2023-12-16 19:19:19,484 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:19,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 19:19:19,485 INFO L413 NwaCegarLoop]: 1059 mSDtfsCounter, 936 mSDsluCounter, 2112 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 3171 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:19,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 3171 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:19:19,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:19,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:19,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.6292307692307693) internal successors, (1059), 650 states have internal predecessors, (1059), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:19,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1065 transitions. [2023-12-16 19:19:19,494 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1065 transitions. Word has length 229 [2023-12-16 19:19:19,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:19,494 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1065 transitions. [2023-12-16 19:19:19,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.4) internal successors, (217), 5 states have internal predecessors, (217), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:19,495 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1065 transitions. [2023-12-16 19:19:19,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2023-12-16 19:19:19,495 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:19,496 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:19,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-16 19:19:19,496 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:19,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:19,496 INFO L85 PathProgramCache]: Analyzing trace with hash 984916338, now seen corresponding path program 1 times [2023-12-16 19:19:19,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:19,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395964601] [2023-12-16 19:19:19,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:19,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:19,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:19,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:19,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:19,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:19,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:19,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:19,992 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:19,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:19,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395964601] [2023-12-16 19:19:19,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395964601] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:19,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:19,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:19:19,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17185313] [2023-12-16 19:19:19,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:19,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:19:19,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:19,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:19:19,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:19,994 INFO L87 Difference]: Start difference. First operand 655 states and 1065 transitions. Second operand has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:20,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:20,126 INFO L93 Difference]: Finished difference Result 1186 states and 1924 transitions. [2023-12-16 19:19:20,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:20,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 230 [2023-12-16 19:19:20,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:20,128 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:20,129 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:20,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-16 19:19:20,130 INFO L413 NwaCegarLoop]: 998 mSDtfsCounter, 904 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 1998 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:20,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [904 Valid, 1998 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:20,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:20,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:20,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.6276923076923078) internal successors, (1058), 650 states have internal predecessors, (1058), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:20,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1064 transitions. [2023-12-16 19:19:20,143 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1064 transitions. Word has length 230 [2023-12-16 19:19:20,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:20,144 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1064 transitions. [2023-12-16 19:19:20,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:20,144 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1064 transitions. [2023-12-16 19:19:20,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2023-12-16 19:19:20,145 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:20,145 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:20,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-16 19:19:20,146 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:20,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:20,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1882401524, now seen corresponding path program 1 times [2023-12-16 19:19:20,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:20,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704877184] [2023-12-16 19:19:20,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:20,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:20,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:20,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:20,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:20,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:20,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:20,445 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:20,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:20,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704877184] [2023-12-16 19:19:20,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704877184] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:20,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:20,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:20,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912210481] [2023-12-16 19:19:20,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:20,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:20,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:20,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:20,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:20,447 INFO L87 Difference]: Start difference. First operand 655 states and 1064 transitions. Second operand has 5 states, 5 states have (on average 43.8) internal successors, (219), 5 states have internal predecessors, (219), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:20,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:20,557 INFO L93 Difference]: Finished difference Result 1200 states and 1942 transitions. [2023-12-16 19:19:20,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:19:20,557 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.8) internal successors, (219), 5 states have internal predecessors, (219), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 231 [2023-12-16 19:19:20,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:20,559 INFO L225 Difference]: With dead ends: 1200 [2023-12-16 19:19:20,559 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:20,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 19:19:20,561 INFO L413 NwaCegarLoop]: 1051 mSDtfsCounter, 932 mSDsluCounter, 2054 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 3105 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:20,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [932 Valid, 3105 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:20,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:20,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:20,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.626153846153846) internal successors, (1057), 650 states have internal predecessors, (1057), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:20,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1063 transitions. [2023-12-16 19:19:20,572 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1063 transitions. Word has length 231 [2023-12-16 19:19:20,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:20,572 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1063 transitions. [2023-12-16 19:19:20,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.8) internal successors, (219), 5 states have internal predecessors, (219), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:20,572 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1063 transitions. [2023-12-16 19:19:20,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2023-12-16 19:19:20,574 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:20,574 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:20,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-16 19:19:20,574 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:20,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:20,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1992246296, now seen corresponding path program 1 times [2023-12-16 19:19:20,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:20,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492127685] [2023-12-16 19:19:20,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:20,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:20,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:20,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:20,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:20,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:20,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:20,866 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:20,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:20,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492127685] [2023-12-16 19:19:20,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492127685] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:20,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:20,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:20,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456556317] [2023-12-16 19:19:20,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:20,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:20,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:20,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:20,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:20,868 INFO L87 Difference]: Start difference. First operand 655 states and 1063 transitions. Second operand has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:20,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:20,975 INFO L93 Difference]: Finished difference Result 1186 states and 1920 transitions. [2023-12-16 19:19:20,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:20,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 232 [2023-12-16 19:19:20,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:20,977 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:20,977 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:20,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:20,979 INFO L413 NwaCegarLoop]: 998 mSDtfsCounter, 1963 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1966 SdHoareTripleChecker+Valid, 1998 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:20,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1966 Valid, 1998 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:20,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:20,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:20,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.6246153846153846) internal successors, (1056), 650 states have internal predecessors, (1056), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:20,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1062 transitions. [2023-12-16 19:19:20,989 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1062 transitions. Word has length 232 [2023-12-16 19:19:20,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:20,989 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1062 transitions. [2023-12-16 19:19:20,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:20,989 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1062 transitions. [2023-12-16 19:19:20,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2023-12-16 19:19:20,990 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:20,990 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:20,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-16 19:19:20,990 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:20,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:20,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1138752090, now seen corresponding path program 1 times [2023-12-16 19:19:20,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:20,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146344157] [2023-12-16 19:19:20,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:20,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:21,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:21,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:21,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:21,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:21,312 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:21,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:21,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146344157] [2023-12-16 19:19:21,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146344157] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:21,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:21,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:21,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347743166] [2023-12-16 19:19:21,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:21,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:21,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:21,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:21,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:21,314 INFO L87 Difference]: Start difference. First operand 655 states and 1062 transitions. Second operand has 5 states, 5 states have (on average 44.2) internal successors, (221), 5 states have internal predecessors, (221), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:21,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:21,419 INFO L93 Difference]: Finished difference Result 1186 states and 1918 transitions. [2023-12-16 19:19:21,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:21,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.2) internal successors, (221), 5 states have internal predecessors, (221), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 233 [2023-12-16 19:19:21,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:21,422 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:21,422 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:21,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:21,423 INFO L413 NwaCegarLoop]: 998 mSDtfsCounter, 1955 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1958 SdHoareTripleChecker+Valid, 1998 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:21,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1958 Valid, 1998 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:21,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:21,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:21,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.623076923076923) internal successors, (1055), 650 states have internal predecessors, (1055), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:21,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1061 transitions. [2023-12-16 19:19:21,433 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1061 transitions. Word has length 233 [2023-12-16 19:19:21,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:21,433 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1061 transitions. [2023-12-16 19:19:21,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.2) internal successors, (221), 5 states have internal predecessors, (221), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:21,433 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1061 transitions. [2023-12-16 19:19:21,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2023-12-16 19:19:21,434 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:21,434 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:21,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-16 19:19:21,434 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:21,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:21,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1077527410, now seen corresponding path program 1 times [2023-12-16 19:19:21,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:21,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400416752] [2023-12-16 19:19:21,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:21,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:21,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:21,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:21,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:21,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:21,725 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:21,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:21,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400416752] [2023-12-16 19:19:21,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400416752] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:21,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:21,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:21,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038286934] [2023-12-16 19:19:21,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:21,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:21,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:21,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:21,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:21,728 INFO L87 Difference]: Start difference. First operand 655 states and 1061 transitions. Second operand has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:21,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:21,832 INFO L93 Difference]: Finished difference Result 1186 states and 1916 transitions. [2023-12-16 19:19:21,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:21,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 234 [2023-12-16 19:19:21,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:21,836 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:21,836 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:21,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:21,837 INFO L413 NwaCegarLoop]: 998 mSDtfsCounter, 1947 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1950 SdHoareTripleChecker+Valid, 1998 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:21,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1950 Valid, 1998 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:21,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:21,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:21,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.6215384615384616) internal successors, (1054), 650 states have internal predecessors, (1054), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:21,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1060 transitions. [2023-12-16 19:19:21,856 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1060 transitions. Word has length 234 [2023-12-16 19:19:21,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:21,857 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1060 transitions. [2023-12-16 19:19:21,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:21,857 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1060 transitions. [2023-12-16 19:19:21,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2023-12-16 19:19:21,858 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:21,858 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:21,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-16 19:19:21,859 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:21,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:21,859 INFO L85 PathProgramCache]: Analyzing trace with hash 465261760, now seen corresponding path program 1 times [2023-12-16 19:19:21,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:21,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001481313] [2023-12-16 19:19:21,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:21,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:22,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:22,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:22,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:22,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:22,186 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:22,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:22,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001481313] [2023-12-16 19:19:22,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001481313] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:22,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:22,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:22,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857747346] [2023-12-16 19:19:22,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:22,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:22,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:22,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:22,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:22,187 INFO L87 Difference]: Start difference. First operand 655 states and 1060 transitions. Second operand has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:22,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:22,283 INFO L93 Difference]: Finished difference Result 1186 states and 1914 transitions. [2023-12-16 19:19:22,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:22,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 235 [2023-12-16 19:19:22,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:22,285 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:22,285 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:22,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:22,286 INFO L413 NwaCegarLoop]: 998 mSDtfsCounter, 1041 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 2004 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:22,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1044 Valid, 2004 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:22,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:22,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:22,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.62) internal successors, (1053), 650 states have internal predecessors, (1053), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:22,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1059 transitions. [2023-12-16 19:19:22,298 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1059 transitions. Word has length 235 [2023-12-16 19:19:22,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:22,299 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1059 transitions. [2023-12-16 19:19:22,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:22,299 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1059 transitions. [2023-12-16 19:19:22,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2023-12-16 19:19:22,299 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:22,300 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:22,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-16 19:19:22,300 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:22,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:22,300 INFO L85 PathProgramCache]: Analyzing trace with hash -354674636, now seen corresponding path program 1 times [2023-12-16 19:19:22,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:22,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303703544] [2023-12-16 19:19:22,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:22,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:22,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:22,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:22,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:22,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:22,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:22,657 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:22,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:22,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303703544] [2023-12-16 19:19:22,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303703544] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:22,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:22,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:22,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169997676] [2023-12-16 19:19:22,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:22,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:22,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:22,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:22,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:22,659 INFO L87 Difference]: Start difference. First operand 655 states and 1059 transitions. Second operand has 5 states, 5 states have (on average 44.8) internal successors, (224), 5 states have internal predecessors, (224), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:22,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:22,764 INFO L93 Difference]: Finished difference Result 1186 states and 1912 transitions. [2023-12-16 19:19:22,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:22,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.8) internal successors, (224), 5 states have internal predecessors, (224), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 236 [2023-12-16 19:19:22,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:22,766 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:22,766 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:22,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:22,767 INFO L413 NwaCegarLoop]: 998 mSDtfsCounter, 1931 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1934 SdHoareTripleChecker+Valid, 1998 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:22,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1934 Valid, 1998 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:22,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:22,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:22,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.6184615384615384) internal successors, (1052), 650 states have internal predecessors, (1052), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:22,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1058 transitions. [2023-12-16 19:19:22,781 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1058 transitions. Word has length 236 [2023-12-16 19:19:22,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:22,781 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1058 transitions. [2023-12-16 19:19:22,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.8) internal successors, (224), 5 states have internal predecessors, (224), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:22,781 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1058 transitions. [2023-12-16 19:19:22,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2023-12-16 19:19:22,782 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:22,782 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:22,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-16 19:19:22,782 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:22,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:22,783 INFO L85 PathProgramCache]: Analyzing trace with hash -844580314, now seen corresponding path program 1 times [2023-12-16 19:19:22,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:22,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333919341] [2023-12-16 19:19:22,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:22,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:23,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:23,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:23,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:23,066 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:23,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:23,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333919341] [2023-12-16 19:19:23,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333919341] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:23,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:23,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:23,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159217328] [2023-12-16 19:19:23,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:23,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:23,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:23,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:23,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:23,068 INFO L87 Difference]: Start difference. First operand 655 states and 1058 transitions. Second operand has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:23,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:23,173 INFO L93 Difference]: Finished difference Result 1186 states and 1910 transitions. [2023-12-16 19:19:23,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:23,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 237 [2023-12-16 19:19:23,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:23,175 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:23,176 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:23,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:23,177 INFO L413 NwaCegarLoop]: 998 mSDtfsCounter, 1033 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 2004 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:23,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1036 Valid, 2004 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:23,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:23,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:23,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.616923076923077) internal successors, (1051), 650 states have internal predecessors, (1051), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:23,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1057 transitions. [2023-12-16 19:19:23,187 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1057 transitions. Word has length 237 [2023-12-16 19:19:23,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:23,187 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1057 transitions. [2023-12-16 19:19:23,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:23,187 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1057 transitions. [2023-12-16 19:19:23,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2023-12-16 19:19:23,188 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:23,188 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:23,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-16 19:19:23,189 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:23,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:23,189 INFO L85 PathProgramCache]: Analyzing trace with hash -524169510, now seen corresponding path program 1 times [2023-12-16 19:19:23,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:23,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754963546] [2023-12-16 19:19:23,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:23,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:23,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:23,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:23,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:23,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:23,577 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:23,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:23,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754963546] [2023-12-16 19:19:23,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754963546] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:23,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:23,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:19:23,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402086955] [2023-12-16 19:19:23,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:23,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:19:23,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:23,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:19:23,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:23,580 INFO L87 Difference]: Start difference. First operand 655 states and 1057 transitions. Second operand has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:23,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:23,645 INFO L93 Difference]: Finished difference Result 1186 states and 1908 transitions. [2023-12-16 19:19:23,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:23,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 238 [2023-12-16 19:19:23,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:23,647 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:23,647 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:23,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-16 19:19:23,648 INFO L413 NwaCegarLoop]: 1022 mSDtfsCounter, 916 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 2046 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:23,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 2046 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:19:23,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:23,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:23,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.6153846153846154) internal successors, (1050), 650 states have internal predecessors, (1050), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:23,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1056 transitions. [2023-12-16 19:19:23,658 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1056 transitions. Word has length 238 [2023-12-16 19:19:23,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:23,658 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1056 transitions. [2023-12-16 19:19:23,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:23,658 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1056 transitions. [2023-12-16 19:19:23,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2023-12-16 19:19:23,659 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:23,659 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:23,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-16 19:19:23,660 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:23,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:23,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1186052440, now seen corresponding path program 1 times [2023-12-16 19:19:23,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:23,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951976513] [2023-12-16 19:19:23,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:23,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:23,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:23,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:23,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:23,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:23,940 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:23,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:23,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951976513] [2023-12-16 19:19:23,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951976513] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:23,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:23,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:23,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075522397] [2023-12-16 19:19:23,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:23,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:23,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:23,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:23,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:23,942 INFO L87 Difference]: Start difference. First operand 655 states and 1056 transitions. Second operand has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:24,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:24,009 INFO L93 Difference]: Finished difference Result 1188 states and 1908 transitions. [2023-12-16 19:19:24,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:19:24,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 239 [2023-12-16 19:19:24,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:24,011 INFO L225 Difference]: With dead ends: 1188 [2023-12-16 19:19:24,011 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:24,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 19:19:24,012 INFO L413 NwaCegarLoop]: 1049 mSDtfsCounter, 920 mSDsluCounter, 2076 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 920 SdHoareTripleChecker+Valid, 3125 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:24,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [920 Valid, 3125 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:19:24,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:24,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:24,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.613846153846154) internal successors, (1049), 650 states have internal predecessors, (1049), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:24,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1055 transitions. [2023-12-16 19:19:24,022 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1055 transitions. Word has length 239 [2023-12-16 19:19:24,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:24,022 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1055 transitions. [2023-12-16 19:19:24,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:24,023 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1055 transitions. [2023-12-16 19:19:24,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2023-12-16 19:19:24,023 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:24,024 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:24,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-16 19:19:24,024 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:24,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:24,024 INFO L85 PathProgramCache]: Analyzing trace with hash -544802380, now seen corresponding path program 1 times [2023-12-16 19:19:24,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:24,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703288681] [2023-12-16 19:19:24,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:24,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:24,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:24,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:24,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:24,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:24,299 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:24,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:24,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703288681] [2023-12-16 19:19:24,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703288681] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:24,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:24,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:24,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797757159] [2023-12-16 19:19:24,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:24,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:24,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:24,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:24,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:24,301 INFO L87 Difference]: Start difference. First operand 655 states and 1055 transitions. Second operand has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:24,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:24,368 INFO L93 Difference]: Finished difference Result 1186 states and 1904 transitions. [2023-12-16 19:19:24,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:24,368 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 240 [2023-12-16 19:19:24,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:24,370 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:24,370 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:24,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:24,371 INFO L413 NwaCegarLoop]: 1022 mSDtfsCounter, 1042 mSDsluCounter, 1030 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 2052 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:24,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1045 Valid, 2052 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:19:24,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:24,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:24,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.6123076923076922) internal successors, (1048), 650 states have internal predecessors, (1048), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:24,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1054 transitions. [2023-12-16 19:19:24,381 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1054 transitions. Word has length 240 [2023-12-16 19:19:24,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:24,381 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1054 transitions. [2023-12-16 19:19:24,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:24,381 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1054 transitions. [2023-12-16 19:19:24,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2023-12-16 19:19:24,382 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:24,382 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:24,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-12-16 19:19:24,383 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:24,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:24,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1555586712, now seen corresponding path program 1 times [2023-12-16 19:19:24,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:24,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720758480] [2023-12-16 19:19:24,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:24,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:24,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:24,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:24,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:24,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:24,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:24,702 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:24,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:24,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720758480] [2023-12-16 19:19:24,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720758480] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:24,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:24,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:24,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225603067] [2023-12-16 19:19:24,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:24,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:24,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:24,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:24,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:24,704 INFO L87 Difference]: Start difference. First operand 655 states and 1054 transitions. Second operand has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:24,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:24,770 INFO L93 Difference]: Finished difference Result 1186 states and 1902 transitions. [2023-12-16 19:19:24,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:24,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 241 [2023-12-16 19:19:24,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:24,772 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:24,772 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:24,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:24,773 INFO L413 NwaCegarLoop]: 1022 mSDtfsCounter, 1038 mSDsluCounter, 1030 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1041 SdHoareTripleChecker+Valid, 2052 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:24,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1041 Valid, 2052 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:19:24,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:24,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:24,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.6107692307692307) internal successors, (1047), 650 states have internal predecessors, (1047), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:24,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1053 transitions. [2023-12-16 19:19:24,783 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1053 transitions. Word has length 241 [2023-12-16 19:19:24,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:24,783 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1053 transitions. [2023-12-16 19:19:24,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:24,783 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1053 transitions. [2023-12-16 19:19:24,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2023-12-16 19:19:24,784 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:24,784 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:24,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-12-16 19:19:24,784 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:24,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:24,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1094354546, now seen corresponding path program 1 times [2023-12-16 19:19:24,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:24,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714825230] [2023-12-16 19:19:24,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:24,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:25,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:25,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 19:19:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:25,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-16 19:19:25,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:25,178 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:25,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:25,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714825230] [2023-12-16 19:19:25,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714825230] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:25,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:25,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:19:25,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807583050] [2023-12-16 19:19:25,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:25,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:19:25,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:25,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:19:25,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:25,180 INFO L87 Difference]: Start difference. First operand 655 states and 1053 transitions. Second operand has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 19:19:25,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:25,220 INFO L93 Difference]: Finished difference Result 1186 states and 1900 transitions. [2023-12-16 19:19:25,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:25,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 242 [2023-12-16 19:19:25,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:25,222 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:25,222 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:25,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-16 19:19:25,224 INFO L413 NwaCegarLoop]: 1039 mSDtfsCounter, 956 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 958 SdHoareTripleChecker+Valid, 2080 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:25,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [958 Valid, 2080 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:19:25,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:25,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:25,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.6092307692307692) internal successors, (1046), 650 states have internal predecessors, (1046), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:25,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1052 transitions. [2023-12-16 19:19:25,234 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1052 transitions. Word has length 242 [2023-12-16 19:19:25,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:25,234 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1052 transitions. [2023-12-16 19:19:25,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 19:19:25,234 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1052 transitions. [2023-12-16 19:19:25,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2023-12-16 19:19:25,235 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:25,235 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:25,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-12-16 19:19:25,235 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:25,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:25,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1763849704, now seen corresponding path program 1 times [2023-12-16 19:19:25,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:25,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918543037] [2023-12-16 19:19:25,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:25,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:25,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:25,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:25,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:25,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:25,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:25,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:25,692 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:25,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:25,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918543037] [2023-12-16 19:19:25,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918543037] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:25,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:25,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:19:25,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834356399] [2023-12-16 19:19:25,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:25,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:19:25,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:25,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:19:25,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:25,694 INFO L87 Difference]: Start difference. First operand 655 states and 1052 transitions. Second operand has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:26,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:26,004 INFO L93 Difference]: Finished difference Result 1186 states and 1898 transitions. [2023-12-16 19:19:26,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:26,005 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 243 [2023-12-16 19:19:26,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:26,007 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:26,007 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:26,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-16 19:19:26,008 INFO L413 NwaCegarLoop]: 827 mSDtfsCounter, 918 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:26,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 1656 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 19:19:26,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:26,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:26,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.606153846153846) internal successors, (1044), 650 states have internal predecessors, (1044), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:26,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1050 transitions. [2023-12-16 19:19:26,020 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1050 transitions. Word has length 243 [2023-12-16 19:19:26,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:26,021 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1050 transitions. [2023-12-16 19:19:26,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:26,021 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1050 transitions. [2023-12-16 19:19:26,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:26,022 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:26,022 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:26,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-12-16 19:19:26,022 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:26,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:26,023 INFO L85 PathProgramCache]: Analyzing trace with hash -291499650, now seen corresponding path program 1 times [2023-12-16 19:19:26,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:26,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217876757] [2023-12-16 19:19:26,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:26,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:26,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:26,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:26,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:26,573 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:26,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:26,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217876757] [2023-12-16 19:19:26,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217876757] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:26,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:26,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:26,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426918958] [2023-12-16 19:19:26,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:26,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:26,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:26,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:26,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:26,575 INFO L87 Difference]: Start difference. First operand 655 states and 1050 transitions. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:26,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:26,665 INFO L93 Difference]: Finished difference Result 1186 states and 1894 transitions. [2023-12-16 19:19:26,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:26,666 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 244 [2023-12-16 19:19:26,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:26,670 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:26,670 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:26,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:26,673 INFO L413 NwaCegarLoop]: 1019 mSDtfsCounter, 908 mSDsluCounter, 2036 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 3055 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:26,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 3055 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:26,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:26,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:26,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.6046153846153846) internal successors, (1043), 650 states have internal predecessors, (1043), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:26,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1049 transitions. [2023-12-16 19:19:26,685 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1049 transitions. Word has length 244 [2023-12-16 19:19:26,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:26,685 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1049 transitions. [2023-12-16 19:19:26,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:26,686 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1049 transitions. [2023-12-16 19:19:26,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:26,686 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:26,687 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:26,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-12-16 19:19:26,687 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:26,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:26,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1175008640, now seen corresponding path program 1 times [2023-12-16 19:19:26,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:26,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121780504] [2023-12-16 19:19:26,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:26,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:27,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:27,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:27,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:27,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:27,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:27,262 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:27,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:27,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121780504] [2023-12-16 19:19:27,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121780504] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:27,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:27,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:27,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573780837] [2023-12-16 19:19:27,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:27,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:27,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:27,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:27,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:27,264 INFO L87 Difference]: Start difference. First operand 655 states and 1049 transitions. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:27,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:27,339 INFO L93 Difference]: Finished difference Result 1186 states and 1892 transitions. [2023-12-16 19:19:27,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:27,339 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 244 [2023-12-16 19:19:27,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:27,341 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:27,341 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:27,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:27,343 INFO L413 NwaCegarLoop]: 1019 mSDtfsCounter, 1807 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1807 SdHoareTripleChecker+Valid, 2040 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:27,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1807 Valid, 2040 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:19:27,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:27,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:27,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.603076923076923) internal successors, (1042), 650 states have internal predecessors, (1042), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:27,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1048 transitions. [2023-12-16 19:19:27,355 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1048 transitions. Word has length 244 [2023-12-16 19:19:27,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:27,355 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1048 transitions. [2023-12-16 19:19:27,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:27,355 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1048 transitions. [2023-12-16 19:19:27,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:27,356 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:27,356 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:27,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-12-16 19:19:27,357 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:27,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:27,357 INFO L85 PathProgramCache]: Analyzing trace with hash 702054590, now seen corresponding path program 1 times [2023-12-16 19:19:27,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:27,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821283856] [2023-12-16 19:19:27,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:27,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:27,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:27,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:27,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:27,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:27,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:27,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:27,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:27,870 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:27,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:27,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821283856] [2023-12-16 19:19:27,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821283856] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:27,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:27,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:27,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143721472] [2023-12-16 19:19:27,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:27,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:27,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:27,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:27,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:27,872 INFO L87 Difference]: Start difference. First operand 655 states and 1048 transitions. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:27,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:27,946 INFO L93 Difference]: Finished difference Result 1186 states and 1890 transitions. [2023-12-16 19:19:27,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:27,947 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 244 [2023-12-16 19:19:27,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:27,949 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:27,949 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:27,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:27,950 INFO L413 NwaCegarLoop]: 1019 mSDtfsCounter, 904 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 2046 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:27,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [904 Valid, 2046 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:19:27,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:27,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:27,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.6015384615384616) internal successors, (1041), 650 states have internal predecessors, (1041), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:27,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1047 transitions. [2023-12-16 19:19:27,960 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1047 transitions. Word has length 244 [2023-12-16 19:19:27,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:27,960 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1047 transitions. [2023-12-16 19:19:27,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:27,960 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1047 transitions. [2023-12-16 19:19:27,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:27,961 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:27,961 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:27,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-12-16 19:19:27,961 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:27,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:27,962 INFO L85 PathProgramCache]: Analyzing trace with hash 115778368, now seen corresponding path program 1 times [2023-12-16 19:19:27,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:27,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052542854] [2023-12-16 19:19:27,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:27,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:28,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:28,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:28,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:28,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:28,474 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:28,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:28,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052542854] [2023-12-16 19:19:28,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052542854] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:28,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:28,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:28,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18445575] [2023-12-16 19:19:28,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:28,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:28,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:28,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:28,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:28,476 INFO L87 Difference]: Start difference. First operand 655 states and 1047 transitions. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:28,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:28,586 INFO L93 Difference]: Finished difference Result 1186 states and 1888 transitions. [2023-12-16 19:19:28,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:28,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 244 [2023-12-16 19:19:28,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:28,595 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:28,596 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:28,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:28,597 INFO L413 NwaCegarLoop]: 988 mSDtfsCounter, 894 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 1978 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:28,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 1978 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:28,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:28,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:28,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.6) internal successors, (1040), 650 states have internal predecessors, (1040), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:28,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1046 transitions. [2023-12-16 19:19:28,608 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1046 transitions. Word has length 244 [2023-12-16 19:19:28,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:28,608 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1046 transitions. [2023-12-16 19:19:28,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:28,608 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1046 transitions. [2023-12-16 19:19:28,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:28,609 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:28,609 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:28,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-12-16 19:19:28,610 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:28,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:28,610 INFO L85 PathProgramCache]: Analyzing trace with hash -942059710, now seen corresponding path program 1 times [2023-12-16 19:19:28,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:28,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374520065] [2023-12-16 19:19:28,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:28,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:29,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:29,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:29,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:29,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:29,048 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:29,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:29,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374520065] [2023-12-16 19:19:29,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374520065] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:29,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:29,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:29,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595907666] [2023-12-16 19:19:29,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:29,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:29,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:29,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:29,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:29,051 INFO L87 Difference]: Start difference. First operand 655 states and 1046 transitions. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:29,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:29,170 INFO L93 Difference]: Finished difference Result 1186 states and 1886 transitions. [2023-12-16 19:19:29,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:29,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 244 [2023-12-16 19:19:29,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:29,172 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:29,172 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:29,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:29,173 INFO L413 NwaCegarLoop]: 988 mSDtfsCounter, 890 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 1984 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:29,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [890 Valid, 1984 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:29,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:29,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:29,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.5984615384615384) internal successors, (1039), 650 states have internal predecessors, (1039), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:29,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1045 transitions. [2023-12-16 19:19:29,183 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1045 transitions. Word has length 244 [2023-12-16 19:19:29,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:29,184 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1045 transitions. [2023-12-16 19:19:29,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:29,184 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1045 transitions. [2023-12-16 19:19:29,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:29,185 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:29,185 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:29,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-12-16 19:19:29,185 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:29,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:29,185 INFO L85 PathProgramCache]: Analyzing trace with hash -103026048, now seen corresponding path program 1 times [2023-12-16 19:19:29,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:29,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058021528] [2023-12-16 19:19:29,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:29,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:29,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:29,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:29,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:29,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:29,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:29,602 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:29,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:29,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058021528] [2023-12-16 19:19:29,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058021528] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:29,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:29,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:29,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858783692] [2023-12-16 19:19:29,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:29,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:29,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:29,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:29,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:29,604 INFO L87 Difference]: Start difference. First operand 655 states and 1045 transitions. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:29,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:29,715 INFO L93 Difference]: Finished difference Result 1186 states and 1884 transitions. [2023-12-16 19:19:29,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:29,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 244 [2023-12-16 19:19:29,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:29,717 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:29,717 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:29,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:29,718 INFO L413 NwaCegarLoop]: 988 mSDtfsCounter, 889 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 1984 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:29,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 1984 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:29,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:29,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:29,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.596923076923077) internal successors, (1038), 650 states have internal predecessors, (1038), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:29,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1044 transitions. [2023-12-16 19:19:29,728 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1044 transitions. Word has length 244 [2023-12-16 19:19:29,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:29,728 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1044 transitions. [2023-12-16 19:19:29,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:29,729 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1044 transitions. [2023-12-16 19:19:29,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:29,729 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:29,730 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:29,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-12-16 19:19:29,730 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:29,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:29,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1631078402, now seen corresponding path program 1 times [2023-12-16 19:19:29,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:29,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584295078] [2023-12-16 19:19:29,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:29,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:29,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:30,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:30,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:30,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:30,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:30,176 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:30,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:30,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584295078] [2023-12-16 19:19:30,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584295078] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:30,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:30,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:30,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537051932] [2023-12-16 19:19:30,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:30,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:30,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:30,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:30,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:30,178 INFO L87 Difference]: Start difference. First operand 655 states and 1044 transitions. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:30,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:30,290 INFO L93 Difference]: Finished difference Result 1186 states and 1882 transitions. [2023-12-16 19:19:30,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:30,290 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 244 [2023-12-16 19:19:30,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:30,291 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:30,291 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:30,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:30,293 INFO L413 NwaCegarLoop]: 988 mSDtfsCounter, 1767 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1767 SdHoareTripleChecker+Valid, 1978 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:30,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1767 Valid, 1978 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:30,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:30,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:30,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.5953846153846154) internal successors, (1037), 650 states have internal predecessors, (1037), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:30,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1043 transitions. [2023-12-16 19:19:30,303 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1043 transitions. Word has length 244 [2023-12-16 19:19:30,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:30,303 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1043 transitions. [2023-12-16 19:19:30,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:30,303 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1043 transitions. [2023-12-16 19:19:30,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:30,304 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:30,304 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:30,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-12-16 19:19:30,305 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:30,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:30,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1707979200, now seen corresponding path program 1 times [2023-12-16 19:19:30,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:30,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309459717] [2023-12-16 19:19:30,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:30,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:30,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:30,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:30,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:30,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:30,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:30,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:30,826 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:30,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:30,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309459717] [2023-12-16 19:19:30,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309459717] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:30,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:30,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:19:30,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060793095] [2023-12-16 19:19:30,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:30,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:19:30,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:30,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:19:30,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:30,828 INFO L87 Difference]: Start difference. First operand 655 states and 1043 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:30,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:30,920 INFO L93 Difference]: Finished difference Result 1186 states and 1880 transitions. [2023-12-16 19:19:30,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:30,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 244 [2023-12-16 19:19:30,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:30,922 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:30,922 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:30,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-16 19:19:30,923 INFO L413 NwaCegarLoop]: 988 mSDtfsCounter, 876 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 1978 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:30,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 1978 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:30,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:30,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:30,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.593846153846154) internal successors, (1036), 650 states have internal predecessors, (1036), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:30,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1042 transitions. [2023-12-16 19:19:30,935 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1042 transitions. Word has length 244 [2023-12-16 19:19:30,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:30,935 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1042 transitions. [2023-12-16 19:19:30,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:30,935 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1042 transitions. [2023-12-16 19:19:30,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:30,936 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:30,936 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:30,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-12-16 19:19:30,936 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:30,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:30,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1215353026, now seen corresponding path program 1 times [2023-12-16 19:19:30,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:30,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936672165] [2023-12-16 19:19:30,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:30,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:31,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:31,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:31,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:31,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:31,408 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:31,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:31,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936672165] [2023-12-16 19:19:31,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936672165] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:31,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:31,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:31,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950942830] [2023-12-16 19:19:31,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:31,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:31,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:31,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:31,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:31,410 INFO L87 Difference]: Start difference. First operand 655 states and 1042 transitions. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:31,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:31,521 INFO L93 Difference]: Finished difference Result 1186 states and 1878 transitions. [2023-12-16 19:19:31,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:31,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 244 [2023-12-16 19:19:31,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:31,523 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:31,523 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:31,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:31,524 INFO L413 NwaCegarLoop]: 988 mSDtfsCounter, 886 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 1984 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:31,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 1984 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:31,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:31,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:31,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.5923076923076922) internal successors, (1035), 650 states have internal predecessors, (1035), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:31,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1041 transitions. [2023-12-16 19:19:31,548 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1041 transitions. Word has length 244 [2023-12-16 19:19:31,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:31,548 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1041 transitions. [2023-12-16 19:19:31,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:31,548 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1041 transitions. [2023-12-16 19:19:31,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:31,549 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:31,549 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:31,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-12-16 19:19:31,550 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:31,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:31,550 INFO L85 PathProgramCache]: Analyzing trace with hash 483385600, now seen corresponding path program 1 times [2023-12-16 19:19:31,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:31,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009436916] [2023-12-16 19:19:31,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:31,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:31,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:31,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:31,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:31,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:31,973 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:31,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:31,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009436916] [2023-12-16 19:19:31,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009436916] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:31,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:31,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:31,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344889015] [2023-12-16 19:19:31,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:31,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:31,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:31,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:31,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:31,989 INFO L87 Difference]: Start difference. First operand 655 states and 1041 transitions. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:32,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:32,145 INFO L93 Difference]: Finished difference Result 1186 states and 1876 transitions. [2023-12-16 19:19:32,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:32,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 244 [2023-12-16 19:19:32,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:32,147 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:32,147 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:32,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:32,153 INFO L413 NwaCegarLoop]: 988 mSDtfsCounter, 1752 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1752 SdHoareTripleChecker+Valid, 1978 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:32,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1752 Valid, 1978 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:32,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:32,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:32,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.5907692307692307) internal successors, (1034), 650 states have internal predecessors, (1034), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:32,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1040 transitions. [2023-12-16 19:19:32,166 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1040 transitions. Word has length 244 [2023-12-16 19:19:32,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:32,168 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1040 transitions. [2023-12-16 19:19:32,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:32,168 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1040 transitions. [2023-12-16 19:19:32,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:32,169 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:32,169 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:32,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2023-12-16 19:19:32,170 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:32,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:32,170 INFO L85 PathProgramCache]: Analyzing trace with hash 65988994, now seen corresponding path program 1 times [2023-12-16 19:19:32,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:32,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903076871] [2023-12-16 19:19:32,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:32,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:32,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:32,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:32,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:32,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:32,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:32,499 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:32,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:32,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903076871] [2023-12-16 19:19:32,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903076871] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:32,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:32,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:19:32,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500477169] [2023-12-16 19:19:32,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:32,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:19:32,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:32,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:19:32,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:32,504 INFO L87 Difference]: Start difference. First operand 655 states and 1040 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 19:19:32,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:32,574 INFO L93 Difference]: Finished difference Result 1186 states and 1874 transitions. [2023-12-16 19:19:32,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:32,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 244 [2023-12-16 19:19:32,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:32,575 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:32,575 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:32,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-16 19:19:32,577 INFO L413 NwaCegarLoop]: 1027 mSDtfsCounter, 941 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 943 SdHoareTripleChecker+Valid, 2056 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:32,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [943 Valid, 2056 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:19:32,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:32,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:32,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.5892307692307692) internal successors, (1033), 650 states have internal predecessors, (1033), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:32,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1039 transitions. [2023-12-16 19:19:32,609 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1039 transitions. Word has length 244 [2023-12-16 19:19:32,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:32,610 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1039 transitions. [2023-12-16 19:19:32,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 19:19:32,610 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1039 transitions. [2023-12-16 19:19:32,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:32,611 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:32,611 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:32,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2023-12-16 19:19:32,611 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:32,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:32,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1997114628, now seen corresponding path program 1 times [2023-12-16 19:19:32,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:32,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82955443] [2023-12-16 19:19:32,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:32,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:32,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:32,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:32,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:32,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:32,988 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:32,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:32,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82955443] [2023-12-16 19:19:32,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82955443] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:32,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:32,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:19:32,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798114930] [2023-12-16 19:19:32,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:32,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:19:32,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:32,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:19:32,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:32,990 INFO L87 Difference]: Start difference. First operand 655 states and 1039 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:33,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:33,030 INFO L93 Difference]: Finished difference Result 1186 states and 1872 transitions. [2023-12-16 19:19:33,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:33,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 244 [2023-12-16 19:19:33,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:33,032 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:33,032 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:33,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-16 19:19:33,033 INFO L413 NwaCegarLoop]: 1022 mSDtfsCounter, 902 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 902 SdHoareTripleChecker+Valid, 2046 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:33,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [902 Valid, 2046 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:19:33,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:33,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:33,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.5876923076923077) internal successors, (1032), 650 states have internal predecessors, (1032), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:33,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1038 transitions. [2023-12-16 19:19:33,043 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1038 transitions. Word has length 244 [2023-12-16 19:19:33,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:33,043 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1038 transitions. [2023-12-16 19:19:33,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:33,044 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1038 transitions. [2023-12-16 19:19:33,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:33,044 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:33,045 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:33,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2023-12-16 19:19:33,045 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:33,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:33,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1266811770, now seen corresponding path program 1 times [2023-12-16 19:19:33,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:33,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629470820] [2023-12-16 19:19:33,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:33,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:33,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:33,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:33,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:33,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:33,404 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:33,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:33,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629470820] [2023-12-16 19:19:33,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629470820] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:33,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:33,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:19:33,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465460245] [2023-12-16 19:19:33,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:33,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:19:33,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:33,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:19:33,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:33,408 INFO L87 Difference]: Start difference. First operand 655 states and 1038 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:33,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:33,644 INFO L93 Difference]: Finished difference Result 1186 states and 1870 transitions. [2023-12-16 19:19:33,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:33,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 244 [2023-12-16 19:19:33,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:33,649 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:33,649 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:33,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-16 19:19:33,650 INFO L413 NwaCegarLoop]: 923 mSDtfsCounter, 859 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 1848 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:33,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 1848 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:19:33,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:33,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:33,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.5861538461538462) internal successors, (1031), 650 states have internal predecessors, (1031), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:33,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1037 transitions. [2023-12-16 19:19:33,666 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1037 transitions. Word has length 244 [2023-12-16 19:19:33,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:33,667 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1037 transitions. [2023-12-16 19:19:33,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:33,667 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1037 transitions. [2023-12-16 19:19:33,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:33,668 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:33,668 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:33,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2023-12-16 19:19:33,668 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:33,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:33,668 INFO L85 PathProgramCache]: Analyzing trace with hash -5894520, now seen corresponding path program 1 times [2023-12-16 19:19:33,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:33,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480242409] [2023-12-16 19:19:33,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:33,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:33,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:34,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:34,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:34,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:34,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:34,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:34,101 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:34,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:34,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480242409] [2023-12-16 19:19:34,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480242409] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:34,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:34,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:34,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046154553] [2023-12-16 19:19:34,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:34,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:34,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:34,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:34,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:34,103 INFO L87 Difference]: Start difference. First operand 655 states and 1037 transitions. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:34,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:34,307 INFO L93 Difference]: Finished difference Result 1186 states and 1868 transitions. [2023-12-16 19:19:34,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:34,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 244 [2023-12-16 19:19:34,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:34,309 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:34,309 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:34,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:34,310 INFO L413 NwaCegarLoop]: 923 mSDtfsCounter, 857 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 1854 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:34,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 1854 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:19:34,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:34,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:34,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.5846153846153845) internal successors, (1030), 650 states have internal predecessors, (1030), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:34,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1036 transitions. [2023-12-16 19:19:34,323 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1036 transitions. Word has length 244 [2023-12-16 19:19:34,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:34,323 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1036 transitions. [2023-12-16 19:19:34,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:34,323 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1036 transitions. [2023-12-16 19:19:34,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:34,325 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:34,325 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:34,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2023-12-16 19:19:34,325 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:34,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:34,326 INFO L85 PathProgramCache]: Analyzing trace with hash 870124486, now seen corresponding path program 1 times [2023-12-16 19:19:34,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:34,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392598298] [2023-12-16 19:19:34,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:34,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:34,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:34,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:34,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:34,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:34,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:34,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:34,786 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:34,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:34,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392598298] [2023-12-16 19:19:34,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392598298] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:34,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:34,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:34,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363031731] [2023-12-16 19:19:34,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:34,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:34,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:34,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:34,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:34,788 INFO L87 Difference]: Start difference. First operand 655 states and 1036 transitions. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:34,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:34,973 INFO L93 Difference]: Finished difference Result 1186 states and 1866 transitions. [2023-12-16 19:19:34,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:34,973 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 244 [2023-12-16 19:19:34,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:34,974 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:34,975 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:34,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:34,975 INFO L413 NwaCegarLoop]: 923 mSDtfsCounter, 1706 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1706 SdHoareTripleChecker+Valid, 1848 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:34,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1706 Valid, 1848 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:19:34,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:34,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:34,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.583076923076923) internal successors, (1029), 650 states have internal predecessors, (1029), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:34,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1035 transitions. [2023-12-16 19:19:34,985 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1035 transitions. Word has length 244 [2023-12-16 19:19:34,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:34,985 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1035 transitions. [2023-12-16 19:19:34,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:34,985 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1035 transitions. [2023-12-16 19:19:34,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:34,986 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:34,986 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:34,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2023-12-16 19:19:34,986 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:34,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:34,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1158461624, now seen corresponding path program 1 times [2023-12-16 19:19:34,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:34,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541893259] [2023-12-16 19:19:34,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:34,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:35,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:35,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:35,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:35,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:35,463 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:35,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:35,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541893259] [2023-12-16 19:19:35,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541893259] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:35,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:35,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:35,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212751958] [2023-12-16 19:19:35,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:35,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:35,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:35,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:35,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:35,465 INFO L87 Difference]: Start difference. First operand 655 states and 1035 transitions. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:35,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:35,658 INFO L93 Difference]: Finished difference Result 1186 states and 1864 transitions. [2023-12-16 19:19:35,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:35,658 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 244 [2023-12-16 19:19:35,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:35,659 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:35,659 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:35,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:35,660 INFO L413 NwaCegarLoop]: 923 mSDtfsCounter, 855 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 1854 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:35,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [855 Valid, 1854 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:19:35,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:35,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:35,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.5815384615384616) internal successors, (1028), 650 states have internal predecessors, (1028), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:35,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1034 transitions. [2023-12-16 19:19:35,670 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1034 transitions. Word has length 244 [2023-12-16 19:19:35,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:35,671 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1034 transitions. [2023-12-16 19:19:35,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:35,671 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1034 transitions. [2023-12-16 19:19:35,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:35,672 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:35,672 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:35,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2023-12-16 19:19:35,672 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:35,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:35,672 INFO L85 PathProgramCache]: Analyzing trace with hash 780700422, now seen corresponding path program 1 times [2023-12-16 19:19:35,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:35,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978143829] [2023-12-16 19:19:35,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:35,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:36,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:36,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:36,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:36,089 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:36,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:36,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978143829] [2023-12-16 19:19:36,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978143829] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:36,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:36,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:36,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754404070] [2023-12-16 19:19:36,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:36,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:36,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:36,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:36,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:36,094 INFO L87 Difference]: Start difference. First operand 655 states and 1034 transitions. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:36,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:36,277 INFO L93 Difference]: Finished difference Result 1186 states and 1862 transitions. [2023-12-16 19:19:36,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:36,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 244 [2023-12-16 19:19:36,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:36,278 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:36,278 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:36,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:36,279 INFO L413 NwaCegarLoop]: 923 mSDtfsCounter, 854 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 1854 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:36,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 1854 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:19:36,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:36,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:36,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.58) internal successors, (1027), 650 states have internal predecessors, (1027), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:36,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1033 transitions. [2023-12-16 19:19:36,288 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1033 transitions. Word has length 244 [2023-12-16 19:19:36,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:36,289 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1033 transitions. [2023-12-16 19:19:36,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:36,289 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1033 transitions. [2023-12-16 19:19:36,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:36,290 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:36,290 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:36,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2023-12-16 19:19:36,290 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:36,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:36,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1674186760, now seen corresponding path program 1 times [2023-12-16 19:19:36,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:36,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850705112] [2023-12-16 19:19:36,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:36,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:36,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:36,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:36,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:36,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:36,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:36,739 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:36,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:36,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850705112] [2023-12-16 19:19:36,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850705112] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:36,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:36,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:36,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785299843] [2023-12-16 19:19:36,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:36,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:36,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:36,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:36,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:36,741 INFO L87 Difference]: Start difference. First operand 655 states and 1033 transitions. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:36,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:36,922 INFO L93 Difference]: Finished difference Result 1186 states and 1860 transitions. [2023-12-16 19:19:36,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:36,922 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 244 [2023-12-16 19:19:36,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:36,923 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:36,923 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:36,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:36,924 INFO L413 NwaCegarLoop]: 923 mSDtfsCounter, 1691 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1691 SdHoareTripleChecker+Valid, 1848 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:36,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1691 Valid, 1848 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:36,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:36,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:36,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.5784615384615384) internal successors, (1026), 650 states have internal predecessors, (1026), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:36,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1032 transitions. [2023-12-16 19:19:36,936 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1032 transitions. Word has length 244 [2023-12-16 19:19:36,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:36,938 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1032 transitions. [2023-12-16 19:19:36,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:36,939 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1032 transitions. [2023-12-16 19:19:36,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:36,939 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:36,940 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:36,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2023-12-16 19:19:36,940 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:36,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:36,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1922333254, now seen corresponding path program 1 times [2023-12-16 19:19:36,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:36,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475505330] [2023-12-16 19:19:36,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:36,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:37,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:37,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:37,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:37,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:37,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:37,349 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:37,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:37,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475505330] [2023-12-16 19:19:37,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475505330] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:37,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:37,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:37,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712442370] [2023-12-16 19:19:37,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:37,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:37,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:37,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:37,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:37,353 INFO L87 Difference]: Start difference. First operand 655 states and 1032 transitions. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:37,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:37,567 INFO L93 Difference]: Finished difference Result 1186 states and 1858 transitions. [2023-12-16 19:19:37,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:37,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 244 [2023-12-16 19:19:37,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:37,570 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:37,570 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:37,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:37,572 INFO L413 NwaCegarLoop]: 923 mSDtfsCounter, 1686 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1686 SdHoareTripleChecker+Valid, 1848 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:37,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1686 Valid, 1848 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:19:37,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:37,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:37,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.5769230769230769) internal successors, (1025), 650 states have internal predecessors, (1025), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:37,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1031 transitions. [2023-12-16 19:19:37,596 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1031 transitions. Word has length 244 [2023-12-16 19:19:37,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:37,596 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1031 transitions. [2023-12-16 19:19:37,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:37,597 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1031 transitions. [2023-12-16 19:19:37,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:37,598 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:37,598 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:37,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2023-12-16 19:19:37,598 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:37,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:37,599 INFO L85 PathProgramCache]: Analyzing trace with hash 76966088, now seen corresponding path program 1 times [2023-12-16 19:19:37,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:37,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938971137] [2023-12-16 19:19:37,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:37,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:38,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:38,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:38,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:38,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:38,146 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:38,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:38,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938971137] [2023-12-16 19:19:38,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938971137] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:38,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:38,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:38,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079542594] [2023-12-16 19:19:38,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:38,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:38,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:38,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:38,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:38,148 INFO L87 Difference]: Start difference. First operand 655 states and 1031 transitions. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:38,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:38,358 INFO L93 Difference]: Finished difference Result 1186 states and 1856 transitions. [2023-12-16 19:19:38,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:38,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 244 [2023-12-16 19:19:38,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:38,361 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:38,361 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:38,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:38,362 INFO L413 NwaCegarLoop]: 923 mSDtfsCounter, 851 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 1854 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:38,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 1854 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:19:38,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:38,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:38,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.5753846153846154) internal successors, (1024), 650 states have internal predecessors, (1024), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:38,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1030 transitions. [2023-12-16 19:19:38,377 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1030 transitions. Word has length 244 [2023-12-16 19:19:38,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:38,377 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1030 transitions. [2023-12-16 19:19:38,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:38,378 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1030 transitions. [2023-12-16 19:19:38,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:38,379 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:38,379 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:38,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2023-12-16 19:19:38,379 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:38,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:38,380 INFO L85 PathProgramCache]: Analyzing trace with hash -317400698, now seen corresponding path program 1 times [2023-12-16 19:19:38,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:38,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653015748] [2023-12-16 19:19:38,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:38,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:38,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:38,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:38,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:38,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:38,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:38,946 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:38,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:38,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653015748] [2023-12-16 19:19:38,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653015748] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:38,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:38,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:38,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888454539] [2023-12-16 19:19:38,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:38,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:38,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:38,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:38,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:38,948 INFO L87 Difference]: Start difference. First operand 655 states and 1030 transitions. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:39,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:39,184 INFO L93 Difference]: Finished difference Result 1186 states and 1854 transitions. [2023-12-16 19:19:39,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:39,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 244 [2023-12-16 19:19:39,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:39,186 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:39,186 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:39,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:39,187 INFO L413 NwaCegarLoop]: 923 mSDtfsCounter, 850 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 1854 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:39,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 1854 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:19:39,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:39,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:39,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.573846153846154) internal successors, (1023), 650 states have internal predecessors, (1023), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:39,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1029 transitions. [2023-12-16 19:19:39,205 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1029 transitions. Word has length 244 [2023-12-16 19:19:39,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:39,206 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1029 transitions. [2023-12-16 19:19:39,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:39,206 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1029 transitions. [2023-12-16 19:19:39,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:39,207 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:39,207 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:39,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2023-12-16 19:19:39,207 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:39,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:39,208 INFO L85 PathProgramCache]: Analyzing trace with hash -389787256, now seen corresponding path program 1 times [2023-12-16 19:19:39,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:39,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702576926] [2023-12-16 19:19:39,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:39,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:39,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:39,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:39,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:39,751 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:39,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:39,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702576926] [2023-12-16 19:19:39,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702576926] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:39,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:39,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:39,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424758049] [2023-12-16 19:19:39,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:39,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:39,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:39,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:39,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:39,753 INFO L87 Difference]: Start difference. First operand 655 states and 1029 transitions. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:39,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:39,936 INFO L93 Difference]: Finished difference Result 1186 states and 1852 transitions. [2023-12-16 19:19:39,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:39,937 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 244 [2023-12-16 19:19:39,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:39,938 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:39,938 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:39,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:39,939 INFO L413 NwaCegarLoop]: 923 mSDtfsCounter, 849 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 1854 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:39,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 1854 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:39,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:39,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:39,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.5723076923076924) internal successors, (1022), 650 states have internal predecessors, (1022), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:39,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1028 transitions. [2023-12-16 19:19:39,950 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1028 transitions. Word has length 244 [2023-12-16 19:19:39,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:39,950 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1028 transitions. [2023-12-16 19:19:39,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:39,950 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1028 transitions. [2023-12-16 19:19:39,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:39,951 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:39,951 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:39,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2023-12-16 19:19:39,951 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:39,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:39,952 INFO L85 PathProgramCache]: Analyzing trace with hash -367155002, now seen corresponding path program 1 times [2023-12-16 19:19:39,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:39,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110161694] [2023-12-16 19:19:39,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:39,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:40,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:40,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:40,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:40,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:40,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:40,393 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:40,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:40,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110161694] [2023-12-16 19:19:40,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110161694] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:40,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:40,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:40,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997519621] [2023-12-16 19:19:40,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:40,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:40,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:40,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:40,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:40,395 INFO L87 Difference]: Start difference. First operand 655 states and 1028 transitions. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:40,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:40,575 INFO L93 Difference]: Finished difference Result 1186 states and 1850 transitions. [2023-12-16 19:19:40,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:40,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 244 [2023-12-16 19:19:40,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:40,576 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:40,576 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:40,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:40,577 INFO L413 NwaCegarLoop]: 923 mSDtfsCounter, 1666 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1666 SdHoareTripleChecker+Valid, 1848 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:40,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1666 Valid, 1848 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:40,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:40,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:40,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.5707692307692307) internal successors, (1021), 650 states have internal predecessors, (1021), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:40,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1027 transitions. [2023-12-16 19:19:40,588 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1027 transitions. Word has length 244 [2023-12-16 19:19:40,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:40,588 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1027 transitions. [2023-12-16 19:19:40,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:40,589 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1027 transitions. [2023-12-16 19:19:40,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:40,589 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:40,590 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:40,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2023-12-16 19:19:40,590 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:40,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:40,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1556073032, now seen corresponding path program 1 times [2023-12-16 19:19:40,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:40,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925605816] [2023-12-16 19:19:40,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:40,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:40,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:41,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:41,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:41,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:41,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:41,028 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:41,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:41,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925605816] [2023-12-16 19:19:41,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925605816] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:41,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:41,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:41,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367760221] [2023-12-16 19:19:41,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:41,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:41,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:41,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:41,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:41,031 INFO L87 Difference]: Start difference. First operand 655 states and 1027 transitions. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:41,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:41,229 INFO L93 Difference]: Finished difference Result 1186 states and 1848 transitions. [2023-12-16 19:19:41,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:41,229 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 244 [2023-12-16 19:19:41,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:41,232 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:41,232 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:41,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:41,234 INFO L413 NwaCegarLoop]: 923 mSDtfsCounter, 847 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 1854 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:41,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 1854 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:19:41,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:41,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:41,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.5692307692307692) internal successors, (1020), 650 states have internal predecessors, (1020), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:41,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1026 transitions. [2023-12-16 19:19:41,247 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1026 transitions. Word has length 244 [2023-12-16 19:19:41,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:41,247 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1026 transitions. [2023-12-16 19:19:41,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:41,247 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1026 transitions. [2023-12-16 19:19:41,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:41,248 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:41,249 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:41,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2023-12-16 19:19:41,249 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:41,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:41,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1422059526, now seen corresponding path program 1 times [2023-12-16 19:19:41,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:41,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628591116] [2023-12-16 19:19:41,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:41,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:41,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:41,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:41,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:41,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:41,720 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:41,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:41,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628591116] [2023-12-16 19:19:41,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628591116] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:41,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:41,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:41,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853086324] [2023-12-16 19:19:41,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:41,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:41,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:41,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:41,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:41,722 INFO L87 Difference]: Start difference. First operand 655 states and 1026 transitions. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:41,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:41,929 INFO L93 Difference]: Finished difference Result 1186 states and 1846 transitions. [2023-12-16 19:19:41,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:41,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 244 [2023-12-16 19:19:41,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:41,931 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:41,931 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:41,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:41,933 INFO L413 NwaCegarLoop]: 923 mSDtfsCounter, 846 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 1854 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:41,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 1854 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:19:41,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:41,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:41,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.5676923076923077) internal successors, (1019), 650 states have internal predecessors, (1019), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:41,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1025 transitions. [2023-12-16 19:19:41,943 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1025 transitions. Word has length 244 [2023-12-16 19:19:41,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:41,960 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1025 transitions. [2023-12-16 19:19:41,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:41,960 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1025 transitions. [2023-12-16 19:19:41,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:41,962 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:41,962 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:41,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2023-12-16 19:19:41,962 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:41,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:41,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1844761352, now seen corresponding path program 1 times [2023-12-16 19:19:41,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:41,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802589301] [2023-12-16 19:19:41,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:41,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:42,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:42,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:42,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:42,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:42,531 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:42,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:42,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802589301] [2023-12-16 19:19:42,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802589301] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:42,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:42,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:42,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942520593] [2023-12-16 19:19:42,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:42,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:42,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:42,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:42,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:42,532 INFO L87 Difference]: Start difference. First operand 655 states and 1025 transitions. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:42,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:42,705 INFO L93 Difference]: Finished difference Result 1186 states and 1844 transitions. [2023-12-16 19:19:42,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:42,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 244 [2023-12-16 19:19:42,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:42,706 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:42,706 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:42,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:42,707 INFO L413 NwaCegarLoop]: 923 mSDtfsCounter, 1651 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1651 SdHoareTripleChecker+Valid, 1848 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:42,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1651 Valid, 1848 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:42,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:42,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:42,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.5661538461538462) internal successors, (1018), 650 states have internal predecessors, (1018), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:42,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1024 transitions. [2023-12-16 19:19:42,716 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1024 transitions. Word has length 244 [2023-12-16 19:19:42,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:42,717 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1024 transitions. [2023-12-16 19:19:42,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:42,717 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1024 transitions. [2023-12-16 19:19:42,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:42,718 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:42,718 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:42,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2023-12-16 19:19:42,718 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:42,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:42,718 INFO L85 PathProgramCache]: Analyzing trace with hash -149383354, now seen corresponding path program 1 times [2023-12-16 19:19:42,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:42,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025825759] [2023-12-16 19:19:42,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:42,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:43,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:43,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:43,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:43,121 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:43,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:43,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025825759] [2023-12-16 19:19:43,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025825759] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:43,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:43,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:43,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922607568] [2023-12-16 19:19:43,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:43,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:43,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:43,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:43,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:43,122 INFO L87 Difference]: Start difference. First operand 655 states and 1024 transitions. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:43,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:43,292 INFO L93 Difference]: Finished difference Result 1186 states and 1842 transitions. [2023-12-16 19:19:43,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:43,292 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 244 [2023-12-16 19:19:43,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:43,293 INFO L225 Difference]: With dead ends: 1186 [2023-12-16 19:19:43,293 INFO L226 Difference]: Without dead ends: 655 [2023-12-16 19:19:43,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:43,294 INFO L413 NwaCegarLoop]: 923 mSDtfsCounter, 844 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 1854 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:43,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 1854 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:43,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-16 19:19:43,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2023-12-16 19:19:43,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.5646153846153845) internal successors, (1017), 650 states have internal predecessors, (1017), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:43,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1023 transitions. [2023-12-16 19:19:43,304 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1023 transitions. Word has length 244 [2023-12-16 19:19:43,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:43,304 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 1023 transitions. [2023-12-16 19:19:43,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:43,304 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1023 transitions. [2023-12-16 19:19:43,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-16 19:19:43,305 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:43,305 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:43,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2023-12-16 19:19:43,305 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:43,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:43,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1429247032, now seen corresponding path program 1 times [2023-12-16 19:19:43,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:43,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414490774] [2023-12-16 19:19:43,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:43,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:43,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:43,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:43,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:43,975 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:43,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:43,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414490774] [2023-12-16 19:19:43,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414490774] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:43,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:43,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:43,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411554992] [2023-12-16 19:19:43,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:43,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:43,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:43,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:43,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:43,977 INFO L87 Difference]: Start difference. First operand 655 states and 1023 transitions. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:44,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:44,275 INFO L93 Difference]: Finished difference Result 1192 states and 1848 transitions. [2023-12-16 19:19:44,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:19:44,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 244 [2023-12-16 19:19:44,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:44,276 INFO L225 Difference]: With dead ends: 1192 [2023-12-16 19:19:44,276 INFO L226 Difference]: Without dead ends: 659 [2023-12-16 19:19:44,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:44,277 INFO L413 NwaCegarLoop]: 1017 mSDtfsCounter, 4 mSDsluCounter, 2836 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3853 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:44,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3853 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 19:19:44,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2023-12-16 19:19:44,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 657. [2023-12-16 19:19:44,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 652 states have (on average 1.562883435582822) internal successors, (1019), 652 states have internal predecessors, (1019), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:44,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1025 transitions. [2023-12-16 19:19:44,295 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1025 transitions. Word has length 244 [2023-12-16 19:19:44,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:44,295 INFO L495 AbstractCegarLoop]: Abstraction has 657 states and 1025 transitions. [2023-12-16 19:19:44,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:44,295 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1025 transitions. [2023-12-16 19:19:44,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2023-12-16 19:19:44,296 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:44,296 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:44,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2023-12-16 19:19:44,296 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:44,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:44,297 INFO L85 PathProgramCache]: Analyzing trace with hash -18771512, now seen corresponding path program 1 times [2023-12-16 19:19:44,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:44,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631638825] [2023-12-16 19:19:44,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:44,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:44,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:44,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 19:19:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:44,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-16 19:19:44,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:44,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 19:19:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:44,890 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:44,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:44,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631638825] [2023-12-16 19:19:44,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631638825] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:44,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:44,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 19:19:44,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938214260] [2023-12-16 19:19:44,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:44,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 19:19:44,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:44,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 19:19:44,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:19:44,892 INFO L87 Difference]: Start difference. First operand 657 states and 1025 transitions. Second operand has 7 states, 7 states have (on average 33.285714285714285) internal successors, (233), 7 states have internal predecessors, (233), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:45,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:45,268 INFO L93 Difference]: Finished difference Result 1251 states and 1937 transitions. [2023-12-16 19:19:45,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 19:19:45,268 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.285714285714285) internal successors, (233), 7 states have internal predecessors, (233), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 245 [2023-12-16 19:19:45,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:45,270 INFO L225 Difference]: With dead ends: 1251 [2023-12-16 19:19:45,270 INFO L226 Difference]: Without dead ends: 665 [2023-12-16 19:19:45,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-12-16 19:19:45,272 INFO L413 NwaCegarLoop]: 1005 mSDtfsCounter, 1916 mSDsluCounter, 3026 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1916 SdHoareTripleChecker+Valid, 4031 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:45,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1916 Valid, 4031 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 19:19:45,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2023-12-16 19:19:45,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 659. [2023-12-16 19:19:45,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 654 states have (on average 1.5596330275229358) internal successors, (1020), 654 states have internal predecessors, (1020), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:45,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 1026 transitions. [2023-12-16 19:19:45,287 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 1026 transitions. Word has length 245 [2023-12-16 19:19:45,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:45,287 INFO L495 AbstractCegarLoop]: Abstraction has 659 states and 1026 transitions. [2023-12-16 19:19:45,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.285714285714285) internal successors, (233), 7 states have internal predecessors, (233), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:45,287 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 1026 transitions. [2023-12-16 19:19:45,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2023-12-16 19:19:45,288 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:45,288 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:45,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2023-12-16 19:19:45,288 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:45,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:45,289 INFO L85 PathProgramCache]: Analyzing trace with hash 94871982, now seen corresponding path program 1 times [2023-12-16 19:19:45,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:45,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586945095] [2023-12-16 19:19:45,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:45,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:45,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-16 19:19:45,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:45,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-16 19:19:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:45,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-16 19:19:45,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:45,969 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:45,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:45,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586945095] [2023-12-16 19:19:45,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586945095] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:45,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:45,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 19:19:45,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915604304] [2023-12-16 19:19:45,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:45,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 19:19:45,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:45,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 19:19:45,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-16 19:19:45,971 INFO L87 Difference]: Start difference. First operand 659 states and 1026 transitions. Second operand has 8 states, 8 states have (on average 29.25) internal successors, (234), 8 states have internal predecessors, (234), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:46,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:46,457 INFO L93 Difference]: Finished difference Result 1259 states and 1947 transitions. [2023-12-16 19:19:46,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 19:19:46,457 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 29.25) internal successors, (234), 8 states have internal predecessors, (234), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 246 [2023-12-16 19:19:46,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:46,458 INFO L225 Difference]: With dead ends: 1259 [2023-12-16 19:19:46,458 INFO L226 Difference]: Without dead ends: 665 [2023-12-16 19:19:46,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2023-12-16 19:19:46,459 INFO L413 NwaCegarLoop]: 1073 mSDtfsCounter, 1787 mSDsluCounter, 3998 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1790 SdHoareTripleChecker+Valid, 5071 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:46,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1790 Valid, 5071 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 19:19:46,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2023-12-16 19:19:46,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 660. [2023-12-16 19:19:46,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 655 states have (on average 1.5587786259541985) internal successors, (1021), 655 states have internal predecessors, (1021), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:46,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1027 transitions. [2023-12-16 19:19:46,477 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1027 transitions. Word has length 246 [2023-12-16 19:19:46,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:46,477 INFO L495 AbstractCegarLoop]: Abstraction has 660 states and 1027 transitions. [2023-12-16 19:19:46,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.25) internal successors, (234), 8 states have internal predecessors, (234), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:46,477 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1027 transitions. [2023-12-16 19:19:46,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2023-12-16 19:19:46,478 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:46,478 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:46,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2023-12-16 19:19:46,478 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:46,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:46,478 INFO L85 PathProgramCache]: Analyzing trace with hash 439700144, now seen corresponding path program 1 times [2023-12-16 19:19:46,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:46,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672739979] [2023-12-16 19:19:46,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:46,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:47,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-16 19:19:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:47,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-16 19:19:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:47,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-16 19:19:47,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:47,314 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:47,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:47,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672739979] [2023-12-16 19:19:47,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672739979] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:47,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:47,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:47,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577310302] [2023-12-16 19:19:47,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:47,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:47,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:47,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:47,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:47,315 INFO L87 Difference]: Start difference. First operand 660 states and 1027 transitions. Second operand has 5 states, 5 states have (on average 46.8) internal successors, (234), 5 states have internal predecessors, (234), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:47,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:47,392 INFO L93 Difference]: Finished difference Result 1938 states and 2896 transitions. [2023-12-16 19:19:47,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 19:19:47,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.8) internal successors, (234), 5 states have internal predecessors, (234), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 246 [2023-12-16 19:19:47,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:47,397 INFO L225 Difference]: With dead ends: 1938 [2023-12-16 19:19:47,397 INFO L226 Difference]: Without dead ends: 1402 [2023-12-16 19:19:47,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:19:47,398 INFO L413 NwaCegarLoop]: 1823 mSDtfsCounter, 1623 mSDsluCounter, 3968 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1623 SdHoareTripleChecker+Valid, 5791 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:47,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1623 Valid, 5791 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:19:47,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2023-12-16 19:19:47,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 766. [2023-12-16 19:19:47,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 761 states have (on average 1.4940867279894876) internal successors, (1137), 761 states have internal predecessors, (1137), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:47,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1143 transitions. [2023-12-16 19:19:47,426 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1143 transitions. Word has length 246 [2023-12-16 19:19:47,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:47,426 INFO L495 AbstractCegarLoop]: Abstraction has 766 states and 1143 transitions. [2023-12-16 19:19:47,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.8) internal successors, (234), 5 states have internal predecessors, (234), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:47,426 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1143 transitions. [2023-12-16 19:19:47,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2023-12-16 19:19:47,427 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:47,427 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:47,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2023-12-16 19:19:47,427 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:47,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:47,428 INFO L85 PathProgramCache]: Analyzing trace with hash 574494380, now seen corresponding path program 1 times [2023-12-16 19:19:47,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:47,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986767646] [2023-12-16 19:19:47,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:47,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:47,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-16 19:19:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:47,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-16 19:19:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:47,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-16 19:19:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:47,760 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:47,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:47,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986767646] [2023-12-16 19:19:47,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986767646] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:47,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:47,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:47,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972428499] [2023-12-16 19:19:47,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:47,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:47,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:47,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:47,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:47,762 INFO L87 Difference]: Start difference. First operand 766 states and 1143 transitions. Second operand has 5 states, 5 states have (on average 47.0) internal successors, (235), 5 states have internal predecessors, (235), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:47,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:47,823 INFO L93 Difference]: Finished difference Result 1965 states and 2937 transitions. [2023-12-16 19:19:47,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 19:19:47,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 47.0) internal successors, (235), 5 states have internal predecessors, (235), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 247 [2023-12-16 19:19:47,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:47,825 INFO L225 Difference]: With dead ends: 1965 [2023-12-16 19:19:47,825 INFO L226 Difference]: Without dead ends: 1323 [2023-12-16 19:19:47,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:19:47,826 INFO L413 NwaCegarLoop]: 1103 mSDtfsCounter, 1617 mSDsluCounter, 3156 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1617 SdHoareTripleChecker+Valid, 4259 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:47,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1617 Valid, 4259 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:19:47,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2023-12-16 19:19:47,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 780. [2023-12-16 19:19:47,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 775 states have (on average 1.495483870967742) internal successors, (1159), 775 states have internal predecessors, (1159), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:19:47,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1165 transitions. [2023-12-16 19:19:47,845 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1165 transitions. Word has length 247 [2023-12-16 19:19:47,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:47,845 INFO L495 AbstractCegarLoop]: Abstraction has 780 states and 1165 transitions. [2023-12-16 19:19:47,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.0) internal successors, (235), 5 states have internal predecessors, (235), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:19:47,846 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1165 transitions. [2023-12-16 19:19:47,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2023-12-16 19:19:47,846 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:47,847 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:47,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2023-12-16 19:19:47,847 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:47,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:47,847 INFO L85 PathProgramCache]: Analyzing trace with hash 121340330, now seen corresponding path program 1 times [2023-12-16 19:19:47,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:47,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174858952] [2023-12-16 19:19:47,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:47,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:49,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-16 19:19:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:49,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-16 19:19:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:49,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-16 19:19:49,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:49,367 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:19:49,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:49,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174858952] [2023-12-16 19:19:49,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174858952] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:49,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:49,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-16 19:19:49,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229709148] [2023-12-16 19:19:49,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:49,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 19:19:49,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:49,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 19:19:49,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-16 19:19:49,369 INFO L87 Difference]: Start difference. First operand 780 states and 1165 transitions. Second operand has 11 states, 11 states have (on average 21.363636363636363) internal successors, (235), 11 states have internal predecessors, (235), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Received shutdown request... [2023-12-16 19:19:50,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 19:19:50,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2023-12-16 19:19:50,345 INFO L413 NwaCegarLoop]: 691 mSDtfsCounter, 2195 mSDsluCounter, 3387 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2196 SdHoareTripleChecker+Valid, 4078 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:50,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2196 Valid, 4078 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-16 19:19:50,346 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 19:19:50,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2023-12-16 19:19:50,347 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (780states) and FLOYD_HOARE automaton (currently 13 states, 11 states before enhancement),while ReachableStatesComputation was computing reachable states (1502 states constructed, input type IntersectNwa). [2023-12-16 19:19:50,350 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:50,352 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 19:19:50,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 07:19:50 BoogieIcfgContainer [2023-12-16 19:19:50,355 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 19:19:50,355 INFO L158 Benchmark]: Toolchain (without parser) took 46182.25ms. Allocated memory was 243.3MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 193.1MB in the beginning and 648.2MB in the end (delta: -455.1MB). Peak memory consumption was 623.8MB. Max. memory is 8.0GB. [2023-12-16 19:19:50,355 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 201.3MB. Free memory is still 157.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 19:19:50,355 INFO L158 Benchmark]: CACSL2BoogieTranslator took 595.01ms. Allocated memory is still 243.3MB. Free memory was 192.7MB in the beginning and 198.4MB in the end (delta: -5.7MB). Peak memory consumption was 61.2MB. Max. memory is 8.0GB. [2023-12-16 19:19:50,355 INFO L158 Benchmark]: Boogie Procedure Inliner took 226.14ms. Allocated memory is still 243.3MB. Free memory was 197.9MB in the beginning and 135.5MB in the end (delta: 62.4MB). Peak memory consumption was 61.9MB. Max. memory is 8.0GB. [2023-12-16 19:19:50,355 INFO L158 Benchmark]: Boogie Preprocessor took 392.27ms. Allocated memory is still 243.3MB. Free memory was 135.5MB in the beginning and 159.2MB in the end (delta: -23.7MB). Peak memory consumption was 57.6MB. Max. memory is 8.0GB. [2023-12-16 19:19:50,355 INFO L158 Benchmark]: RCFGBuilder took 2165.96ms. Allocated memory was 243.3MB in the beginning and 437.3MB in the end (delta: 194.0MB). Free memory was 159.2MB in the beginning and 238.1MB in the end (delta: -78.9MB). Peak memory consumption was 118.0MB. Max. memory is 8.0GB. [2023-12-16 19:19:50,355 INFO L158 Benchmark]: TraceAbstraction took 42797.90ms. Allocated memory was 437.3MB in the beginning and 1.3GB in the end (delta: 883.9MB). Free memory was 237.6MB in the beginning and 648.2MB in the end (delta: -410.5MB). Peak memory consumption was 473.4MB. Max. memory is 8.0GB. [2023-12-16 19:19:50,357 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.09ms. Allocated memory is still 201.3MB. Free memory is still 157.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 595.01ms. Allocated memory is still 243.3MB. Free memory was 192.7MB in the beginning and 198.4MB in the end (delta: -5.7MB). Peak memory consumption was 61.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 226.14ms. Allocated memory is still 243.3MB. Free memory was 197.9MB in the beginning and 135.5MB in the end (delta: 62.4MB). Peak memory consumption was 61.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 392.27ms. Allocated memory is still 243.3MB. Free memory was 135.5MB in the beginning and 159.2MB in the end (delta: -23.7MB). Peak memory consumption was 57.6MB. Max. memory is 8.0GB. * RCFGBuilder took 2165.96ms. Allocated memory was 243.3MB in the beginning and 437.3MB in the end (delta: 194.0MB). Free memory was 159.2MB in the beginning and 238.1MB in the end (delta: -78.9MB). Peak memory consumption was 118.0MB. Max. memory is 8.0GB. * TraceAbstraction took 42797.90ms. Allocated memory was 437.3MB in the beginning and 1.3GB in the end (delta: 883.9MB). Free memory was 237.6MB in the beginning and 648.2MB in the end (delta: -410.5MB). Peak memory consumption was 473.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 21). Cancelled while NwaCegarLoop was constructing difference of abstraction (780states) and FLOYD_HOARE automaton (currently 13 states, 11 states before enhancement),while ReachableStatesComputation was computing reachable states (1502 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data [2023-12-16 19:19:50,362 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 CFG has 2 procedures, 657 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 42.8s, OverallIterations: 66, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 84395 SdHoareTripleChecker+Valid, 9.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 84318 mSDsluCounter, 146955 SdHoareTripleChecker+Invalid, 7.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 81937 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12102 IncrementalHoareTripleChecker+Invalid, 12176 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 65018 mSDtfsCounter, 12102 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 793 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=780occurred in iteration=65, InterpolantAutomatonStates: 281, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 65 MinimizatonAttempts, 1192 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 6.5s SatisfiabilityAnalysisTime, 21.3s InterpolantComputationTime, 15555 NumberOfCodeBlocks, 15555 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 15489 ConstructedInterpolants, 0 QuantifiedInterpolants, 99465 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 66 InterpolantComputations, 66 PerfectInterpolantSequences, 792/792 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown